An Exact Algorithm for the Multitrip Vehicle Routing Problem

References

• Alonso F, Alvarez MJ, Beasley JE. A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions. J. Oper. Res. Soc. (2008) 59(7):963–976Crossref, Google Scholar
• Azi N, Gendreau M, Potvin J-Y. An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles. Eur. J. Oper. Res. (2010) 202(3):756–763Crossref, Google Scholar
• Baldacci R, Christofides N, Mingozzi A. An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math. Programming Ser. A (2008) 115(2):351–385Crossref, Google Scholar
• Baldacci R, Mingozzi A, Roberti R. New route relaxation and pricing strategies for the vehicle routing problem. Oper. Res. (2011) 59(5):1269–1283Link, Google Scholar
• Brandão JCS, Mercer A. A tabu search algorithm for the multitrip vehicle routing and scheduling problem. Eur. J. Oper. Res. (1997) 100(1):180–191Crossref, Google Scholar
• Brandão JCS, Mercer A. The multi-trip vehicle routing problem. J. Oper. Res. Soc. (1998) 49(8):799–805Crossref, Google Scholar
• Christofides N, Mingozzi A, Toth P, Christofides N, Mingozzi A, Toth P, Sandi C. The vehicle routing problem. Combinatorial Optimization (1979) (John Wiley & Sons, Chichester, UK) 315–338Google Scholar
• Christofides N, Mingozzi A, Toth P. Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Math. Programming Ser. A (1981) 20(1):255–280Crossref, Google Scholar
• Fleischmann B. The vehicle routing problem with multiple use of vehicles. (1990) . Working paper, Facbereich Wirtschaftswissenschafte, Universitat Hamburg, Hamburg, GermanyGoogle Scholar
• Gribkovskaia I, Gullberg BO, Hovden KJ, Wallace SW. Optimization model for a livestock collection problem. Internat. J. Physical Distribution Logist. Management (2006) 36(2):136–152Crossref, Google Scholar
• Jepsen M, Petersen B, Spoorendonk S, Pisinger D. Subset-row inequalities applied to the vehicle-routing problem with time windows. Oper. Res. (2008) 56(2):497–511Link, Google Scholar
• Mester D, Bräysy O. Active guided evolution strategies for large-scale vehicle routing problems with time windows. Comput. Oper. Res. (2005) 32(6):1593–1614Crossref, Google Scholar
• Olivera A. Memorias adaptativas para el problema de ruteo de vehículos con múltiples viajes. (2005) . Ph.D. thesis, Instituto de Computación, Facultad de Ingeniería, Universidad de la República, Montevideo, UruguayGoogle Scholar
• Olivera A, Viera O. Adaptive memory programming for the vehicle routing problem with multiple trips. Comput. Oper. Res. (2007) 34(1):28–47Crossref, Google Scholar
• Petch RJ, Salhi S. A multi-phase constructive heuristic for the vehicle routing problem with multiple trips. Discrete Appl. Math. (2004) 133(1–3):69–92Crossref, Google Scholar
• Rochat Y, Taillard É. D. Probabilistic intensification and diversification in local search for vehicle routing. J. Heuristics (1995) 1(1):147–167Crossref, Google Scholar
• Salhi S, Petch RJ. A GA based heuristic for the vehicle routing problem with multiple trips. J. Math. Model. Algorithms (2007) 6(4):591–613Crossref, Google Scholar
• Taillard ÉD. (2009) . Private communication. (June 16)Google Scholar
• Taillard ÉD, Laporte G, Gendreau M. Vehicle routeing with multiple use of vehicles. J. Oper. Res. Soc. (1996) 47(8):1065–1070Crossref, Google Scholar