A Hybrid Genetic Algorithm with Multi-Population for Capacitated Location Routing

References

• Accorsi L, Vigo D (2020) A hybrid metaheuristic for single truck and trailer routing problems. Transportation Sci. 54(5):1351–1371.Link, Google Scholar
• Akpunar ÖŞ, Akpinar Ş (2021) A hybrid adaptive large neighbourhood search algorithm for the capacitated location routing problem. Expert Systems Appl. 168:114304.Crossref, Google Scholar
• Arnold F, Sörensen K (2021) A progressive filtering heuristic for the location-routing problem and variants. Comput. Oper. Res. 129:105166.Crossref, Google Scholar
• Baldacci R, Mingozzi A, Wolfler Calvo R (2011) An exact method for the capacitated location-routing problem. Oper. Res. 59(5):1284–1296.Link, Google Scholar
• Barreto S, Ferreira C, Paixao J, Santos BS (2007) Using clustering analysis in a capacitated location-routing problem. Eur. J. Oper. Res. 179(3):968–977.Crossref, Google Scholar
• Cochran JK, Horng S, Fowler JW (2003) A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines. Comput. Oper. Res. 30(7):1087–1102.Crossref, Google Scholar
• Contardo C, Cordeau JF, Gendron B (2014a) An exact algorithm based on cut-and-column generation for the capacitated location-routing problem. INFORMS J. Comput. 26(1):88–102.Link, Google Scholar
• Contardo C, Cordeau JF, Gendron B (2014b) A GRASP+ILP-based metaheuristic for the capacitated location-routing problem. J. Heuristics 20(1):1–38.Crossref, Google Scholar
• Cordeau JF, Gendreau M, Laporte G (1997) A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks: An Internat. J. 30(2):105–119.Google Scholar
• Drexl M, Schneider M (2015) A survey of variants and extensions of the location-routing problem. Eur. J. Oper. Res. 241(2):283–308.Crossref, Google Scholar
• Duhamel C, Lacomme P, Prins C, Prodhon C (2010) A GRASP×ELS approach for the capacitated location-routing problem. Comput. Oper. Res. 37(11):1912–1923.Crossref, Google Scholar
• Escobar JW, Linfati R, Baldoquin MG, Toth P (2014) A granular variable tabu neighborhood search for the capacitated location-routing problem. Transportation Res. Part B: Methodological 67:344–356.Crossref, Google Scholar
• Escobar JW, Linfati R, Toth P (2013) A two-phase hybrid heuristic algorithm for the capacitated location-routing problem. Comput. Oper. Res. 40(1):70–79.Crossref, Google Scholar
• Hao JK (2012) Memetic algorithms in discrete optimization. Neri F, Cotta C, Moscato P, eds. Handbook of Memetic Algorithms, Volume 379 of Studies in Computational Intelligence (Springer, Berlin, Heidelberg), 73–94.Crossref, Google Scholar
• He P, Hao JK (2023) General edge assembly crossover-driven memetic search for split delivery vehicle routing. Transportation Sci. 57(2):482–511.Link, Google Scholar
• He P, Hao JK, Wu Q (2023) A hybrid genetic algorithm for undirected traveling salesman problems with profits. Networks: Internat. J. 82(3):189–221.Google Scholar
• He P, Hao JK, Wu Q (2025) A hybrid genetic algorithm with multi-population for capacitated location routing. https://doi.org/10.1287/ijoc.2023.0416.cd, https://github.com/INFORMSJoC/2023.0416.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
• Liguori P, Mahjoub AR, Marques G, Uchoa E, Sadykov R (2023) Nonrobust strong knapsack cuts for capacitated location-routing and related problems. Oper. Res. 71(5):1577–1595.Link, Google Scholar
• Lopes RB, Ferreira C, Santos BS (2016) A simple and effective evolutionary algorithm for the capacitated location–routing problem. Comput. Oper. Res. 70:155–162.Crossref, Google Scholar
• Lopes RB, Plastria F, Ferreira C, Santos BS (2014) Location-arc routing problem: Heuristic approaches and test instances. Comput. Oper. Res. 43:309–317.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
• Mara STW, Kuo R, Asih AMS (2021) Location-routing problem: A classification of recent research. Internat. Trans. Oper. Res. 28(6):2941–2983.Crossref, Google Scholar
• Nagata Y, Bräysy O (2009) Edge assembly-based memetic algorithm for the capacitated vehicle routing problem. Networks: Internat. J. 54(4):205–215.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
• Nagy G, Salhi S (2007) Location-routing: Issues, models and methods. Eur. J. Oper. Res. 177(2):649–672.Crossref, Google Scholar
• Neri F, Cotta C, Moscato P, eds. (2012) Handbook of Memetic Algorithms, Volume 379 of Studies in Computational Intelligence (Springer, Berlin, Heidelberg).Google Scholar
• Perboli G, Tadei R, Vigo D (2011) The two-echelon capacitated vehicle routing problem: Models and math-based heuristics. Transportation Sci. 45(3):364–380.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, Prodhon C, Calvo RW (2006a) A memetic algorithm with population management (ma—pm) for the capacitated location-routing problem. Gottlieb J, Raidl GR, eds. Evolutionary Computation in Combinatorial Optimization (Berlin, Heidelberg: Springer Berlin Heidelberg), 183–194.Crossref, Google Scholar
• Prins C, Prodhon C, Calvo RW (2006b) Solving the capacitated location-routing problem by a grasp complemented by a learning process and a path relinking. 4OR 4(3):221–238.Crossref, Google Scholar
• Prins C, Prodhon C, Ruiz A, Soriano P, Wolfler Calvo R (2007) Solving the capacitated location-routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristic. Transportation Sci. 41(4):470–483.Link, Google Scholar
• Prodhon C, Prins C (2014) A survey of recent research on location-routing problems. Eur. J. Oper. Res. 238(1):1–17.Crossref, Google Scholar
• Quintero-Araujo CL, Caballero-Villalobos JP, Juan AA, Montoya-Torres JR (2017) A biased-randomized metaheuristic for the capacitated location routing problem. Internat. Trans. Oper. Res. 24(5):1079–1098.Crossref, Google Scholar
• Schneider M, Drexl M (2017) A survey of the standard location-routing problem. Ann. Oper. Res. 259(1):389–414.Crossref, 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 JF, eds. Principles and Practice of Constraint Programming — CP98 (Berlin, Heidelberg: Springer Berlin Heidelberg), 417–431.Crossref, Google Scholar
• Sobhanan A, Park J, Park J, Kwon C (2025) Genetic algorithms with neural cost predictor for solving hierarchical vehicle routing problems. Transportation Sci. 59(2):322–339.Google Scholar
• Ting CJ, Chen CH (2013) A multiple ant colony optimization algorithm for the capacitated location routing problem. Internat. J. Production Econom. 141(1):34–44.Crossref, Google Scholar
• Toledo CFM, de Oliveira RRR, França PM (2013) A hybrid multi-population genetic algorithm applied to solve the multi-level capacitated lot sizing problem with backlogging. Comput. Oper. Res. 40(4):910–919.Crossref, Google Scholar
• Tuzun D, Burke LI (1999) A two-phase tabu search approach to the location routing problem. Eur. J. Oper. Res. 116(1):87–99.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
• Vincent FY, Lin SW, Lee W, Ting CJ (2010) A simulated annealing heuristic for the capacitated location routing problem. Comput. Indust. Engrg. 58(2):288–299.Crossref, Google Scholar
• Voigt S, Frank M, Fontaine P, Kuhn H (2022) Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions. Comput. Oper. Res. 146:105856.Crossref, Google Scholar