Survey: Matheuristics for rich vehicle routing problems

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

Volumn 6373 LNCS, Issue , 2010, Pages 206-221

  Doerner, Karl F ^a   Schmid, Verena ^a  

^a UNIVERSITY OF VIENNA   (Austria)

Author keywords

hybrid metaheuristics; matheuristics; rich vehicle routing problems

Indexed keywords

DECOMPOSITION TECHNIQUE; EXACT SOLUTION; HYBRID APPROACH; HYBRID METAHEURISTICS; HYBRID SOLUTION; LOCAL BRANCHING; MATHEURISTICS; RICH VEHICLE ROUTING PROBLEMS; SET COVERINGS; VEHICLE ROUTING PROBLEMS;

ROUTING ALGORITHMS; SURVEYS; VEHICLES; HEURISTIC ALGORITHMS; VEHICLE ROUTING;

HEURISTIC ALGORITHMS; HYBRID VEHICLES;

EID: 78349263818     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16054-7_15     Document Type: Conference Paper

References (82)

1. Alegre, J., Laguna, M., Pacheco, J.: Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts. European Journal of Operational Research 179(3), 736-746 (2007)
2. Archetti, C., Speranza, M.G., Hertz, A.: A tabu search algorithm for the split delivery vehicle routing problem. Transportation Science 40(1), 64-73 (2006)
3. Archetti, C., Speranza, M.G., Savelsbergh, M.W.P.: An optimization-based heuristic for the split delivery vehicle routing problem. Transportation Science 42(1), 22-31 (2008)
4. Baldacci, R., Hadjiconstantinou, E., Mingozzi, A.: An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation. Operations Research 52(5), 723-738 (2004)
5. Baldacci, R., Bartolini, E., Mingozzi, A., Roberti, R.: An exact solution framework for a broad class of vehicle routing problems. Computational Management Science 7(3), 229-268 (2010)
6. Baldacci, R., Christofides, N., Mingozzi, A.: An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Mathematical Programming 115(2), 351-385 (2008)
7. Balinski, M.L., Quandt, R.E.: On an integer program for a delivery problem. Operations Research 12(2), 300-304 (1964)
8. Bard, J.F., Kontoravdis, G., Yu, G.: A branch-and-cut procedure for the vehicle routing problem with time windows. Transportation Science 36(2), 250-269 (2002)
9. Bent, R., Van Hentenryck, P.: A two-stage hybrid local search for the vehicle routing problem with time windows. Transportation Science 38(4), 515-530 (2004)
10. Bramel, J., Simchi-Levi, D.: Set-covering-based algorithms for the capacitated VRP. The Vehicle Routing Problem, pp. 85-108. SIAM, Philadelphia (2001)
11. Bräysy, O.: A reactive variable neighborhood search for the vehicle-routing problem with time windows. INFORMS Journal on Computing 15(4), 347-368 (2003)
12. 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)
13. Bräysy, O., Gendreau, M.: Vehicle routing problem with time windows, part ii: Metaheuristics. Transportation Science 39(1), 119-139 (2005)
14. Caprara, A., Fischetti, M., Toth, P.: A heuristic method for the set covering problem. Operations Research 47(5), 730-743 (1999)
15. Cordeau, J.F., Desaulniers, G., Desrosiers, J., Solomon, M.M., Soumis, F.: VRP with Time Windows. The Vehicle Routing Problem, pp. 157-193. SIAM, Philadelphia (2001)
16. Cordeau, J.F., Gendreau, M., Laporte, G.: A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30(2), 105-119 (1997) (Pubitemid 127360996)
17. Cordeau, J.F., Laporte, G.: Tabu Search Heuristics for the Vehicle Routing Problem. Metaheuristic Optimization via Memory and Evolution, pp. 145-163. Springer, Heidelberg (2005)
18. Cordeau, J.F., Laporte, G., Mercier, A.: A unified tabu search heuristic for vehicle routing problems with time windows. Journal of the Operational Research Society 52(8), 928-936 (2001) (Pubitemid 32720268)
19. Cordeau, J.F., Laporte, G., Mercier, A.: Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows. The Journal of the Operational Research Society 55(5), 542-546 (2004)
20. Crainic, T.G., Li, Y., Toulouse, M.: A first multilevel cooperative algorithm for capacitated multicommodity network design. Computers & Operations Research 33(9), 2602-2622 (2006) (Pubitemid 43102510)
21. Danna, E., Le Pape, C.: Branch-and-Price Heuristics: A Case Study on the Vehicle Routing Problem with Time Windows. Column Generation, pp. 99-129. Springer, Heidelberg (2005)
22. De Franceschi, R., Fischetti, M., Toth, P.: A new ILP-based refinement heuristic for vehicle routing problems. Mathematical Programming 105(2-3), 471-499 (2006)
23. Doerner, K.F., Fuellerer, G., Hartl, R.F., Gronalt, M., Iori, M.: Metaheuristics for the vehicle routing problem with loading constraints. Networks 49(4), 294-307 (2007)
24. El-Abd, M., Kamel, M.: A taxonomy of cooperative search algorithms. In: Blesa, M.J., Blum, C., Roli, A., Sampels, M. (eds.) HM 2005. LNCS, vol. 3636, pp. 32-41. Springer, Heidelberg (2005)
25. Fischetti, M., Lodi, A.: Local branching. Mathematical Programming 98(1-3), 23-47 (2003)
26. Fisher, M.L., Jaikumar, R.: A generalized assignment heuristic for vehicle routing. Networks 11(2), 109-124 (1981)
27. Foster, B.A., Ryan, D.M.: An integer programming approach to the vehicle scheduling problem. Operational Research Quarterly 27(2), 367-384 (1976)
28. Fuellerer, G., Doerner, K.F., Hartl, R.F., Iori, M.: Ant colony optimization for the two-dimensional loading vehicle routing problem. Computers & Operations Research 36(3), 655-673 (2009)
29. Fuellerer, G., Doerner, K.F., Hartl, R.F., Iori, M.: Metaheuristics for vehicle routing problems with three-dimensional loading constraints. European Journal of Operational Research 201(3), 751-759 (2010)
30. Fukasawa, R., Longo, H., Lysgaard, J., Poggi de Aragão, M., Reis, M., Uchoa, E., Werneck, R.F.: Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Mathematical Programming 106(3), 491-511 (2006)
31. Gendreau, M., Hertz, A., Laporte, G.: New insertion and postoptimization procedures for the traveling salesman problem. Operations Research 40(6), 1086-1094 (1992)
32. Gendreau, M., Iori, M., Laporte, G., Martello, S.: A tabu search algorithm for a routing and container loading problem. Transportation Science 40(3), 342-350 (2006)
33. Gendreau, M., Iori, M., Laporte, G., Martello, S.: A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks 51(1), 4-18 (2008)
34. Gendreau, M., Laporte, G., Potvin, J.Y.: Metaheuristics for the capacitated VRP. The Vehicle Routing Problem, pp. 129-154. SIAM, Philadelphia (2001)
35. Hansen, P., Mladenović, N., Urošević, D.: Variable neighborhood search and local branching. Computers & Operations Research 33(10), 3034-3045 (2006)
36. Hashimoto, H., Yagiura, M., Ibaraki, T.: An iterated local search algorithm for the time-dependent vehicle routing problem with time windows. Discrete Optimization 5(2), 434-456 (2008)
37. Ibaraki, T., Imahori, S., Kubo, M., Masuda, T., Uno, T., Yagiura, M.: Effective local search algorithms for routing and scheduling problems with general timewindow constraints. Transportation Science 39(2), 206-232 (2005)
38. Kelly, J.P., Xu, J.: A set-partitioning-based heuristic for the vehicle routing problem. INFORMS Journal on Computing 11(2), 161-172 (1999)
39. Kohl, N., Madsen, O.B.G.: An optimization algorithm for the vehicle routing problem with time windows based on lagrangian relaxation. Operations Research 45(3), 395-406 (1997)
40. Koskosidis, Y.A., Powell, W.B., Solomon, M.M.: An optimization-based heuristic for vehicle routing and scheduling with soft time window constraints. Transportation Science 26(2), 69-85 (1992)
41. Laporte, G.: What you should know about the vehicle routing problem. Naval Research Logistics 54(8), 811-819 (2007)
42. Laporte, G.: Fifty years of vehicle routing. Transportation Science 43(4), 408-416 (2009)
43. Laporte, G., Nobert, Y.: Exact solution of the vehicle routing problem. In: Martello, S., Laporte, G., Minoux, M., Ribeiro, C.C. (eds.) Surveys in Combinatorial Optimization. North-Holland Mathematics Studies, vol. 132, pp. 147-184. North-Holland, Amsterdam (1987)
44. Laporte, G., Semet, F.: Classical heuristics for the capacitated VRP. The Vehicle Routing Problem, pp. 109-128. SIAM, Philadelphia (2001)
45. Le Bouthillier, A., Crainic, T.G.: A cooperative parallel meta-heuristic for the vehicle routing problem with time windows. Computers & Operations Research 32(7), 1685-1708 (2005)
46. Letchford, A.N., Salazar-González, J.J.: Projection results for vehicle routing. Mathematical Programming 105(2-3), 251-274 (2006)
47. Maniezzo, V., Stützle, T., Voß, S. (eds.): Matheuristics. Hybridizing Metaheuristics and Mathematical Programming. Annals of Information Systems, vol. 10. Springer, Heidelberg (2009)
48. Mester, D., Bräysy, O.: Active-guided evolution strategies for large-scale capacitated vehicle routing problems. Computers & Operations Research 34(10), 2964-2975 (2007) (Pubitemid 46356733)
49. Monaci, M., Toth, P.: A set-covering-based heuristic approach for bin-packing problems. INFORMS Journal on Computing 18(1), 71-85 (2006)
50. Mourgaya, M., Vanderbeck, F.: Column generation based heuristic for tactical planning in multi-period vehicle routing. European Journal of Operational Research 183(3), 1028-1041 (2007)
51. Naddef, D., Rinaldi, G.: Branch-and-cut algorithms for the capacitated VRP. The Vehicle Routing Problem, pp. 53-84. SIAM, Philadelphia (2001)
52. Ngueveu, S.U., Prins, C., Calvo, R.W.: A Hybrid Tabu Search for the m-Peripatetic Vehicle Routing Problem, Matheuristics. In: Hybridizing Metaheuristics and Mathematical Programming, vol. 10, pp. 253-266. Springer, Heidelberg (2009)
53. Ostertag, A., Doerner, K.F., Hartl, R.F.: Variable neighborhood search integrated in the POPMUSIC framework for a large scale vehicle routing problem. In: Blesa, M.J., Blum, C., Cotta, C., Fernández, A.J., Gallardo, J.E., Roli, A., Sampels, M. (eds.) HM 2008. LNCS, vol. 5296, pp. 29-42. Springer, Heidelberg (2008)
54. Ostertag, A., Doerner, K.F., Hartl, R.F., Taillard, E.D., Waelti, P.: POPMUSIC for a real-world large-scale vehicle routing problem with time windows. Journal of the Operational Research Society 60, 934-943 (2009)
55. Parragh, S.N., Cordeau, J.F., Doerner, K.F., Hartl, R.F.: Models and algorithms for the heterogeneous dial-a-ride problem with driver related constraints, Technical report (2009)
56. Pirkwieser, S., Raidl, G.R.: Boosting a variable neighborhood search for the periodic vehicle routing problem with time windows by ILP techniques. In: Proceedings of the 8th Metaheuristic International Conference (MIC 2009), Hamburg, Germany, July 13-16 (2009)
57. Pirkwieser, S., Raidl, G.R.: A column generation approach for the periodic vehicle routing problem with time windows. In: Proceedings of the International Network Optimization Conference (INOC 2009), Pisa, Italy, April 26-29 (2009)
58. Pirkwieser, S., Raidl, G.R.: Multiple variable neighborhood search enriched with ILP techniques for the periodic vehicle routing problem with time windows. In: Blesa, M., Blum, C., Di Gaspero, L., Roli, A., Sampels, M., Schaerf, A. (eds.) HM 2009. LNCS, vol. 5818, pp. 45-59. Springer, Heidelberg (2009)
59. Pirkwieser, S., Raidl, G.R.: Matheuristics for the periodic vehicle routing problem with time windows. In: Proceedings of Matheuristics 2010 - Third International Workshop on Model-based Metaheuristics, Vienna, Austria, June 28-30 (2010)
60. Polacek, M., Benkner, S., Doerner, K.F., Hartl, R.F.: A cooperative and adaptive variable neighborhood search for the multi depot vehicle routing problem with time windows. Business Research 1(2), 1-12 (2008)
61. Polacek, M., Hartl, R.F., Doerner, K., Reimann, M.: A variable neighborhood search for the multi depot vehicle routing problem with time windows. Journal of Heuristics 10(6), 613-627 (2004)
62. Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Computers & Operations Research 31(12), 1985-2002 (2004)
63. Prins, C., Prodhon, C., Ruiz, A., Soriano, P., Calvo, R.W.: Solving the capacitated location-routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristic. Transportation Science 41(4), 470-483 (2007)
64. Puchinger, J., Raidl, G.R.: Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification. In: Mira, J., Álvarez, J.R. (eds.) IWINAC 2005. LNCS, vol. 3562, pp. 41-53. Springer, Heidelberg (2005)
65. Raidl, G.R., Puchinger, J., Blum, C.: Metaheuristic hybrids (2010) (to appear)
66. Rei, W., Gendreau, M., Soriano, P.: A hybrid Monte Carlo local branching algorithm for the single vehicle routing problem with stochastic demands. Transportation Science 44(1), 136-146 (2010)
67. Reimann, M., Doerner, K.F., Hartl, R.F.: D-ants: Savings based ants divide and conquer the vehicle routing problem. Computers & Operations Research 31(4), 563-591 (2004)
68. Renaud, J., Boctor, F.F., Laporte, G.: An improved petal heuristic for the vehicle routeing problem. The Journal of the Operational Research Society 47(2), 329-336 (1996) (Pubitemid 126578678)
69. Ryan, D.M., Hjorring, C., Glover, F.: Extensions of the petal method for vehicle routeing. The Journal of the Operational Research Society 44(3), 289-296 (1993)
70. Salari, M., Toth, P., Tramontani, A.: An ILP improvement procedure for the open vehicle routing problem. Computers & Operations Research 37(12), 2106-2120 (2010)
71. Schmid, V.: Trucks in Movement: Hybridization of Exact Approaches and Variable Neighborhood Search for the Delivery of Ready-Mixed Concrete. Ph.D. thesis, University of Vienna (2007)
72. Schmid, V., Doerner, K.F., Hartl, R.F., Salazar-González, J.J.: Hybridization of very large neighborhood search for ready-mixed concrete delivery problems. Computers & Operations Research 37(3), 559-574 (2010)
73. Schmid, V., Doerner, K.F., Hartl, R.F., Savelsbergh, M.W.P., Stoecher, W.: A hybrid solution approach for ready-mixed concrete delivery. Transportation Science 43(1), 70-85 (2009)
74. Strodl, J., Doerner, K.F., Tricoire, F., Hartl, R.F.: On index structures in hybrid metaheuristics for routing problems with hard feasibility checks: an application to the 2-dimensional loading vehicle routing problem. In: Hybrid Metaheuristics. LNCS. Springer, Heidelberg (2010)
75. Taillard, E.D., Voß, S.: Partial optimization metaheuristic under special intensification conditions. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, 3rd Metaheuristics International Conference (MIC 1999), July 18-22, pp. 613-629. Kluwer, Dordrecht (2002)
76. Toth, P., Vigo, D.: Exact algorithms for vehicle routing. In: Crainic, T.G., Laporte, G. (eds.) Fleet Management and Logistics, pp. 1-31. Kluwer, Dordrecht (1998)
77. Toth, P., Vigo, D.: Branch-and-bound algorithms for the capacitated VRP. The Vehicle Routing Problem, pp. 29-51. SIAM, Philadelphia (2001)
78. Toth, P., Vigo, D.: An overview of vehicle routing problems. The Vehicle Routing Problem, pp. 1-26. SIAM, Philadelphia (2001)
79. Toth, P., Vigo, D. (eds.): The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (2001)
80. Toth, P., Vigo, D.: The granular tabu search and its application to the vehicle-routing problem. INFORMS Journal on Computing 15(4), 333-346 (2003)
81. Tricoire, F., Doerner, K.F., Hartl, R.F., Iori, M.: Heuristic and exact algorithms for the multi-pile vehicle routing problem. OR Spectrum (2009) (published online)
82. Tricoire, F., Romauch, M., Doerner, K.F., Hartl, R.F.: Heuristics for the multi-period orienteering problem with multiple time windows. Computers & Operations Research 37(2), 351-367 (2010)