Skip to main content
Erschienen in: 4OR 3/2016

27.01.2016 | Invited Survey

Vehicle routing problems with multiple trips

Erschienen in: 4OR | Ausgabe 3/2016

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Anhänge
Nur mit Berechtigung zugänglich
Literatur
Zurück zum Zitat Adulyasak Y, Cordeau J-F, Jans R (2014) The production routing problem: a review of formulations and solution algorithms. Comput Oper Res 155:141–152 Adulyasak Y, Cordeau J-F, Jans R (2014) The production routing problem: a review of formulations and solution algorithms. Comput Oper Res 155:141–152
Zurück zum Zitat 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–1063CrossRef 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–1063CrossRef
Zurück zum Zitat 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–976CrossRef 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–976CrossRef
Zurück zum Zitat 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) Canada 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) Canada
Zurück zum Zitat Avella P, Boccia M, Sforza A (2004) Solving a fuel delivery problem by heuristic and exact approaches. Eur J Oper Res 152(1):170–179CrossRef Avella P, Boccia M, Sforza A (2004) Solving a fuel delivery problem by heuristic and exact approaches. Eur J Oper Res 152(1):170–179CrossRef
Zurück zum Zitat 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–154 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–154
Zurück zum Zitat 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éal 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éal
Zurück zum Zitat 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–766CrossRef 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–766CrossRef
Zurück zum Zitat 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–763CrossRef 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–763CrossRef
Zurück zum Zitat Azi N, Gendreau M, Potvin J-Y (2012) A dynamic vehicle routing problem with multiple delivery routes. Ann Oper Res 199(1):103–112CrossRef Azi N, Gendreau M, Potvin J-Y (2012) A dynamic vehicle routing problem with multiple delivery routes. Ann Oper Res 199(1):103–112CrossRef
Zurück zum Zitat 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–173CrossRef 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–173CrossRef
Zurück zum Zitat 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–3050CrossRef 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–3050CrossRef
Zurück zum Zitat 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–277CrossRef 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–277CrossRef
Zurück zum Zitat 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–72 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–72
Zurück zum Zitat Boschetti M, Maniezzo V (2015) A set covering based matheuristic for a real-world city logistics problem. Int Trans Oper Res 22:169–195CrossRef Boschetti M, Maniezzo V (2015) A set covering based matheuristic for a real-world city logistics problem. Int Trans Oper Res 22:169–195CrossRef
Zurück zum Zitat Brandão J, Mercer A (1997) A tabu search algorithm for the multi-trip vehicle routing problem. Eur J Oper Res 100(1):180–191CrossRef Brandão J, Mercer A (1997) A tabu search algorithm for the multi-trip vehicle routing problem. Eur J Oper Res 100(1):180–191CrossRef
Zurück zum Zitat Brandão J, Mercer A (1998) The multi-trip vehicle routing problem. J Oper Res Soc 49:799–805CrossRef Brandão J, Mercer A (1998) The multi-trip vehicle routing problem. J Oper Res Soc 49:799–805CrossRef
Zurück zum Zitat 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–254CrossRef 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–254CrossRef
Zurück zum Zitat 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–81 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–81
Zurück zum Zitat Cattaruzza D, Absi N, Feillet D (2016) The multi-trip vehicle routing problem with time windows and release dates. Transp Sci (to appear) Cattaruzza D, Absi N, Feillet D (2016) The multi-trip vehicle routing problem with time windows and release dates. Transp Sci (to appear)
Zurück zum Zitat 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–848CrossRef 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–848CrossRef
Zurück zum Zitat 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–267CrossRef 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–267CrossRef
Zurück zum Zitat Ceselli A, Righini G, Salani M (2009) A column generation algorithm for a rich vehicle-routing problem. Transp Sci 43(1):56–69CrossRef Ceselli A, Righini G, Salani M (2009) A column generation algorithm for a rich vehicle-routing problem. Transp Sci 43(1):56–69CrossRef
Zurück zum Zitat Chang T-C, Lee C-Y (2004) Machine scheduling with job delivery coordination. Eur J Oper Res 158(2):470–487CrossRef Chang T-C, Lee C-Y (2004) Machine scheduling with job delivery coordination. Eur J Oper Res 158(2):470–487CrossRef
Zurück zum Zitat 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–119 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–119
Zurück zum Zitat Chen Z-L (2010) Integrated production and outbound distribution scheduling: review and extensions. Oper Res 58(1):130–148CrossRef Chen Z-L (2010) Integrated production and outbound distribution scheduling: review and extensions. Oper Res 58(1):130–148CrossRef
Zurück zum Zitat 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–284 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–284
Zurück zum Zitat Christiansen M, Fagerholt K, Ronen D (2004) Ship routing and scheduling: status and perspectives. Transp Sci 38(1):1–18CrossRef Christiansen M, Fagerholt K, Ronen D (2004) Ship routing and scheduling: status and perspectives. Transp Sci 38(1):1–18CrossRef
Zurück zum Zitat Christofides N, Mingozzi A, Toth P (1979) The vehicle routing problem. Wiley, Chichester, pp 315–338 Christofides N, Mingozzi A, Toth P (1979) The vehicle routing problem. Wiley, Chichester, pp 315–338
Zurück zum Zitat 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 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
Zurück zum Zitat Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12(4):568–581CrossRef Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12(4):568–581CrossRef
Zurück zum Zitat Coelho LC, Cordeau J-F, Laporte G (2014) Thirty years of inventory routing. Transp Sci 48(1):1–19CrossRef Coelho LC, Cordeau J-F, Laporte G (2014) Thirty years of inventory routing. Transp Sci 48(1):1–19CrossRef
Zurück zum Zitat 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–305CrossRef 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–305CrossRef
Zurück zum Zitat Cornillier F, Boctor FF, Laporte G, Renaud J (2009) An exact algorithm for the petrol station replenishment problem. J Oper Res Soc 59:607–615CrossRef Cornillier F, Boctor FF, Laporte G, Renaud J (2009) An exact algorithm for the petrol station replenishment problem. J Oper Res Soc 59:607–615CrossRef
Zurück zum Zitat Cornillier F, Laporte G, Boctor FF, Renaud J (2009) The petrol station replenishment problem with time windows. Comput Oper Res 36(3):919–935CrossRef Cornillier F, Laporte G, Boctor FF, Renaud J (2009) The petrol station replenishment problem with time windows. Comput Oper Res 36(3):919–935CrossRef
Zurück zum Zitat 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–369CrossRef 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–369CrossRef
Zurück zum Zitat 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, Canada 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, Canada
Zurück zum Zitat 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–773CrossRef 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–773CrossRef
Zurück zum Zitat Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manag Sci 6:80–91CrossRef Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manag Sci 6:80–91CrossRef
Zurück zum Zitat Fagerholt K (1999) Optimal fleet design in a ship routing problem. Int Trans Oper Res 9(5):453–464CrossRef Fagerholt K (1999) Optimal fleet design in a ship routing problem. Int Trans Oper Res 9(5):453–464CrossRef
Zurück zum Zitat Fagerholt K, Lindstad H (2000) Optimal policies for maintaining a supply service in the norwegian sea. Omega 28(3):269–275CrossRef Fagerholt K, Lindstad H (2000) Optimal policies for maintaining a supply service in the norwegian sea. Omega 28(3):269–275CrossRef
Zurück zum Zitat Fisher ML (1994) Optimal solution for vehicle routing problem using minimum \(k\)-trees. Oper Res 42(4):626–642CrossRef Fisher ML (1994) Optimal solution for vehicle routing problem using minimum \(k\)-trees. Oper Res 42(4):626–642CrossRef
Zurück zum Zitat Fleischmann B (1990) The vehicle routing problem with multiple use of vehicles. Technical report, Fachbereich Wirtschaftswissenschaften, Universität Hamburg Fleischmann B (1990) The vehicle routing problem with multiple use of vehicles. Technical report, Fachbereich Wirtschaftswissenschaften, Universität Hamburg
Zurück zum Zitat Gehring H, Homberger J (1999) A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows. In: EUROGEN99 Gehring H, Homberger J (1999) A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows. In: EUROGEN99
Zurück zum Zitat 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–33CrossRef 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–33CrossRef
Zurück zum Zitat Gianessi P (2014) Solving strategic and tactical optimization problems in city logistics. PhD thesis, Université Paris 13 Gianessi P (2014) Solving strategic and tactical optimization problems in city logistics. PhD thesis, Université Paris 13
Zurück zum Zitat 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, Canada 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, Canada
Zurück zum Zitat 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–152CrossRef 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–152CrossRef
Zurück zum Zitat Gutin G, Punnen AP (2007) The traveling salesman problem and its variations. Combinatorial optimization, vol 12. Springer, Dordrecht. doi:10.1007/b101971 Gutin G, Punnen AP (2007) The traveling salesman problem and its variations. Combinatorial optimization, vol 12. Springer, Dordrecht. doi:10.​1007/​b101971
Zurück zum Zitat 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–268 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–268
Zurück zum Zitat 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–517CrossRef 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–517CrossRef
Zurück zum Zitat Hernandez F, Feillet D, Giroudeau R, Naud O (2013) An exact algorithm to solve the multi-trip vehicle routing problem with time windows. Technical report Hernandez F, Feillet D, Giroudeau R, Naud O (2013) An exact algorithm to solve the multi-trip vehicle routing problem with time windows. Technical report
Zurück zum Zitat 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–259CrossRef 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–259CrossRef
Zurück zum Zitat 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–559 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–559
Zurück zum Zitat Lee J, Kim B-I, Johnson AL, Lee K (2014) The nuclear medicine production and delivery problem. Eur J Oper Res 236(2):461–472CrossRef Lee J, Kim B-I, Johnson AL, Lee K (2014) The nuclear medicine production and delivery problem. Eur J Oper Res 236(2):461–472CrossRef
Zurück zum Zitat Lei L, Liu S, Ruszczynski A, Park S (2006) On the integrated production, inventory, and distribution routing problem. IIIE Trans 38(11):955–970CrossRef Lei L, Liu S, Ruszczynski A, Park S (2006) On the integrated production, inventory, and distribution routing problem. IIIE Trans 38(11):955–970CrossRef
Zurück zum Zitat Lenstra JK, Rinnooy Kan HG (1981) Complexity of vehicle routing and scheduling problems. Networks 11(2):221–227CrossRef Lenstra JK, Rinnooy Kan HG (1981) Complexity of vehicle routing and scheduling problems. Networks 11(2):221–227CrossRef
Zurück zum Zitat 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–1849CrossRef 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–1849CrossRef
Zurück zum Zitat 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–545CrossRef 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–545CrossRef
Zurück zum Zitat Miller CE, Tucker AW, Zemlin RA (1960) Integer programming formulation of traveling salesman problems. J ACM 7(4):326–329CrossRef Miller CE, Tucker AW, Zemlin RA (1960) Integer programming formulation of traveling salesman problems. J ACM 7(4):326–329CrossRef
Zurück zum Zitat Mingozzi A, Roberti R, Toth P (2013) An exact algorithm for the multi-trip vehicle routing problem. INFORMS J Comput 25(2):193–207CrossRef Mingozzi A, Roberti R, Toth P (2013) An exact algorithm for the multi-trip vehicle routing problem. INFORMS J Comput 25(2):193–207CrossRef
Zurück zum Zitat Mu Q, Eglese RW (2013) Disrupted capacitated vehicle routing problem with order release delay. Ann Oper Res 207(1):201–216CrossRef Mu Q, Eglese RW (2013) Disrupted capacitated vehicle routing problem with order release delay. Ann Oper Res 207(1):201–216CrossRef
Zurück zum Zitat 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–56CrossRef 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–56CrossRef
Zurück zum Zitat 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, Canada 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, Canada
Zurück zum Zitat Olivera A, Viera O (2007) Adaptive memory programming for the vehicle routing problem with multiple trips. Comput Oper Res 34(1):28–47CrossRef Olivera A, Viera O (2007) Adaptive memory programming for the vehicle routing problem with multiple trips. Comput Oper Res 34(1):28–47CrossRef
Zurück zum Zitat Ong JO, Suprayogi (2011) Vehicle routing problem with backhaul, multiple trips and time windows. J Tek Ind 13(1):1–10 Ong JO, Suprayogi (2011) Vehicle routing problem with backhaul, multiple trips and time windows. J Tek Ind 13(1):1–10
Zurück zum Zitat Oppen J, Løkketangen A (2008) A tabu search approach for the livestock collection problem. Comput Oper Res 35(10):3213–3229CrossRef Oppen J, Løkketangen A (2008) A tabu search approach for the livestock collection problem. Comput Oper Res 35(10):3213–3229CrossRef
Zurück zum Zitat 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–1317CrossRef 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–1317CrossRef
Zurück zum Zitat 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–92 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–92
Zurück zum Zitat 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 pp 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 pp
Zurück zum Zitat 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–150CrossRef 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–150CrossRef
Zurück zum Zitat Prins C (2004) A simple and effective evolutionary algorithm for the vehicle routing problem. Comput Oper Res 31(12):1985–2002CrossRef Prins C (2004) A simple and effective evolutionary algorithm for the vehicle routing problem. Comput Oper Res 31(12):1985–2002CrossRef
Zurück zum Zitat 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–263CrossRef 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–263CrossRef
Zurück zum Zitat Raa B, Aghezzaf E-H (2009) A practical solution approach for the cyclic inventory routing problem. Eur J Oper Res 192(2):429–441CrossRef Raa B, Aghezzaf E-H (2009) A practical solution approach for the cyclic inventory routing problem. Eur J Oper Res 192(2):429–441CrossRef
Zurück zum Zitat 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 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
Zurück zum Zitat Rochat Y, Taillard É (1995) Probabilistic diversification and intensification in local search for vehicle routing. J Heuristics 1(1):147–167CrossRef Rochat Y, Taillard É (1995) Probabilistic diversification and intensification in local search for vehicle routing. J Heuristics 1(1):147–167CrossRef
Zurück zum Zitat Ronen D (1992) Allocation of trips to trucks operating from a single terminal. Comput Oper Res 19(5):445–451CrossRef Ronen D (1992) Allocation of trips to trucks operating from a single terminal. Comput Oper Res 19(5):445–451CrossRef
Zurück zum Zitat Salhi S (1987) The integration of routing into location-allocation and vehicle fleet composition problems. PhD thesis, university of Lancaster Salhi S (1987) The integration of routing into location-allocation and vehicle fleet composition problems. PhD thesis, university of Lancaster
Zurück zum Zitat Salhi S, Petch RJ (2007) A GA based heuristic for the vehicle routing problem with multiple trips. J Math Model Algorithms 6(4):591–613CrossRef Salhi S, Petch RJ (2007) A GA based heuristic for the vehicle routing problem with multiple trips. J Math Model Algorithms 6(4):591–613CrossRef
Zurück zum Zitat Şen A, Bülbül K (2008) A survey on multi trip vehicle routing problem. In: VI international logistics & supply chain congress. Instanbul Şen A, Bülbül K (2008) A survey on multi trip vehicle routing problem. In: VI international logistics & supply chain congress. Instanbul
Zurück zum Zitat 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–204 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–204
Zurück zum Zitat Solomon MM (1987) Algorithms for the vehicle routing and scheduling problem with time windows constraints. Oper Res 35:254–265CrossRef Solomon MM (1987) Algorithms for the vehicle routing and scheduling problem with time windows constraints. Oper Res 35:254–265CrossRef
Zurück zum Zitat Suprayogi, Yamato H, Iskendar (2001) Ship routing design for the oily liquid waste collection. J Soc Nav Archit Jpn 190:325–335CrossRef Suprayogi, Yamato H, Iskendar (2001) Ship routing design for the oily liquid waste collection. J Soc Nav Archit Jpn 190:325–335CrossRef
Zurück zum Zitat Taillard ÉD (1993) Parallel iterative search methods for vehicle routing problems. Networks 23(8):661–673CrossRef Taillard ÉD (1993) Parallel iterative search methods for vehicle routing problems. Networks 23(8):661–673CrossRef
Zurück zum Zitat Taillard ÉD, Laporte G, Gendreau M (1996) Vehicle routeing with multiple use of vehicles. J Oper Res Soc 47(8):1065–1070CrossRef Taillard ÉD, Laporte G, Gendreau M (1996) Vehicle routeing with multiple use of vehicles. J Oper Res Soc 47(8):1065–1070CrossRef
Zurück zum Zitat 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–250CrossRef 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–250CrossRef
Zurück zum Zitat Taniguchi E, Van Der Heijden RECM (2000) An evaluation methodology for the city logistics. Transp Rev 20(1):65–90CrossRef Taniguchi E, Van Der Heijden RECM (2000) An evaluation methodology for the city logistics. Transp Rev 20(1):65–90CrossRef
Zurück zum Zitat 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–495CrossRef 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–495CrossRef
Zurück zum Zitat Tung DV, Pinnoi A (2000) Vehicle routing-scheduling for waste collection in Hanoi. Eur J Oper Res 125(3):449–468CrossRef Tung DV, Pinnoi A (2000) Vehicle routing-scheduling for waste collection in Hanoi. Eur J Oper Res 125(3):449–468CrossRef
Zurück zum Zitat Ullrich AC (2013) Integrated machine scheduling and vehicle routing with time windows. Eur J Oper Res 227(1):152–165CrossRef Ullrich AC (2013) Integrated machine scheduling and vehicle routing with time windows. Eur J Oper Res 227(1):152–165CrossRef
Zurück zum Zitat Van Buer MG, Woodruff DL, Olson RT (1999) Solving the medium newspaper production/distribution problem. Eur J Oper Res 115(2):237–253CrossRef Van Buer MG, Woodruff DL, Olson RT (1999) Solving the medium newspaper production/distribution problem. Eur J Oper Res 115(2):237–253CrossRef
Zurück zum Zitat 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–48CrossRef 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–48CrossRef
Zurück zum Zitat Yellow PC (1970) A computational modification to the savings method of vehicle scheduling. Oper Res Q 21(2):281–283CrossRef Yellow PC (1970) A computational modification to the savings method of vehicle scheduling. Oper Res Q 21(2):281–283CrossRef
Metadaten
Titel
Vehicle routing problems with multiple trips
Publikationsdatum
27.01.2016
Erschienen in
4OR / Ausgabe 3/2016
Print ISSN: 1619-4500
Elektronische ISSN: 1614-2411
DOI
https://doi.org/10.1007/s10288-016-0306-2

Weitere Artikel der Ausgabe 3/2016

4OR 3/2016 Zur Ausgabe

    Marktübersichten

    Die im Laufe eines Jahres in der „adhäsion“ veröffentlichten Marktübersichten helfen Anwendern verschiedenster Branchen, sich einen gezielten Überblick über Lieferantenangebote zu verschaffen.