The Multi-Trip Vehicle Routing Problem with Time Windows and Release Dates

References

• Arda Y, Crama Y, Kronus D, Pironet T, Van Hentenryck P (2014) Multi-period vehicle loading with stochastic release dates. Eur. J. Transportation Logist. 3(2):93–119.Crossref, Google Scholar
• 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–766.Crossref, Google Scholar
• 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–763.Crossref, Google Scholar
• 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–3050.Crossref, Google Scholar
• Błażewicz J, Ecker K, Pesch E, Schmidt G, Wȩglarz J (2007) Scheduling on one processor. Błażewicz J, Ecker K, Pesch E, Schmidt G, Wȩglarz J, eds. Handbook on Scheduling—From Theory to Application, Internat. Handbook Inform. Systems (Springer-Verlag, Berlin Heidelberg), 73–136.Google Scholar
• Bräysy O, Gendreau M (2005a) Vehicle routing problem with time windows, part I: Route construction and local search algorithms. Transportation Sci. 39(1):104–118.Link, Google Scholar
• Bräysy O, Gendreau M (2005b) Vehicle routing problem with time windows, part II: Metaheuristics. Transportation Sci. 39(1):119–139.Link, Google Scholar
• Cattaruzza D, Absi N, Feillet D, Vidal T (2014a) A memetic algorithm for the multi trip vehicle routing problem. Eur. J. Oper. Res. 236(6):833–848.Crossref, Google Scholar
• Cattaruzza D, Absi N, Feillet D, Vigo D (2014b) An iterated local search for the multi-commodity multi-trip vehicle routing problem with time windows. Comput. Oper. Res. 51:257–267.Crossref, Google Scholar
• Crainic TG (2008) City logistics. Chen Z-L, Raghavan S, eds. Tutorials in Operations Research 2008—State-of-the-Art Decision Making Tools in the Information-Intensive Age (INFORMS, Hanover, MD), 181–212.Link, Google Scholar
• Grünert T (2013) GTS systems and consulting GmbH. Private communication, December 12.Google Scholar
• Hansen N, Ostermeier A (2001) Completely derandomized self-adaptation in evolution strategies. Evolutionary Comput. 9(2):159–195.Crossref, Google Scholar
• Hemmelmayr VC, Cordeau JF, Crainic TG (2012) An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics. Comput. Oper. Res. 39(12):3215–3228.Crossref, Google Scholar
• Hernandez F (2010) Méthodes de résolution exactes pour le problème de routage de véhicules avec fenêtres de temps et routes multiples. Unpublished doctoral thesis, Université Montpellier II, Montpellier, France. http://www.biu-montpellier.fr/florabium/jsp/nnt.jsp?nnt=2010MON20215.Google Scholar
• 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(3):235–259.Crossref, Google Scholar
• Hernandez F, Feillet D, Giroudeau R, Naud O (2016) Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows. Eur. J. Oper. Res. 249(2):551–559.Crossref, Google Scholar
• Holland J (1975) Adaptation in Natural and Artificial Systems (University of Michigan Press, Ann Arbor, MI).Google Scholar
• Irnich S (2008) A unified modeling and solution framework for vehicle routing and local search-based metaheuristics. INFORMS J. Comput. 20(2):270–287.Link, Google Scholar
• Kleff A (2013) PTV Group, Karlsruhe, Germany. Private communication, December 12.Google Scholar
• Larsen A (2001) The dynamic vehicle routing problem. Unpublished doctoral thesis, Technical University of Denmark, Lyngby, Denmark. http://www2.imm.dtu.dk/pubdb/views/edoc_download.php/143/pdf/imm14.Google Scholar
• Larsen A, Madsen OBG, Solomon MM (2008) Recent developments in dynamic vehicle routing systems. Golden B, Raghavan S, Wasil E, eds. The Vehicle Routing Problem—Latest Advances and New Challenges, Oper. Res. Comput. Sci. Interfaces, Vol. 43 (Springer-Verlag, New York), 199–218.Crossref, Google Scholar
• 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–545.Crossref, Google Scholar
• Moscato P, Cotta C (2010) A modern introduction to memetic algorithms. Gendreau M, Potvin J-Y, eds. Handbook of Metaheuristics, 2nd ed., Internat. Series Oper. Res. Management Sci., Vol. 146 (Springer-Verlag, New York), 141–183.Crossref, Google Scholar
• Nagata Y, Bräysy O, Dullaert W (2010) A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows. Comput. Oper. Res. 37(4):724–737.Crossref, Google Scholar
• Neri F, Cotta C (2012) Memetic algorithms and memetic computing optimization: A literature review. Swarm Evolutionary Comput. 2:1–14.Crossref, Google Scholar
• Olivera A, Viera O (2007) Adaptive memory programming for the vehicle routing problem with multiple trips. Comput. Oper. Res. 34(1):28–47.Crossref, Google Scholar
• Pillac V, Gendreau M, Guéret C, Medaglia AL (2013) A review of dynamic vehicle routing problems. Eur. J. Oper. Res. 225(1):1–11.Crossref, Google Scholar
• Pinedo ML (2001) Manufacturing models. Pinedo ML, ed. Planning and Scheduling in Manufacturing and Services, Springer Series Oper. Res. (Springer-Verlag, New York), 19–36.Google Scholar
• Prins C (2004) A simple and effective evolutionary algorithm for the vehicle routing problem. Comput. Oper. Res. 31(12):1985–2002.Crossref, Google Scholar
• Prins C (2009) Two memetic algorithms for heterogeneous fleet vehicle routing problems. Engrg. Appl. Artificial Intelligence 22(6):916–928.Crossref, Google Scholar
• Reeves CR (2010) Genetic algorithms. Gendreau M, Potvin J-Y, eds. Handbook of Metaheuristics, 2nd ed., Internat. Series Oper. Res. Management Sci., Vol. 146 (Springer-Verlag, New York), 109–140.Crossref, Google Scholar
• Savelsbergh MWP (1985) Local search in routing problems with time windows. Ann. Oper. Res. 4(1):285–305.Crossref, Google Scholar
• Schneider M, Sand B, Stenger A (2013) A note on the time travel approach for handling time windows in vehicle routing problems. Comput. Oper. Res. 40(10):2564–2568.Crossref, Google Scholar
• Solomon MM (1987) Algorithms for the vehicle routing and scheduling problem with time windows constraints. Oper. Res. 35(2):254–265.Link, Google Scholar
• Taillard ÉD, Laporte G, Gendreau M (1996) Vehicle routing with multiple use of vehicles. J. Oper. Res. Soc. 47(8):1065–1070.Crossref, Google Scholar
• Vidal T, Crainic TG, Gendreau M, Lahrichi N, Rei W (2012) A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Oper. Res. 60(3):611–624.Link, Google Scholar
• Vidal T, Crainic TG, Gendreau M, Prins C (2013) A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time windows. Comput. Oper. Res. 40(1):475–489.Crossref, Google Scholar