{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T20:30:23Z","timestamp":1769200223999,"version":"3.49.0"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s12293-024-00412-8","type":"journal-article","created":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T08:02:37Z","timestamp":1718006557000},"page":"179-202","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Exploring dynamic population Island genetic algorithm for solving the capacitated vehicle routing problem"],"prefix":"10.1007","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7541-0483","authenticated-orcid":false,"given":"Babak","family":"Rezaei","sequence":"first","affiliation":[]},{"given":"Frederico","family":"Gadelha Guimaraes","sequence":"additional","affiliation":[]},{"given":"Rasul","family":"Enayatifar","sequence":"additional","affiliation":[]},{"given":"Pauline","family":"C. Haddow","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,10]]},"reference":[{"issue":"1","key":"412_CR1","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manage Sci 6(1):80\u201391. https:\/\/doi.org\/10.1287\/mnsc.6.1.80","journal-title":"Manage Sci"},{"key":"412_CR2","doi-asserted-by":"crossref","unstructured":"Toth, P. and D. Vigo (2014), Vehicle routing: problems, methods, and applications, SIAM.","DOI":"10.1137\/1.9781611973594"},{"issue":"1","key":"412_CR3","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s12667-022-00501-y","volume":"14","author":"J Euchi","year":"2023","unstructured":"Euchi J, Yassine A (2023) A hybrid metaheuristic algorithm to solve the electric vehicle routing problem with battery recharging stations for sustainable environmental and energy optimization. Energy Syst 14(1):243\u2013267","journal-title":"Energy Syst"},{"issue":"1","key":"412_CR4","first-page":"56","volume":"10","author":"V Bahmani","year":"2023","unstructured":"Bahmani V, Adibi MA, Mehdizadeh E (2023) Integration of two-stage assembly flow shop scheduling and vehicle routing using improved whale optimization algorithm. J Appl Res Ind Eng 10(1):56\u201383","journal-title":"J Appl Res Ind Eng"},{"issue":"21","key":"412_CR5","doi-asserted-by":"publisher","first-page":"14473","DOI":"10.3390\/su142114473","volume":"14","author":"Y Li","year":"2022","unstructured":"Li Y, Liu M, Jiang D (2022) Application of unmanned aerial vehicles in logistics: a literature review. Sustainability 14(21):14473","journal-title":"Sustainability"},{"issue":"3","key":"412_CR6","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1057\/jors.1969.75","volume":"20","author":"N Christofides","year":"1969","unstructured":"Christofides N, Eilon S (1969) An Algorithm for the Vehicle-dispatching Problem. J Operational Res Soc 20(3):309\u2013318. https:\/\/doi.org\/10.1057\/jors.1969.75","journal-title":"J Operational Res Soc"},{"issue":"2","key":"412_CR7","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10107-003-0481-8","volume":"100","author":"J Lysgaard","year":"2004","unstructured":"Lysgaard J, Letchford AN, Eglese RW (2004) A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math Program 100(2):423\u2013445. https:\/\/doi.org\/10.1007\/s10107-003-0481-8","journal-title":"Math Program"},{"issue":"3","key":"412_CR8","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1016\/j.ejor.2016.08.012","volume":"257","author":"E Uchoa","year":"2017","unstructured":"Uchoa E, Pecin D, Pessoa A, Poggi M, Vidal T, Subramanian A (2017) New benchmark instances for the capacitated vehicle routing problem. Eur J Oper Res 257(3):845\u2013858. https:\/\/doi.org\/10.1016\/j.ejor.2016.08.012","journal-title":"Eur J Oper Res"},{"issue":"4","key":"412_CR9","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G Clarke","year":"1964","unstructured":"Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12(4):568\u2013581. https:\/\/doi.org\/10.1287\/opre.12.4.568","journal-title":"Oper Res"},{"issue":"2","key":"412_CR10","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1287\/opre.22.2.340","volume":"22","author":"BE Gillett","year":"1974","unstructured":"Gillett BE, Miller LR (1974) A heuristic algorithm for the vehicle-dispatch problem. Oper Res 22(2):340\u2013349. https:\/\/doi.org\/10.1287\/opre.22.2.340","journal-title":"Oper Res"},{"key":"412_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-32363-5_4","author":"C Prins","year":"2005","unstructured":"Prins C, Bouchenoua S (2005) A memetic algorithm solving the VRP, the CARP and general routing problems with nodes, edges and arcs. Recent Adv Memet Algorithms. https:\/\/doi.org\/10.1007\/3-540-32363-5_4","journal-title":"Recent Adv Memet Algorithms"},{"issue":"10","key":"412_CR12","doi-asserted-by":"publisher","first-page":"2519","DOI":"10.1016\/j.cor.2013.01.013","volume":"40","author":"A Subramanian","year":"2013","unstructured":"Subramanian A, Uchoa E, Ochi LS (2013) A hybrid algorithm for a class of vehicle routing problems. Comput Oper Res 40(10):2519\u20132531. https:\/\/doi.org\/10.1016\/j.cor.2013.01.013","journal-title":"Comput Oper Res"},{"issue":"2 Part1","key":"412_CR13","doi-asserted-by":"publisher","first-page":"1505","DOI":"10.1016\/j.eswa.2007.11.060","volume":"36","author":"S-W Lin","year":"2009","unstructured":"Lin S-W, Lee Z-J, Ying K-C, Lee C-Y (2009) Applying hybrid meta-heuristics for capacitated vehicle routing problem. Expert Syst Appl 36(2 Part1):1505\u20131512. https:\/\/doi.org\/10.1016\/j.eswa.2007.11.060","journal-title":"Expert Syst Appl"},{"issue":"1","key":"412_CR14","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s12351-019-00543-8","volume":"22","author":"I Sbai","year":"2022","unstructured":"Sbai I, Krichen S, Limam O (2022) Two meta-heuristics for solving the capacitated vehicle routing problem: the case of the tunisian post office. Oper Res Int J 22(1):507\u2013549. https:\/\/doi.org\/10.1007\/s12351-019-00543-8","journal-title":"Oper Res Int J"},{"key":"412_CR15","doi-asserted-by":"publisher","unstructured":"Kao, Y. and M. Chen (2011) Solving the CVRP Problem Using a Hybrid PSO Approach. In: Computational Intelligence: Revised and Selected Papers of the International Joint Conference, IJCCI 2011, Paris, France, October 24\u201326, 2013. Berlin, Heidelberg: Springer Berlin Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-35638-4_5","DOI":"10.1007\/978-3-642-35638-4_5"},{"key":"412_CR16","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.eswa.2016.05.023","volume":"61","author":"S Akpinar","year":"2016","unstructured":"Akpinar S (2016) Hybrid large neighbourhood search algorithm for capacitated vehicle routing problem. Expert Syst Appl 61:28\u201338. https:\/\/doi.org\/10.1016\/j.eswa.2016.05.023","journal-title":"Expert Syst Appl"},{"issue":"12","key":"412_CR17","doi-asserted-by":"publisher","first-page":"1985","DOI":"10.1016\/S0305-0548(03)00158-8","volume":"31","author":"C Prins","year":"2004","unstructured":"Prins C (2004) A simple and effective evolutionary algorithm for the vehicle routing problem. Comput Oper Res 31(12):1985\u20132002. https:\/\/doi.org\/10.1016\/S0305-0548(03)00158-8","journal-title":"Comput Oper Res"},{"issue":"4","key":"412_CR18","doi-asserted-by":"publisher","first-page":"2941","DOI":"10.1007\/s00500-019-04072-6","volume":"24","author":"O Gokalp","year":"2020","unstructured":"Gokalp O, Ugur A (2020) A multi-start ILS\u2013RVND algorithm with adaptive solution acceptance for the CVRP. Soft Comput 24(4):2941\u20132953. https:\/\/doi.org\/10.1007\/s00500-019-04072-6","journal-title":"Soft Comput"},{"issue":"3","key":"412_CR19","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1287\/opre.1120.1048","volume":"60","author":"T Vidal","year":"2012","unstructured":"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\u2013624. https:\/\/doi.org\/10.1287\/opre.1120.1048","journal-title":"Oper Res"},{"issue":"12","key":"412_CR20","doi-asserted-by":"publisher","first-page":"25062","DOI":"10.1109\/TITS.2022.3180760","volume":"23","author":"J-Y Li","year":"2022","unstructured":"Li J-Y, Deng X-Y, Zhan Z-H, Yu L, Tan KC, Lai K-K, Zhang J (2022) A multipopulation multiobjective ant colony system considering travel and prevention costs for vehicle routing in COVID-19-like epidemics. IEEE Trans Intell Transp Syst 23(12):25062\u201325076. https:\/\/doi.org\/10.1109\/TITS.2022.3180760","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"412_CR21","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1016\/j.cor.2018.02.007","volume":"106","author":"F Arnold","year":"2019","unstructured":"Arnold F, S\u00f6rensen K (2019) What makes a VRP solution good? The generation of problem-specific knowledge for heuristics. Comput Oper Res 106:280\u2013288. https:\/\/doi.org\/10.1016\/j.cor.2018.02.007","journal-title":"Comput Oper Res"},{"issue":"2","key":"412_CR22","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1287\/trsc.2019.0914","volume":"54","author":"J Christiaens","year":"2020","unstructured":"Christiaens J, Vanden Berghe G (2020) Slack induction by string removals for vehicle routing problems. Transp Sci 54(2):417\u2013433. https:\/\/doi.org\/10.1287\/trsc.2019.0914","journal-title":"Transp Sci"},{"key":"412_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105643","volume":"140","author":"T Vidal","year":"2022","unstructured":"Vidal T (2022) Hybrid genetic search for the CVRP: open-source implementation and SWAP* neighborhood. Comput Oper Res 140:105643. https:\/\/doi.org\/10.1016\/j.cor.2021.105643","journal-title":"Comput Oper Res"},{"key":"412_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110309","volume":"142","author":"B Rezaei","year":"2023","unstructured":"Rezaei B, Guimaraes FG, Enayatifar R, Haddow PC (2023) Combining genetic local search into a multi-population imperialist competitive algorithm for the capacitated vehicle routing problem. Appl Soft Comput 142:110309. https:\/\/doi.org\/10.1016\/j.asoc.2023.110309","journal-title":"Appl Soft Comput"},{"key":"412_CR25","unstructured":"Ammi, M. and S. Chikhi. An island model based genetic algorithm for solving the capacitated vehicle routing problem. IEEE."},{"issue":"11","key":"412_CR26","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1631\/jzus.C1300184","volume":"14","author":"E Osaba","year":"2013","unstructured":"Osaba E, Onieva E, Carballedo R, Diaz F, Perallos A, Zhang X (2013) A multi-crossover and adaptive island based population algorithm for solving routing problems. J Zhejiang Univ Sci C 14(11):815\u2013821. https:\/\/doi.org\/10.1631\/jzus.C1300184","journal-title":"J Zhejiang Univ Sci C"},{"key":"412_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.118812","volume":"213","author":"P Kalatzantonakis","year":"2023","unstructured":"Kalatzantonakis P, Sifaleras A, Samaras N (2023) A reinforcement learning-variable neighborhood search method for the capacitated vehicle routing problem. Expert Syst Appl 213:118812","journal-title":"Expert Syst Appl"},{"issue":"2","key":"412_CR28","doi-asserted-by":"publisher","first-page":"87","DOI":"10.3390\/a17020087","volume":"17","author":"GKB Souza","year":"2024","unstructured":"Souza GKB, Santos SOS, Ottoni ALC, Oliveira MS, Oliveira DCR, Nepomuceno EG (2024) Transfer reinforcement learning for combinatorial optimization problems. Algorithms 17(2):87","journal-title":"Algorithms"},{"key":"412_CR29","doi-asserted-by":"publisher","DOI":"10.1002\/9780470496916","volume-title":"Metaheuristics from design to implementation","author":"E-G Talbi","year":"2009","unstructured":"Talbi E-G (2009) Metaheuristics from design to implementation, vol 74. Wiley, Hoboken"},{"key":"412_CR30","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/B978-0-12-821986-7.00011-1","volume-title":"Nature-inspired optimization algorithms (Second Edition)","author":"X-S Yang","year":"2021","unstructured":"Yang X-S (2021) Chapter 4 - Random Walks and Optimization. In: Yang X-S (ed) Nature-inspired optimization algorithms (Second Edition). Academic Press, Cambridge, pp 63\u201381"},{"key":"412_CR31","unstructured":"Christofides N (1979) The vehicle routing problem. Combinatorial optimization, p. 315\u2013318."},{"key":"412_CR32","unstructured":"Golden, B.L., E.A. Wasil, J.P. Kelly, and I.M. Chao (1998) Metaheuristics in vehicle routing, Fleet management and logistics, TG Crainic and G. Laporte. Kluwer, Boston."},{"key":"412_CR33","unstructured":"Loggi Benchmark for Urban Deliveries: https:\/\/github.com\/loggi\/loggibud"},{"key":"412_CR34","unstructured":"Oliver, I.M., D. Smith, and J.R.C. Holland (1987) Study of permutation crossover operators on the traveling salesman problem. Hillsdale, NJ: L. Erlhaum Associates"},{"key":"412_CR35","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1023\/A:1011375326814","volume":"7","author":"E Cant\u00fa-Paz","year":"2001","unstructured":"Cant\u00fa-Paz E (2001) Migration policies, selection pressure, and parallel evolutionary algorithms. J Heuristics 7:311\u2013334","journal-title":"J Heuristics"},{"key":"412_CR36","doi-asserted-by":"crossref","unstructured":"Branke, J., Kamper, A., & Schmeck, H (2004) Distribution of evolutionary algorithms in heterogeneous networks. In: Genetic and Evolutionary Computation\u2013GECCO 2004: Genetic and Evolutionary Computation. 2004. Seattle, WA, USA: Springer Berlin Heidelberg.","DOI":"10.1007\/978-3-540-24854-5_93"},{"key":"412_CR37","doi-asserted-by":"publisher","unstructured":"Atashpaz-Gargari, E. and C. Lucas (2007) Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition. In: 2007 IEEE Congress on Evolutionary Computation. https:\/\/doi.org\/10.1109\/CEC.2007.4425083","DOI":"10.1109\/CEC.2007.4425083"},{"key":"412_CR38","unstructured":"CPU Benchmark: https:\/\/www.cpubenchmark.net\/compare\/Intel-i5-4590T-vs-Intel-Xeon-Gold-6148"},{"key":"412_CR39","unstructured":"CVRPLIB website: http:\/\/vrp.atd-lab.inf.puc-rio.br\/index.php\/en\/"},{"key":"412_CR40","unstructured":"DIMACS: http:\/\/dimacs.rutgers.edu\/programs\/challenge\/vrp\/cvrp\/"},{"key":"412_CR41","unstructured":"Google OR-Tools: https:\/\/developers.google.com\/optimization\/routing"},{"key":"412_CR42","doi-asserted-by":"publisher","unstructured":"Student, The probable error of a mean. Biometrika, 1908: p. 1\u201325. https:\/\/doi.org\/10.2307\/2331554.","DOI":"10.2307\/2331554"},{"issue":"3","key":"412_CR43","doi-asserted-by":"publisher","first-page":"119","DOI":"10.2307\/3001946","volume":"3","author":"F Wilcoxon","year":"1947","unstructured":"Wilcoxon F (1947) Probability tables for individual comparisons by ranking methods. Biometrics 3(3):119\u2013122. https:\/\/doi.org\/10.2307\/3001946","journal-title":"Biometrics"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-024-00412-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12293-024-00412-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-024-00412-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,27]],"date-time":"2024-06-27T14:44:58Z","timestamp":1719499498000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12293-024-00412-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6]]},"references-count":43,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["412"],"URL":"https:\/\/doi.org\/10.1007\/s12293-024-00412-8","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6]]},"assertion":[{"value":"17 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 June 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}