A Large Neighborhood Search for the Vehicle Routing Problem with Multiple Time Windows

References

• Amorim P, Parragh SN, Sperandio F, Almada-Lobo B (2014) A rich vehicle routing problem dealing with perishable food: A case study. TOP 22(2):489–508.Crossref, Google Scholar
• Baltz A, El Ouali M, Jäger G, Sauerland V, Srivastav A (2015) Exact and heuristic algorithms for the travelling salesman problem with multiple time windows and hotel selection. J. Oper. Res. Soc. 66(4):615–626.Crossref, Google Scholar
• Belhaiza S, Hansen P, Laporte G (2014) A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows. Comput. Oper. Res. 52:269–281.Crossref, Google Scholar
• Belhaiza S, M’Hallah R, Ben Brahim G (2017) A new hybrid genetic variable neighborhood search heuristic for the vehicle routing problem with multiple time windows. Proc. IEEE Congress on Evolutionary Computation, 1319–1326.Google Scholar
• Belhaiza S, M’Hallah R, Ben Brahim G, Laporte G (2019) Three multi-start data-driven evolutionary heuristics for the vehicle routing problem with multiple time windows. J. Heuristics 25(3):485–515.Crossref, Google Scholar
• Bell WJ, Dalberto LM, Fisher ML, Greenfield AJ, Jaikumar R, Kedia P, Mack RG, et al. (1983) Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer. Interfaces 13(6):4–23.Link, Google Scholar
• Bogue ET, Ferreira HS, Noronha TF, Prins C (2022) A column generation and a post optimization VNS heuristic for the vehicle routing problem with multiple time windows. Optim. Lett. 16(1):79–95.Crossref, Google Scholar
• Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12(4):568–581.Link, Google Scholar
• Cordeau JF, Laporte G, Mercier A (2001) A unified tabu search heuristic for vehicle routing problems with time windows. J. Oper. Res. Soc. 52(8):928–936.Crossref, Google Scholar
• de Jong C, Kant G, Vliet A (1996) On finding minimal route duration in the vehicle routing problem with multiple time windows. Technical report. Department of Computer Science, Utrecht University, Utrecht, Netherlands.Google Scholar
• Favaretto D, Moretti E, Pellegrini P (2007) Ant colony system for a VRP with multiple time windows and multiple visits. J. Interdisciplinary Math. 10(2):263–284.Crossref, Google Scholar
• Ferreira HS, Bogue ET, Noronha TF, Belhaiza S, Prins C (2018) Variable neighborhood search for vehicle routing problem with multiple time windows. Electronic Notes Discrete Math. 66:207–214.Crossref, Google Scholar
• Fisher ML (1994) Optimal solution of vehicle routing problems using minimum k-trees. Oper. Res. 42(4):626–642.Link, Google Scholar
• Head T, Kumar M, Nahrstaedt H, Louppe G, Shcherbatyi I (2021) scikit-optimize/scikit-optimize (v0.9.0). Zenodo. https://doi.org/10.5281/zenodo.5565057.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
• Hiermann G, Puchinger J, Ropke S, Hartl RF (2016) The electric fleet size and mix vehicle routing problem with time windows and recharging stations. Eur. J. Oper. Res. 252(3):995–1018.Crossref, Google Scholar
• Hoogeboom M, Dullaert W, Lai D, Vigo D (2020) Efficient neighborhood evaluations for the vehicle routing problem with multiple time windows. Transportation Sci. 54(2):400–416.Link, Google Scholar
• Ibaraki T, Imahori S, Kubo M, Masuda T, Uno T, Yagiura M (2005) Effective local search algorithms for routing and scheduling problems with general time-window constraints. Transportation Sci. 39(2):206–232.Link, Google Scholar
• Kindervater GAP, Savelsbergh MWP (1997) Vehicle routing: Handling edge exchanges. Aarts E, Lenstra JK, eds. Local Search in Combinatorial Optimization (John Wiley & Sons, Boston), 337–360.Google Scholar
• Kytöjoki J, Nuortio T, Bräysy O, Gendreau M (2007) An efficient variable neighborhood search heuristic for very large scale vehicle routing problems. Comput. Oper. Res. 34(9):2743–2757.Crossref, Google Scholar
• Larsen R, Pacino D (2019) Fast delta evaluation for the vehicle routing problem with multiple time windows. Preprint, submitted May 10, https://arxiv.org/abs/1905.04114.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
• Or I (1976) Traveling salesman-type problems and their relation to the logistics of regional blood banking. PhD thesis, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL.Google Scholar
• Paulsen N, Diedrich F, Jansen K (2015) Heuristic approaches to minimize tour duration for the TSP with multiple time windows. Italiano GF, Schmidt M, eds. Proc. 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (Dagstuhl-Leibniz-Zentrum fuer Informatik), 42–55.Google Scholar
• Pisinger D, Ropke S (2007) A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8):2403–2435.Crossref, Google Scholar
• Pisinger D, Ropke S (2010) Large neighborhood search. Gendreau M, Potvin JY, eds. Handbook of Metaheuristics, 2nd ed. (Springer, Boston).Crossref, Google Scholar
• Potvin JY, Rousseau JM (1995) An exchange heuristic for routing problems with time windows. J. Oper. Res. Soc. 46(12):1433–1446.Crossref, Google Scholar
• Ribeiro G, Laporte G (2012) An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem. Comput. Oper. Res. 39(3):728–735.Crossref, Google Scholar
• Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Sci. 40(4):455–472.Link, 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
• Shaw P (1998) Using constraint programming and local search methods to solve vehicle routing problems. Principles and Practice of Constraint Programming—CP98 (Springer, Berlin, Heidelberg), 417–431.Crossref, Google Scholar
• Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2):254–265.Link, Google Scholar
• Tricoire F, Romauch M, Doerner KF, Hartl RF (2010) Heuristics for the multi-period orienteering problem with multiple time windows. Comput. Oper. Res. 37(2):351–367.Crossref, Google Scholar
• Vidal T, Crainic TG, Gendreau M, Prins C (2014) A unified solution framework for multi-attribute vehicle routing problems. Eur. J. Oper. Res. 234(3):658–673.Crossref, Google Scholar
• Xu H, Chen ZL, Rajagopal S, Arunapuram S (2003) Solving a practical pickup and delivery problem. Transportation Sci. 37(3):347–364.Link, Google Scholar