An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics

Computers and Operations Research

Volumn 39, Issue 12, 2012, Pages 3215-3228

  Hemmelmayr, Vera C ^a,b   Cordeau, Jean François ^b,d   Crainic, Teodor Gabriel ^b,c  

^a VIENNA UNIVERSITY OF ECONOMICS AND BUSINESS   (Austria)

^b INTERUNIVERSITY RESEARCH CENTRE ON ENTERPRISE NETWORKS   (Canada)

^c Logistics and Transport   (Canada)

^d HEC MONTRÉAL   (Canada)

Author keywords

Adaptive large neighborhood search heuristic; City logistics; Location Routing Problem; Two Echelon Vehicle Routing Problem

Indexed keywords

CITY LOGISTICS; COMPUTATIONAL EXPERIMENT; LARGE NEIGHBORHOOD SEARCH; LOCATION ROUTING PROBLEM; NEIGHBORHOOD SEARCH; SECOND LEVEL; SOLUTION METHODS; TRANSPORTATION SYSTEM; VEHICLE ROUTING PROBLEMS;

HEURISTIC ALGORITHMS; NETWORK ROUTING;

ROUTING ALGORITHMS;

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

References (33)

1. Akca Z, Berger R, Ralphs T. Modeling and solving location routing and scheduling problems. In: Proceedings of the eleventh INFORMS computing society meeting; 2009. p. 309-30.
2. R. Baldacci, A. Mingozzi, and R. WolflerCalvo An exact method for the capacitated location-routing problem Operations Research 59 2011 1284 1296
3. Barreto S. Análise e Modelização de Problemas de localização-distribuição [Analysis and modelling of location-routing problems]. Unpublished doctoral dissertation. University of Aveiro, Campus Universitário de Santiago; 2004.
4. J. Beasley Route first-cluster second methods for vehicle routing Omega 11 1983 403 408
5. J. Belenguer, E. Benavent, C. Prins, C. Prodhon, and R. Wolfler Calvo A branch-and-cut method for the capacitated location-routing problem Computers & Operations Research 38 2011 931 941
6. M. Boccia, T. Crainic, A. Sforza, and C. Sterle A metaheuristic for a two echelon location-routing problem P. Festa, Experimental algorithms. Lecture notes in computer science vol. 6049 2010 Springer 288 301
7. Boccia M, Crainic T, Sforza A, Sterle C. Location-routing models for designing a two-echelon freight distribution system. Technical report CIRRELT-2011-06. Université de Montréal; 2011.
8. G. Clarke, and J.W. Wright Scheduling of vehicles from a central depot to a number of delivery points Operations Research 12 1964 568 581
9. Contardo C, Cordeau J-F, Gendron B. A branch-and-cut-and-price algorithm for the capacitated location routing problem. Technical report CIRRELT-2011-44. Canada: Université de Montréal; 2010.
10. Contardo C, Cordeau J-F, Gendron B. Computational comparison of flow formulations for the capacitated location-routing problem. Technical report CIRRELT-2011-47. Canada: Université de Montréal; 2010.
11. Crainic T, Mancini S, Perboli G, Tadei R. Multi-start heuristics for the two-echelon vehicle routing problem. In: Merz P, Hao J-K, editors. Evolutionary computation in combinatorial optimization: 11th European conference, EvoCOP 2011, Torino, Italy, April 27-29, 2011, proceedings. Lecture notes in computer science, vol. 6622. Springer; 2011. p. 179-90.
12. T. Crainic, G. Perboli, S. Mancini, and R. Tadei The two-echelon capacitated vehicle routing problem: a satellite location analysis PROCEDIA - Social and Behavioral Sciences 2 3 2010 5944 5955
13. T. Crainic, N. Ricciardi, and G. Storchi Advanced freight transportation systems for congested urban areas Transportation Research Part C 12 2004 119 137 (Pubitemid 39239100)
14. T. Crainic, N. Ricciardi, and G. Storchi Models for evaluating and planning city logistics systems Transportation Science 43 2009 432 454
15. G. Croes A method for solving traveling salesman problems Operations Research 6 1958 791 812
16. C. Duhamel, P. Lacomme, C. Prins, and C. Prodhon A GRASP×ELS approach for the capacitated location-routing problem Computers & Operations Research 37 2010 1912 1923
17. S. Jacobsen, and O. Madsen A comparative study of heuristics for a two-level routing-location problem European Journal of Operational Research 5 1980 378 387
18. G. Laporte Location-routing problems B. Golden, A. Assad, Vehicle routing: methods and studies 1988 North-Holland Amsterdam 163 197
19. G. Nagy, and S. Salhi Location-routing: issues, models and methods European Journal of Operational Research 177 2007 649 672 (Pubitemid 44647670)
20. G. Perboli, and R. Tadei New families of valid inequalities for the two-echelon vehicle routing problem Electronic Notes in Discrete Mathematics 36 2010 639 646
21. Perboli G, Tadei R. Personal communication; 2011.
22. G. Perboli, R. Tadei, and D. Vigo The two-echelon capacitated vehicle routing problem: models and math-based heuristics Transportation Science 45 2011 364 380
23. S. Pirkwieser, and G. Raidl Variable neighborhood search coupled with ILP-based very large neighborhood searches for the (periodic) location-routing problem M. Blesa, C. Blum, G. Raidl, A. Roli, M. Sampels, Hybrid metaheuristics. Lecture notes in computer science vol. 6373 2010 Springer 174 189
24. D. Pisinger, and S. Ropke A general heuristic for vehicle routing problems Computers & Operations Research 34 2007 2403 2435 (Pubitemid 46073431)
25. J. Potvin, and J. Rousseau An exchange heuristic for routing problems with time windows Journal of the Operational Research Society 46 1995 1433 1446
26. C. Prins A simple and effective evolutionary algorithm for the vehicle routing problem Computers & Operations Research 31 2004 1985 2002 (Pubitemid 38728564)
27. C. Prins, C. Prodhon, A. Ruiz, P. Soriano, and R. Wolfler Calvo Solving the capacitated location-routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristic Transportation Science 41 2007 470 483
28. Prins C, Prodhon C, Wolfler Calvo R. Nouveaux algorithmes pour le problème de localisation et routage sous contraintes de capacité. In: Dolgui A, Dauzère-Pérès S, editors. MOSIM, vol. 4. Lavoisier: Ecole des Mines de Nantes; 2004. p. 1115-22.
29. C. Prins, C. Prodhon, and R. Wolfler Calvo A memetic algorithm with population management capacitated location-routing problem J. Gottlieb, G. Raidl, Evolutionary computation in combinatorial optimization. Lecture notes in computer science vol. 3906 2006 Springer 183 194 (Pubitemid 44019284)
30. C. Prins, C. Prodhon, and R. Wolfler Calvo Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking 4OR: A Quarterly Journal of Operations Research 4 2006 221 238
31. S. Ropke, and D. Pisinger An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows Transportation Science 40 2006 455 472 (Pubitemid 44746135)
32. D. Tuzun, and L. Burke A two-phase tabu search approach to the location routing problem European Journal of Operational Research 116 1999 87 99
33. V. Yu, S. Lin, W. Lee, and C. Ting A simulated annealing heuristic for the capacitated location routing problem Computers & Industrial Engineering 58 2 2010 288 299