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

Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI

Volumn 2005, Issue , 2005, Pages 58-65

  Geng, Yue ^a   Li, Yanzhi ^a   Lim, Andrew ^a  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; DYNAMIC PROGRAMMING; PROBLEM SOLVING; ROUTERS; SEARCH ENGINES; SYSTEMS ANALYSIS;

BRANCH AND PRICE METHOD; CAPACITATED WAREHOUSE ROUTING PROBLEM (CWRP); VERY LARGE-SCALE NEIGHBORHOOD (VLSN);

LARGE SCALE SYSTEMS;

EID: 33845891587     PISSN: 10823409     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICTAI.2005.21     Document Type: Conference Paper

References (14)

1. R. Ahuja, J. Orlin, S. Pallottino, M. Scaparra, and M. Scutellà. A multi-exchange heuristic for the single-source capacitated facility location problem. Management Science, 50(6):749-760, June 2004.
2. R. K. Ahuja, H. Ergun, J. B. Orlin, and A. P. Punnen. A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics, 123:75-102, 2002.
3. R. K. Ahuja, J. B. Orlin, and D. Sharma. Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem. Math. Program., Ser. A(91):71-97, 2001.
4. R. Baldacci, E. Hadjiconstantinou, and A. Mingozzi. An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation. Operations Research, 52(5):723-738, Sep-Oct 2004.
5. J. J. Bartholdi and S. T. Hackman. Warehouse and Distribution Science. Release 0.40, available online at http://www.tli.gatech.edu/whscience/, January 2005.
6. J. Fonlupt and A. Nachef. Dynamic programming and the graphical traveling salesman problem. Journal of the ACM, 40(5):1165-1187, November 1993.
7. E. H. Frazelle. World-Class Warehousing. Logistics Resources International, Atlanta, GA, 1996.
8. M. R. Garey and D. S. Johnson. Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman and Company, San Francisco, CA, 1979.
9. R. Hall. Distance approximations for routing mannual pickers in a warehouse. IIE Transactions, 25(4):76-87, July 1993.
10. R. D. Koster and E. V. D. Poort. Routing order pickers in a warehouse: A comparison between optimal and heuristic solutions. IIE Transactions, 30:469-480, 1998.
11. A. Lim and X. Zhang. Integer programming and simulated annealing for scheduling sports competition on multiple venues. The 5th Metaheuristics International Conference (MIC2003), 2003.
12. L. S. Pitsoulis and M. G. Resende. Greedy randomized adaptive search procedures. AT&T Labs Research Technical Report, Jan 2001.
13. H. Ratliff and A. S. Rosenthal. Order-picking in a rectangular warehouse: A solvable case of the travling salesman problem. Operations Research, 31(3):507-521, May-June 1983.
14. K. J. Roodbergen and R. de Koster. Routing order pickers in a warehouse with a middle aisle. European Journal of Operational Research, 133:32-43, 2001.