Skip to main content
SpringerLink
Log in

Survey: Matheuristics for Rich Vehicle Routing Problems

  • Conference paper
Hybrid Metaheuristics (HM 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6373))

Included in the following conference series:

Abstract

This paper surveys recent developments of hybrid solution techniques for different vehicle routing problems. Only hybridizations of heuristic and exact solution techniques are considered. Most of the existing hybrid approaches are based on set-covering formulations, local branching or different decomposition techniques.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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)

    Article  MATH  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  7. Balinski, M.L., Quandt, R.E.: On an integer program for a delivery problem. Operations Research 12(2), 300–304 (1964)

    Article  Google Scholar 

  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)

    Article  MATH  Google Scholar 

  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)

    Article  Google Scholar 

  10. Bramel, J., Simchi-Levi, D.: Set-covering-based algorithms for the capacitated VRP. The Vehicle Routing Problem, pp. 85–108. SIAM, Philadelphia (2001)

    MATH  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  Google Scholar 

  13. Bräysy, O., Gendreau, M.: Vehicle routing problem with time windows, part ii: Metaheuristics. Transportation Science 39(1), 119–139 (2005)

    Article  Google Scholar 

  14. Caprara, A., Fischetti, M., Toth, P.: A heuristic method for the set covering problem. Operations Research 47(5), 730–743 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    MATH  Google Scholar 

  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)

    Article  MATH  Google Scholar 

  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)

    MATH  Google Scholar 

  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)

    Article  MATH  Google Scholar 

  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)

    Article  MATH  Google Scholar 

  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)

    Article  MATH  Google Scholar 

  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)

    MATH  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Chapter  Google Scholar 

  25. Fischetti, M., Lodi, A.: Local branching. Mathematical Programming 98(1-3), 23–47 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  26. Fisher, M.L., Jaikumar, R.: A generalized assignment heuristic for vehicle routing. Networks 11(2), 109–124 (1981)

    Article  MathSciNet  Google Scholar 

  27. Foster, B.A., Ryan, D.M.: An integer programming approach to the vehicle scheduling problem. Operational Research Quarterly 27(2), 367–384 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  MATH  Google Scholar 

  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)

    Article  MATH  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  31. Gendreau, M., Hertz, A., Laporte, G.: New insertion and postoptimization procedures for the traveling salesman problem. Operations Research 40(6), 1086–1094 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  34. Gendreau, M., Laporte, G., Potvin, J.Y.: Metaheuristics for the capacitated VRP. The Vehicle Routing Problem, pp. 129–154. SIAM, Philadelphia (2001)

    MATH  Google Scholar 

  35. Hansen, P., Mladenović, N., Urošević, D.: Variable neighborhood search and local branching. Computers & Operations Research 33(10), 3034–3045 (2006)

    Article  MATH  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  37. Ibaraki, T., Imahori, S., Kubo, M., Masuda, T., Uno, T., Yagiura, M.: Effective local search algorithms for routing and scheduling problems with general time-window constraints. Transportation Science 39(2), 206–232 (2005)

    Article  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  MATH  Google Scholar 

  41. Laporte, G.: What you should know about the vehicle routing problem. Naval Research Logistics 54(8), 811–819 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  42. Laporte, G.: Fifty years of vehicle routing. Transportation Science 43(4), 408–416 (2009)

    Article  Google Scholar 

  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)

    Chapter  Google Scholar 

  44. Laporte, G., Semet, F.: Classical heuristics for the capacitated VRP. The Vehicle Routing Problem, pp. 109–128. SIAM, Philadelphia (2001)

    MATH  Google Scholar 

  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)

    Article  MATH  Google Scholar 

  46. Letchford, A.N., Salazar-González, J.J.: Projection results for vehicle routing. Mathematical Programming 105(2-3), 251–274 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  47. Maniezzo, V., Stützle, T., Voß, S. (eds.): Matheuristics. Hybridizing Metaheuristics and Mathematical Programming. Annals of Information Systems, vol. 10. Springer, Heidelberg (2009)

    MATH  Google Scholar 

  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)

    Article  MATH  Google Scholar 

  49. Monaci, M., Toth, P.: A set-covering-based heuristic approach for bin-packing problems. INFORMS Journal on Computing 18(1), 71–85 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  51. Naddef, D., Rinaldi, G.: Branch-and-cut algorithms for the capacitated VRP. The Vehicle Routing Problem, pp. 53–84. SIAM, Philadelphia (2001)

    MATH  Google Scholar 

  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)

    Google Scholar 

  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)

    Chapter  Google Scholar 

  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)

    Article  MATH  Google Scholar 

  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)

    Google Scholar 

  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)

    Google Scholar 

  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)

    Google Scholar 

  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)

    Chapter  Google Scholar 

  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)

    Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  62. Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Computers & Operations Research 31(12), 1985–2002 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Chapter  Google Scholar 

  65. Raidl, G.R., Puchinger, J., Blum, C.: Metaheuristic hybrids (2010) (to appear)

    Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  MATH  Google Scholar 

  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)

    Article  MATH  Google Scholar 

  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)

    Article  MATH  Google Scholar 

  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)

    Article  MATH  Google Scholar 

  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)

    Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Google Scholar 

  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)

    Chapter  Google Scholar 

  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)

    Google Scholar 

  77. Toth, P., Vigo, D.: Branch-and-bound algorithms for the capacitated VRP. The Vehicle Routing Problem, pp. 29–51. SIAM, Philadelphia (2001)

    MATH  Google Scholar 

  78. Toth, P., Vigo, D.: An overview of vehicle routing problems. The Vehicle Routing Problem, pp. 1–26. SIAM, Philadelphia (2001)

    MATH  Google Scholar 

  79. Toth, P., Vigo, D. (eds.): The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (2001)

    Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Business, Economics and Statistics, University of Vienna, Austria

    Karl F. Doerner & Verena Schmid

Authors
  1. Karl F. Doerner
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Verena Schmid
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universitat Politècnica de Catalunya, Omega 213 Campus Nord Jordi Girona 1-3, 08034, Barcelona, Spain

    María J. Blesa

  2. ALBCOM Research Group, Universitat Politècnica de Catalunya, Omega 112, Campus Nord, Jordi Girona 1-3, 08034, Barcelona, Spain

    Christian Blum

  3. Institute of Computer Graphics and Algorithms, Vienna University of Technology, Favoritenstraße 9–11/1861, 1040, Vienna, Austria

    Günther Raidl

  4. Università di Bologna, Sede di Cesena, Via Venezia 52, 47521, Cesena, Italy

    Andrea Roli

  5. Université Libre de Bruxelles, IRIDIA CP 194/6, Avenue Franklin D. Roosevelt 50, 1050, Bruxelles, Belgium

    Michael Sampels

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Doerner, K.F., Schmid, V. (2010). Survey: Matheuristics for Rich Vehicle Routing Problems. In: Blesa, M.J., Blum, C., Raidl, G., Roli, A., Sampels, M. (eds) Hybrid Metaheuristics. HM 2010. Lecture Notes in Computer Science, vol 6373. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16054-7_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16054-7_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16053-0

  • Online ISBN: 978-3-642-16054-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation