General Edge Assembly Crossover-Driven Memetic Search for Split Delivery Vehicle Routing

References

• Accorsi L, Vigo D (2021) A fast and scalable heuristic for the solution of large-scale capacitated vehicle routing problems. Transportation Sci. 55(4):832–856.Link, Google Scholar
• Aleman RE, Hill RR (2010) A tabu search with vocabulary building approach for the vehicle routing problem with split demands. Internat. J. Metaheuristics 1(1):55–80.Crossref, Google Scholar
• Aleman RE, Zhang X, Hill RR (2009) A ring-based diversification scheme for routing problems. Internat. J. Math. Oper. Res. 1(1–2):163–190.Crossref, Google Scholar
• Aleman RE, Zhang X, Hill RR (2010) An adaptive memory algorithm for the split delivery vehicle routing problem. J. Heuristics 16(3):441–473.Crossref, Google Scholar
• Archetti C, Speranza MG (2004) Vehicle routing in the 1-skip collection problem. J. Oper. Res. Soc. 55(7):717–727.Crossref, Google Scholar
• Archetti C, Speranza MG (2012) Vehicle routing problems with split deliveries. Internat. Transactions Oper. Res. 19(1–2):3–22.Crossref, Google Scholar
• Archetti C, Bianchessi N, Speranza MG (2014) Branch-and-cut algorithms for the split delivery vehicle routing problem. Eur. J. Oper. Res. 238(3):685–698.Crossref, Google Scholar
• Archetti C, Speranza MG, Hertz A (2006) A tabu search algorithm for the split delivery vehicle routing problem. Transportation Sci. 40(1):64–73.Link, Google Scholar
• Archetti C, Speranza MG, Savelsbergh MW (2008) An optimization-based heuristic for the split delivery vehicle routing problem. Transportation Sci. 42(1):22–31.Link, Google Scholar
• Arnold F, Sörensen K (2019) What makes a VRP solution good? The generation of problem-specific knowledge for heuristics. Comput. Oper. Res. 106(June):280–288.Crossref, Google Scholar
• Belenguer JM, Martinez M, Mota E (2000) A lower bound for the split delivery vehicle routing problem. Oper. Res. 48(5):801–810.Link, Google Scholar
• Berbotto L, García S, Nogales FJ (2014) A randomized granular tabu search heuristic for the split delivery vehicle routing problem. Ann. Oper. Res. 222(1):153–173.Crossref, Google Scholar
• Boudia M, Prins C, Reghioui M (2007) An effective memetic algorithm with population management for the split delivery vehicle routing problem. Bartz-Beielstein T, Blesa Aguilera MJ, Blum C, Naujoks B, Roli A, Rudolph G, Sampels M, eds. Proc. 4th Internat. Workshop Hybrid Metaheuristics (Springer, Berlin), 16–30.Google Scholar
• Campos V, Corberán A, Mota E (2008) A scatter search algorithm for the split delivery vehicle routing problem. Fink A, Rothlauf F, eds. Advances in Computational Intelligence in Transport, Logistics, and Supply Chain Management (Springer, Berlin), 137–152.Crossref, Google Scholar
• Chen S, Golden B, Wasil E (2007) The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results. Networks 49(4):318–329.Crossref, Google Scholar
• Chen Y, Hao JK, Glover F (2016) A hybrid metaheuristic approach for the capacitated arc routing problem. Eur. J. Oper. Res. 253(1):25–39.Crossref, Google Scholar
• Chen P, Golden B, Wang X, Wasil E (2017) A novel approach to solve the split delivery vehicle routing problem. Internat. Trans. Oper. Res. 24(1–2):27–41.Crossref, Google Scholar
• Derigs U, Li B, Vogel U (2010) Local search-based metaheuristics for the split delivery vehicle routing problem. J. Oper. Res. Soc. 61(9):1356–1364.Crossref, Google Scholar
• Dror M, Trudeau P (1989) Savings by split delivery routing. Transportation Sci. 23(2):141–145.Link, Google Scholar
• Dror M, Trudeau P (1990) Split delivery routing. Naval Res. Logist. 37(3):383–402.Crossref, Google Scholar
• Gendreau M, Hertz A, Laporte G (1994) A tabu search heuristic for the vehicle routing problem. Management Sci. 40(10):1276–1290.Link, Google Scholar
• Glover FW, Hao J (2011) The case for strategic oscillation. Ann. Oper. Res. 183(1):163–173.Crossref, Google Scholar
• Groër C, Golden B, Wasil E (2010) A library of local search heuristics for the vehicle routing problem. Math. Programming Comput. 2(2):79–101.Crossref, Google Scholar
• Han AFW, Chu YC (2016) A multi-start heuristic approach for the split-delivery vehicle routing problem with minimum delivery amounts. Transportation Res. Part E Logist. Transportation Rev. 88(April):11–31.Crossref, Google Scholar
• Hao J-K (2012) Memetic algorithms in discrete optimization. Neri F, Cotta C, Moscato P, eds. Handbook of Memetic Algorithms, Studies in Computational Intelligence, Vol. 379 (Springer, Berlin), 73–94.Crossref, Google Scholar
• Jin M, Liu K, Eksioglu B (2008) A column generation approach for the split delivery vehicle routing problem. Oper. Res. Lett. 36(2):265–270.Crossref, Google Scholar
• López-Ibáñez M, Dubois-Lacoste J, Cáceres LP, Birattari M, Stützle T (2016) The irace package: Iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3:43–58.Crossref, Google Scholar
• Mota E, Campos V, Corberán Á (2007) A new metaheuristic for the vehicle routing problem with split demands. Cotta C, Van Hemert J, eds. Proc. 7th Eur. Conf. Evolutionary Comput. Combin. Optim. (Springer, Berlin), 121–129.Google Scholar
• Mühlenbein H (1990) Evolution in time and space—The parallel genetic algorithm. Rawlins GJE, ed. Proc. First Workshop Foundations Genetic Algorithms (Morgan Kaufmann, San Mateo, CA), 316–337.Google Scholar
• Munari P, Savelsbergh M (2022) Compact formulations for split delivery routing problems. Transportation Sci. 56(4):1022–1043.Link, Google Scholar
• Nagata Y, Bräysy O (2009) Edge assembly-based memetic algorithm for the capacitated vehicle routing problem. Networks 54(4):205–215.Crossref, Google Scholar
• Nagata Y, Kobayashi S (1997) Edge assembly crossover: A high-power genetic algorithm for the traveling salesman problem. Bäck T, ed. Proc. 7th Internat. Conf. Genetic Algorithms (Morgan Kaufmann, San Francisco), 450–457.Google Scholar
• Nagata Y, Kobayashi S (2013) A powerful genetic algorithm using edge assembly crossover for the traveling salesman problem. INFORMS J. Comput. 25(2):346–363.Link, 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
• Ozbaygin G, Karasan O, Yaman H (2018) New exact solution approaches for the split delivery vehicle routing problem. EURO J. Comput. Optim. 6(1):85–115.Crossref, Google Scholar
• Potvin JY (2009) State-of-the art review—Evolutionary algorithms for vehicle routing. INFORMS J. Comput. 21(4):518–548.Link, Google Scholar
• Potvin JY, Rousseau JM (1995) An exchange heuristic for routeing problems with time windows. J. Oper. Res. Soc. 46(12):1433–1446.Crossref, 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
• 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, Löffler M (2019) Large composite neighborhoods for the capacitated location-routing problem. Transportation Sci. 53(1):301–318.Link, Google Scholar
• Shaw P (1998) Using constraint programming and local search methods to solve vehicle routing problems. Maher M, Puget J-F, eds. Internat. Conf. Principles Practice Constraint Programming (Springer, Berlin), 417–431.Google Scholar
• Shi J, Zhang J, Wang K, Fang X (2018) Particle swarm optimization for split delivery vehicle routing problem. Asia-Pacific J. Oper. Res. 35(2):1840006.Crossref, Google Scholar
• Silva MM, Subramanian A, Ochi LS (2015) An iterated local search heuristic for the split delivery vehicle routing problem. Comput. Oper. Res. 53(January):234–249.Crossref, Google Scholar
• Song SH, Lee KS, Kim GS (2002) A practical approach to solving a newspaper logistics problem using a digital map. Comput. Indust. Engrg. 43(1–2):315–330.Crossref, Google Scholar
• Vidal T (2022) Hybrid genetic search for the CVRP: Open-source implementation and SWAP* neighborhood. Comput. Oper. Res. 140(April):105643.Crossref, 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
• 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
• 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
• Wilck JH IV, Cavalier T (2012) A genetic algorithm for the split delivery vehicle routing problem. Amer. J. Oper. Res. 2(2):207–216.Google Scholar
• Zhang Z, He H, Luo Z, Qin H, Guo S (2015) An efficient forest-based tabu search algorithm for the split-delivery vehicle routing problem. Bonet B, Koenig S, eds. Proc. 29th AAAI Conf. Artificial Intelligence (AAAI Press, Palo Alto, CA), 3432–3438.Google Scholar