A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading

Computers and Operations Research

Volumn 62, Issue , 2015, Pages 23-35

  Cherkesly, Marilène ^a,d   Desaulniers, Guy ^a,d   Laporte, Gilbert ^b,c,d  

^a ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

^b HEC MONTRÉAL   (Canada)

^c INTERUNIVERSITY RESEARCH CENTRE ON ENTERPRISE NETWORKS   (Canada)

^d GERAD   (Canada)

Author keywords

Adaptive large neighborhood search; Genetic algorithm; GRASP; Last in first out loading; Vehicle routing with pickup and delivery

Indexed keywords

GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; LOCAL SEARCH (OPTIMIZATION); OPTIMIZATION; PICKUPS; UNLOADING; VEHICLE ROUTING; VEHICLES;

ADAPTIVE LARGE NEIGHBORHOOD SEARCHES; COMPUTATIONAL RESULTS; GRASP; GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE; LAST IN FIRST OUTS; PICKUP AND DELIVERY; PICKUP AND DELIVERY PROBLEM WITH TIME WINDOWS; POPULATION DIVERSITY;

LOADING;

EID: 84929469516     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2015.04.002     Document Type: Article

References (30)

1. Ambrosini M, Caruso T, Foresti S, Righini G. A GRASP for the pickup and delivery problem with rear loading. Technical Report. Note del Polo-Ricerca n.65, DTI. University of Milan; 2004.
2. M. Battarra, G. Erdoʇan, G. Laporte, and D. Vigo The traveling salesman problem with pickups, deliveries, and handling costs Transp Sci 44 3 2010 383 399
3. R. Bent, and P. van Hentenryck A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows Comput Oper Res 33 4 2006 875 893
4. G. Berbeglia, J.-F. Cordeau, I. Gribkovskaia, and G. Laporte Static pickup and delivery problems a classification scheme and survey TOP 15 2007 1 31
5. O. Bräysy, and M. Gendreau Vehicle routing problem with time windows. Part I. Route construction and local search algorithms Transp Sci 39 1 2005 104 118
6. O. Bräysy, and M. Gendreau Vehicle routing problem with time windows. Part II. Metaheuristics Transp Sci 39 1 2005 119 139
7. F. Carrabs, J.-F. Cordeau, and G. Laporte Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading INFORMS J Comput 19 4 2007 618 632
8. Cassani L. Algoritmi euristici per il TSP with rear-loading. (http://optlab.dti.unimi.it/docs/Cassani.pdf); 2004.
9. B. Cheang, X. Gao, A. Lim, H. Qin, and W. Zhu Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints Eur J Oper Res 223 1 2012 60 75
10. Cherkesly M, Desaulniers G, Laporte G. Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and last-in-first-out loading. Transp Sci 2015, forthcoming. http://dx.doi.org/10.1287/trsc.2014.0535.
11. J.-F. Cordeau, and G. Laporte A tabu search heuristic for the static multi-vehicle dial-a-ride problem Transp Res Part B 37 6 2003 579 594
12. G. Erdoʇan, M. Battarra, G. Laporte, and D. Vigo Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs Comput Oper Res 39 5 2012 1074 1086
13. T.A. Feo, and M.G.C. Resende A probabilistic heuristic for a computationally difficult set covering problem Oper Res Lett 8 2 1989 67 71
14. T.A. Feo, and M.G.C. Resende Greedy randomized adaptive search procedures J Glob Optim 6 2 1995 109 133
15. Gao X, Lim A, Qin H, Zhu W. Multiple pickup and delivery TSP with LIFO and distance constraints: a VNS approach. In: Mehrotra K, Mohan C, Oh J, Varshney P, Ali M, editors. Modern approaches in applied intelligence. Lecture notes in computer science, vol. 6704. Berlin, Heidelberg: Springer; 2011. p. 193-202.
16. H. Li, and A. Lim A metaheuristic for the pickup and delivery problem with time windows Int J Artif Intell Tools 12 2 2003 173 186
17. Y. Li, A. Lim, W.-C. Oon, H. Qin, and D. Tu The tree representation for the pickup and delivery traveling salesman problem with LIFO loading Eur J Oper Res 212 3 2011 482 496
18. Y. Nagata, O. Bräysy, and W. Dullaert A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows Comput Oper Res 37 4 2010 724 737
19. S. Parragh, K.F. Doerner, and R.F. Hartl A survey on pickup and delivery problems. Part I. Transportation between customers and depot J Betr 58 2008 21 51
20. S. Parragh, K.F. Doerner, and R.F. Hartl A survey on pickup and delivery problems. Part II. Transportation between pickup and delivery locations J Betr 58 2008 81 117
21. C. Prins A simple and effective evolutionary algorithm for the vehicle routing problem Comput Oper Res 31 12 2004 1985 2002
22. M.G.C. Resende, and C.C. Ribeiro Greedy randomized adaptive search procedures advances, hybridizations, and applications Handbook of metaheuristics 2010 Springer New York 283 319
23. Y. Rochat, and E.D. Taillard Probabilistic diversification and intensification in local search for vehicle routing J Heuristics 1 1 1995 147 167
24. S. Ropke, and J.-F. Cordeau Branch and cut and price for the pickup and delivery problem with time windows Transp Sci 43 3 2009 267 286
25. S. Ropke, and D. Pisinger An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows Transp Sci 40 4 2006 455 472
26. Shaw P. A new local search algorithm providing high quality solutions to vehicle routing problems. Technical Report. Department of Computer Science, University of Strathclyde, Glasgow, UK; 1997.
27. SPEC, CPU 2006 results. (http://www.spec.org/cpu2006/results/cpu2006.html); 2014.
28. T. Vidal, T. Crainic, M. Gendreau, N. Lahrichi, and W. Rei A hybrid genetic algorithm for multidepot and periodic vehicle routing problems Oper Res 60 3 2012 611 624
29. T. Vidal, T.G. Crainic, M. Gendreau, and C. Prins Heuristics for multi-attribute vehicle routing problems: a survey and synthesis Eur J Oper Res 231 1 2013 1 21
30. T. Vidal, T.G. Crainic, M. Gendreau, and C. Prins A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows Comput Oper Res 40 1 2013 475 489