4OR

, Volume 14, Issue 3, pp 223–259 | Cite as

Vehicle routing problems with multiple trips

Invited Survey

Abstract

This paper presents a survey on the multi-trip vehicle routing problem (MTVRP) and on related routing problems where vehicles are allowed to perform multiple trips. The first part of the paper focuses on the MTVRP. It gives an unified view on mathematical formulations and surveys exact and heuristic approaches. The paper continues with variants of the MTVRP and other families of routing problems where multiple trips are sometimes allowed. For the latter, it specially insists on the motivations for having multiple trips and the algorithmic consequences. The expected contribution of the survey is to give a comprehensive overview on a structural property of routing problems that has seen a strongly growing interest in the last few years and that has been investigated in very different areas of the routing literature.

Keywords

Vehicle routing problem Multi-trip Survey Models Solution approaches 

Mathematics Subject Classification

90-02 

References

  1. Adulyasak Y, Cordeau J-F, Jans R (2014) The production routing problem: a review of formulations and solution algorithms. Comput Oper Res 155:141–152Google Scholar
  2. Aghezzaf E-H, Raa B, Van Landeghem H (2006) Modeling inventory routing problems in supply chains of high consumption products. Eur J Oper Res 169(3):1048–1063CrossRefGoogle Scholar
  3. Alonso F, Alvarez MJ, Beasley JE (2008) A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions. J Oper Res Soc 59(7):963–976CrossRefGoogle Scholar
  4. Anaya-Arenas AM, Chabot T, Renaud J, Ruiz A (2014) Biomedical sample transportation: a case study based on Quebec’s healthcare supply chain. Technical report, Faculté des sciences de l’administration, Universit Laval Québec (Québec) CanadaGoogle Scholar
  5. Avella P, Boccia M, Sforza A (2004) Solving a fuel delivery problem by heuristic and exact approaches. Eur J Oper Res 152(1):170–179CrossRefGoogle Scholar
  6. Ayadi R, Elldrissi AE, Benadada Y, El Hilali Alaoui A (2014) Evolutionary algorithm for a green vehicle routing problem with multiple trips. In: International conference on logistics and operations management, pp 148–154Google Scholar
  7. Azi N (2010) Méthodes Exactes et Heuristiques pour le Problème de Tournées avec Fenêtres de Temps et Réutilisation de Véhicules. PhD thesis, Université de MontréalGoogle Scholar
  8. Azi N, Gendreau M, Potvin J-Y (2007) An exact algorithm for a single-vehicle routing problem with time windows and multiple routes. Eur J Oper Res 178(3):755–766CrossRefGoogle Scholar
  9. Azi N, Gendreau M, Potvin J-Y (2010) An exact algorithm for a vehicle routing problem with time windows and multiple routes. Eur J Oper Res 202(3):756–763CrossRefGoogle Scholar
  10. Azi N, Gendreau M, Potvin J-Y (2012) A dynamic vehicle routing problem with multiple delivery routes. Ann Oper Res 199(1):103–112CrossRefGoogle Scholar
  11. Azi N, Gendreau M, Potvin J-Y (2014) An adaptive large neighborhood search for a vehicle routing problem with multiple routes. Comput Oper Res 41:167–173CrossRefGoogle Scholar
  12. Battarra M, Monaci M, Vigo D (2009) An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem. Comput Oper Res 36(11):3041–3050CrossRefGoogle Scholar
  13. Bendall HB, Stent AF (2001) A scheduling model for a high speed containership service: a hub and spoke short-sea application. Int J Marit Econ 3:262–277CrossRefGoogle Scholar
  14. Bertazzi L, Savelsbergh M, Speranza MG (2008) The vehicle routing problem—last advances and new challenges. In: Operations research computer science interfaces, chapter Inventory routing. Springer, pp 49–72Google Scholar
  15. Boschetti M, Maniezzo V (2015) A set covering based matheuristic for a real-world city logistics problem. Int Trans Oper Res 22:169–195CrossRefGoogle Scholar
  16. Brandão J, Mercer A (1997) A tabu search algorithm for the multi-trip vehicle routing problem. Eur J Oper Res 100(1):180–191CrossRefGoogle Scholar
  17. Brandão J, Mercer A (1998) The multi-trip vehicle routing problem. J Oper Res Soc 49:799–805CrossRefGoogle Scholar
  18. Buhrkal K, Larsen A, Ropke S (2012) The waste collection vehicle routing problem with time windows in a city logistics context. Procedia Soc Behav Sci 39:241–254CrossRefGoogle Scholar
  19. Caceres-Cruz J, Grasas A, Ramalhinho H, Juan AA (2014) A savings-based randomized heuristic for the heterogeneous fixed fleet vehicle routing problem with multi-trips. J Appl Oper Res 6(2):69–81Google Scholar
  20. Cattaruzza D, Absi N, Feillet D (2016) The multi-trip vehicle routing problem with time windows and release dates. Transp Sci (to appear)Google Scholar
  21. Cattaruzza D, Absi N, Feillet D, Vidal T (2014) A memetic algorithm for the multi trip vehicle routing problem. Eur J Oper Res 236(6):833–848CrossRefGoogle Scholar
  22. Cattaruzza D, Absi N, Feillet D, Vigo D (2014) An iterated local search for the multi-commodity multi-trip vehicle routing problem with time windows. Comput Oper Res 51:257–267CrossRefGoogle Scholar
  23. Ceselli A, Righini G, Salani M (2009) A column generation algorithm for a rich vehicle-routing problem. Transp Sci 43(1):56–69CrossRefGoogle Scholar
  24. Chang T-C, Lee C-Y (2004) Machine scheduling with job delivery coordination. Eur J Oper Res 158(2):470–487CrossRefGoogle Scholar
  25. Chbichib A, Mellouli R, Chabchoub H (2012) Profitable vehicle routing problem with multiple trips: modeling and variable neighborhood descent algorithm. Am J Oper Res 2(6):104–119Google Scholar
  26. Chen Z-L (2010) Integrated production and outbound distribution scheduling: review and extensions. Oper Res 58(1):130–148CrossRefGoogle Scholar
  27. Christiansen M, Fagerholt K, Nygreen B, Ronen D (2007) Maritime transportation. In: Handbooks in operations research & management science: transportation, vol 14. Elsevier, North Holland, pp 189–284Google Scholar
  28. Christiansen M, Fagerholt K, Ronen D (2004) Ship routing and scheduling: status and perspectives. Transp Sci 38(1):1–18CrossRefGoogle Scholar
  29. Christofides N, Mingozzi A, Toth P (1979) The vehicle routing problem. Wiley, Chichester, pp 315–338Google Scholar
  30. Cinar D, Gakis K, Pardalos PM (2014) Reduction of CO\(_2\) emissions in cumulative multi-trip vehicle routing problems with limited duration. Environ Model Assess. doi:10.1007/s10666-014-9434-2
  31. Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12(4):568–581CrossRefGoogle Scholar
  32. Coelho LC, Cordeau J-F, Laporte G (2014) Thirty years of inventory routing. Transp Sci 48(1):1–19CrossRefGoogle Scholar
  33. Cornillier F, Boctor FF, Laporte G, Renaud J (2008) A heuristic for the multi-period petrol station replenishment problem. Eur J Oper Res 191:295–305CrossRefGoogle Scholar
  34. Cornillier F, Boctor FF, Laporte G, Renaud J (2009) An exact algorithm for the petrol station replenishment problem. J Oper Res Soc 59:607–615CrossRefGoogle Scholar
  35. Cornillier F, Laporte G, Boctor FF, Renaud J (2009) The petrol station replenishment problem with time windows. Comput Oper Res 36(3):919–935CrossRefGoogle Scholar
  36. Cornillier G, Boctor FF, Renaud J (2012) Heuristic for the multi-depot petrol station replenishment problem with time windows. Eur J Oper Res 220(2):361–369CrossRefGoogle Scholar
  37. Crainic TG, Gajapl Y, Gendreau M (2012) Multi-zone multi-trip vehicle routing problem with time windows. Technical Report 2012–36, Centre interuniversitaire de recherche sur les réseaux d’enterprise, la logistique et le transport, Université de Montréal, Montréal, QC, CanadaGoogle Scholar
  38. Crevier B, Cordeau J-F, Laporte G (2007) The multi-depot vehicle routing problem with inter-depot routes. Eur J Oper Res 176(2):756–773CrossRefGoogle Scholar
  39. Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manag Sci 6:80–91CrossRefGoogle Scholar
  40. Fagerholt K (1999) Optimal fleet design in a ship routing problem. Int Trans Oper Res 9(5):453–464CrossRefGoogle Scholar
  41. Fagerholt K, Lindstad H (2000) Optimal policies for maintaining a supply service in the norwegian sea. Omega 28(3):269–275CrossRefGoogle Scholar
  42. Fisher ML (1994) Optimal solution for vehicle routing problem using minimum \(k\)-trees. Oper Res 42(4):626–642CrossRefGoogle Scholar
  43. Fleischmann B (1990) The vehicle routing problem with multiple use of vehicles. Technical report, Fachbereich Wirtschaftswissenschaften, Universität HamburgGoogle Scholar
  44. Gehring H, Homberger J (1999) A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows. In: EUROGEN99Google Scholar
  45. Geismar HN, Laporte G, Lei L, Sriskandarajah C (2008) The integrated production and transportation scheduling problem for a product with a short lifespan. INFORMS J Comput 20(1):21–33CrossRefGoogle Scholar
  46. Gianessi P (2014) Solving strategic and tactical optimization problems in city logistics. PhD thesis, Université Paris 13Google Scholar
  47. Grangier P, Gendreau M, Lehuédé F, Rousseau L-M (2014) An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization. Technical Report 2014–33, Centre interuniversitaire de recherche sur les réseaux d’enterprise, la logistique et le transport, Université de Montréal, Montréal, QC, CanadaGoogle Scholar
  48. Gribkovskaia I, Gullberg BO, Hovden KJ, Wallace SW (2006) Optimization model for a livestock collection problem. Int J Phys Distrib Logist Manag 36(2):136–152CrossRefGoogle Scholar
  49. Gutin G, Punnen AP (2007) The traveling salesman problem and its variations. Combinatorial optimization, vol 12. Springer, Dordrecht. doi:10.1007/b101971
  50. Hajri-Gabouj S, Darmoul S (2003) A hybrid evolutionary approach for a vehicle routing problem with double time windows for the depot and multiple use of vehicles. Stud Inform Control 12(4):253–268Google Scholar
  51. Halvorsen-Weare EE, Fagerholt K, Nonås LM, Asbjørnslett BE (2012) Optimal fleet composition and periodic routing of offshore supply vessels. Eur J Oper Res 223(2):508–517CrossRefGoogle Scholar
  52. Hernandez F, Feillet D, Giroudeau R, Naud O (2013) An exact algorithm to solve the multi-trip vehicle routing problem with time windows. Technical reportGoogle Scholar
  53. Hernandez F, Feillet D, Giroudeau R, Naud O (2014) A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration. 4OR 12:235–259CrossRefGoogle Scholar
  54. Koc C, Karaoglan I (2011) A branch and cut algorithm for the vehicle routing problem with multiple use of vehicles. In: Proceedings of the 41st international conference on computers & industrial engineering, Los Angeles, USA, pp 554–559Google Scholar
  55. Lee J, Kim B-I, Johnson AL, Lee K (2014) The nuclear medicine production and delivery problem. Eur J Oper Res 236(2):461–472CrossRefGoogle Scholar
  56. Lei L, Liu S, Ruszczynski A, Park S (2006) On the integrated production, inventory, and distribution routing problem. IIIE Trans 38(11):955–970CrossRefGoogle Scholar
  57. Lenstra JK, Rinnooy Kan HG (1981) Complexity of vehicle routing and scheduling problems. Networks 11(2):221–227CrossRefGoogle Scholar
  58. Lin CKY, Kwok RCW (2006) Multi-objective metaheuristic for a location routing problem with multiple use of vehicles on real data and simulated data. Eur J Oper Res 175(3):1833–1849CrossRefGoogle Scholar
  59. Macedo R, Alves C, Valério de Carvalho JM, Clautiaux F, Hanafi S (2011) Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model. Eur J Oper Res 214(3):536–545CrossRefGoogle Scholar
  60. Miller CE, Tucker AW, Zemlin RA (1960) Integer programming formulation of traveling salesman problems. J ACM 7(4):326–329CrossRefGoogle Scholar
  61. Mingozzi A, Roberti R, Toth P (2013) An exact algorithm for the multi-trip vehicle routing problem. INFORMS J Comput 25(2):193–207CrossRefGoogle Scholar
  62. Mu Q, Eglese RW (2013) Disrupted capacitated vehicle routing problem with order release delay. Ann Oper Res 207(1):201–216CrossRefGoogle Scholar
  63. Nguyen PK, Crainic TG, Toulouse M (2013) A tabu search for time-dependent multi-zone multi-trip vehicle routing problem with time windows. Eur J Oper Res 231(1):43–56CrossRefGoogle Scholar
  64. Nguyen PK, Crainic TG, Toulouse M (2014) Multi-zone multi-trip pickup and delivery problem with time windows and synchronization. Technical Report 2014–18, Centre interuniversitaire de recherche sur les réseaux d’enterprise, la logistique et le transport, Université de Montréal, Montréal, QC, CanadaGoogle Scholar
  65. Olivera A, Viera O (2007) Adaptive memory programming for the vehicle routing problem with multiple trips. Comput Oper Res 34(1):28–47CrossRefGoogle Scholar
  66. Ong JO, Suprayogi (2011) Vehicle routing problem with backhaul, multiple trips and time windows. J Tek Ind 13(1):1–10Google Scholar
  67. Oppen J, Løkketangen A (2008) A tabu search approach for the livestock collection problem. Comput Oper Res 35(10):3213–3229CrossRefGoogle Scholar
  68. Oppen J, Løkketangen A, Desrosiers J (2010) Solving a rich vehicle routing and inventory problem using column generation. Comput Oper Res 37(7):1308–1317CrossRefGoogle Scholar
  69. Petch RJ, Salhi S (2004) A multi-phase constructive heuristic for the vehicle routing problem with multi trips. Discrete Appl Math 133(1–3):69–92Google Scholar
  70. Povlovitsch S, Mendes A Bergsten (2013) Column generation for a multitrip vehicle routing problem with time windows, driver work hours, and heterogeneous fleet. Mathematical problems in engineering, Article ID 824961, 13 ppGoogle Scholar
  71. Prins C (2002) Efficient heuristic for the heterogeneous fleet multitrip VRP with application to a large-scale real case. J Math Model Algorithms 1:135–150CrossRefGoogle Scholar
  72. Prins C (2004) A simple and effective evolutionary algorithm for the vehicle routing problem. Comput Oper Res 31(12):1985–2002CrossRefGoogle Scholar
  73. Raa B, Aghezzaf E-H (2008) Designing distribution patterns for long-term inventory routing with constant demand rates. Int J Prod Econ 112(1):255–263CrossRefGoogle Scholar
  74. Raa B, Aghezzaf E-H (2009) A practical solution approach for the cyclic inventory routing problem. Eur J Oper Res 192(2):429–441CrossRefGoogle Scholar
  75. Rivera JC, Afsar HM, Prins C (2014) Multistart evolutionary local search for a disaster relief problem. In: Legrand P, Corsini M-M, Hao J-K, Monmarché N, Lutton E, Schoenauer M (eds) Artificial evolution. 11th International Conference, Evolution Artificielle, EA 2013, Bordeaux, France, October 21–23, 2013. Lecture notes in computer science, vol 8752. Springer, pp 129–141.doi:10.1007/978-3-319-11683-9_11
  76. Rochat Y, Taillard É (1995) Probabilistic diversification and intensification in local search for vehicle routing. J Heuristics 1(1):147–167CrossRefGoogle Scholar
  77. Ronen D (1992) Allocation of trips to trucks operating from a single terminal. Comput Oper Res 19(5):445–451CrossRefGoogle Scholar
  78. Salhi S (1987) The integration of routing into location-allocation and vehicle fleet composition problems. PhD thesis, university of LancasterGoogle Scholar
  79. Salhi S, Petch RJ (2007) A GA based heuristic for the vehicle routing problem with multiple trips. J Math Model Algorithms 6(4):591–613CrossRefGoogle Scholar
  80. Şen A, Bülbül K (2008) A survey on multi trip vehicle routing problem. In: VI international logistics & supply chain congress. InstanbulGoogle Scholar
  81. Shyshou A, Fagerholt K, Gribkovskaia I, Laporte G (2012) A large neighbourhood search heuristic for a periodic supply vessel planning problem arising on offshore oil and gas operations. INFOR 50(4):195–204Google Scholar
  82. Solomon MM (1987) Algorithms for the vehicle routing and scheduling problem with time windows constraints. Oper Res 35:254–265CrossRefGoogle Scholar
  83. Suprayogi, Yamato H, Iskendar (2001) Ship routing design for the oily liquid waste collection. J Soc Nav Archit Jpn 190:325–335CrossRefGoogle Scholar
  84. Taillard ÉD (1993) Parallel iterative search methods for vehicle routing problems. Networks 23(8):661–673CrossRefGoogle Scholar
  85. Taillard ÉD, Laporte G, Gendreau M (1996) Vehicle routeing with multiple use of vehicles. J Oper Res Soc 47(8):1065–1070CrossRefGoogle Scholar
  86. Taniguchi E, Shimamoto H (2004) Intelligent transportation sustem based dynamic vehicle routing and scheduling with variable travel times. Transp Res C 12(3–4):235–250CrossRefGoogle Scholar
  87. Taniguchi E, Van Der Heijden RECM (2000) An evaluation methodology for the city logistics. Transp Rev 20(1):65–90CrossRefGoogle Scholar
  88. Toth P, Vigo D (eds) (2002) The vehicle routing problem. SIAM Monographs on discrete mathematics and applications. doi:10.1137/1.9780898718515
  89. Tsirimpas P, Tatarakis A, Minis I, Kyriakidis EG (2008) Single vehicle routing with a predefined customer sequence and multiple depot returns. Eur J Oper Res 187(2):483–495CrossRefGoogle Scholar
  90. Tung DV, Pinnoi A (2000) Vehicle routing-scheduling for waste collection in Hanoi. Eur J Oper Res 125(3):449–468CrossRefGoogle Scholar
  91. Ullrich AC (2013) Integrated machine scheduling and vehicle routing with time windows. Eur J Oper Res 227(1):152–165CrossRefGoogle Scholar
  92. Van Buer MG, Woodruff DL, Olson RT (1999) Solving the medium newspaper production/distribution problem. Eur J Oper Res 115(2):237–253CrossRefGoogle Scholar
  93. Wang Z, Liang W, Hu X (2014) A metaheuristic based on a pool of routes for the vehicle routing problem with multiple trips and time windows. J Oper Res Soc 65:37–48CrossRefGoogle Scholar
  94. Yellow PC (1970) A computational modification to the savings method of vehicle scheduling. Oper Res Q 21(2):281–283CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  1. 1.CNRS, Centrale Lille, UMR 9189 - CRIStAL - Centre de Recherche en Informatique Signal et Automatique de LilleUniv. LilleLilleFrance
  2. 2.LIMOS UMR CNRS 6158Ecole des Mines de Saint-EtienneGardanneFrance

Personalised recommendations