Multiple pickup and delivery TSP with LIFO and distance constraints: A VNS approach

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6704 LNAI, Issue PART 2, 2011, Pages 193-202

  Gao, Xiang ^a   Lim, Andrew ^a   Qin, Hu ^a,b   Zhu, Wenbin ^c  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

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

Author keywords

distance constraint; last in first out loading; pickup and delivery; traveling salesman problem; variable neighborhood search

Indexed keywords

DISTANCE CONSTRAINTS; LAST IN FIRST OUTS; PICKUP AND DELIVERY; TRAVELING SALESMAN; VARIABLE NEIGHBORHOOD SEARCH;

DATA STRUCTURES; DYNAMIC PROGRAMMING; INDUSTRIAL ENGINEERING; INTELLIGENT SYSTEMS; PICKUPS; PROBLEM SOLVING; TREES (MATHEMATICS);

TRAVELING SALESMAN PROBLEM;

EID: 79960505284     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21827-9_20     Document Type: Conference Paper

References (12)

1. Bräysy, O., Gendreau, M.: Vehicle routing problem with time windows, part I: Route construction and local search algorithms. Transportation Science 39(1), 104-118 (2005)
2. Carrabs, F., Cordeau, J.-F., Laporte, G.: Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading. INFORMS Journal on Computing 19(4), 618-632 (2007)
3. Cassani, L., Righini, G.: Heuristic algorithms for the TSP with rear-loading. In: 35th Annual Conference of the Italian Operational Research Society (AIRO XXXV), Lecce, Italy (September 2004)
4. Cordeau, J.-F., Iori, M., Laporte, G., González, J.J.S.: A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading. Networks 55(1), 46-59 (2010)
5. Erera, A.L., Morales, J.C., Savelsbergh, M.: The vehicle routing problem with stochastic demand and duration constraints. Transportation Science (2010)
6. Felipe, A., Ortuño, M.T., Tirado, G.: The double traveling salesman problem with multiple stacks: A variable neighborhood search approach. Computers & OperationsResearch 36(11), 2983-2993 (2009)
7. Ladany, S.P., Mehrez, A.: Optimal routing of a single vehicle with loading and unloading constraints. Transportation Planning and Technology 8(4), 301-306 (1984)
8. Levitin, G., Abezgaouz, R.: Optimal routing of multiple-load AGV subject to LIFO loading constraints. Computer & Operations Research 30(3), 397-410 (2003)
9. Li, C.-L., Simchi-Levi, D., Desrochers, M.: On the distance constrained vehicle routing problem. Operations Research 40(4), 790-799 (1992)
10. Mladenović, N., Hansen, P.: Variable neighborhood search. Computers & Operations Research 24(11), 1097-1100 (1997)
11. Tricoire, F., Doerner, K.F., Hartl, R.F., Iori, M.: Heuristic and exact algorithms for the multipile vehicle routing problem. OR Spectrum (2009)
12. Tu, D., Guo, S., Qin, H., Oon, W.-C., Lim, A.: The tree representation of feasible solutions for the tsp with pickup and delivery and LIFO loading. In: Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2010), Atlanta, Georgia, USA, pp. 191-196 (July 2010)