By Topic

A very large-scale neighborhood search approach to capacitated warehouse routing problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yue Geng ; Dept. of Ind. Eng. & Logistics Manage., Hong Kong Univ. of Sci. & Technol., Kowloon, China ; Yanzhi Li ; A. Lim

Warehouse management is an important issue in supply chain management. Among all warehouse operations, "order-picking" is the most expensive one and its cost is mainly due to the travelling expenses. In this paper, we study the capacitated warehouse routing problem (CWRP) so as to save the travelling cost, i.e., travelling distance in order-picking. The problem is shown to be strongly NP-hard. However, by noting that the unconstrained routing problem can be tackled by a dynamic programming method, a search heuristic, which is based on the very large-scale neighborhood (VLSN) technique, was designed to solve the capacity-constrained version. We compared the computational results with solutions obtained from branch-and-price method, which are within 1% error bound and identified that our heuristic is efficient in getting high quality solutions of CWRP

Published in:

17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)

Date of Conference:

16-16 Nov. 2005