{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T07:13:16Z","timestamp":1763536396033,"version":"3.41.0"},"reference-count":81,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T00:00:00Z","timestamp":1748304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T00:00:00Z","timestamp":1748304000000},"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":["Evol. Intel."],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s12065-025-01048-4","type":"journal-article","created":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T08:43:25Z","timestamp":1748335405000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Novel hybrid swarm intelligence algorithm for solving the capacitated vehicle routing problem efficiently"],"prefix":"10.1007","volume":"18","author":[{"given":"Vu Hong Son","family":"Pham","sequence":"first","affiliation":[]},{"given":"Van Nam","family":"Nguyen","sequence":"additional","affiliation":[]},{"given":"Nghiep Trinh Nguyen","family":"Dang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,27]]},"reference":[{"issue":"4","key":"1048_CR1","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1287\/trsc.1090.0301","volume":"43","author":"G Laporte","year":"2009","unstructured":"Laporte G (2009) Fifty years of vehicle routing. Transp Sci 43(4):408\u2013416","journal-title":"Transp Sci"},{"key":"1048_CR2","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.cie.2015.12.007","volume":"99","author":"K Braekers","year":"2016","unstructured":"Braekers K, Ramaekers K, Van Nieuwenhuyse I (2016) The vehicle routing problem: state of the art classification and review. Comput Ind Eng 99:300\u2013313","journal-title":"Comput Ind Eng"},{"issue":"12","key":"1048_CR3","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","journal-title":"Comput Oper Res"},{"key":"1048_CR4","doi-asserted-by":"crossref","unstructured":"Pham, V.H.S., V.N. Nguyen, and N.T. Nguyen Dang, Hybrid whale optimization algorithm for enhanced routing of limited capacity vehicles in supply chain management. Scientific Reports, 2024. 14(1): p. 793.","DOI":"10.1038\/s41598-024-51359-2"},{"issue":"8","key":"1048_CR5","doi-asserted-by":"publisher","first-page":"1232","DOI":"10.1016\/j.trb.2011.02.004","volume":"45","author":"T Bekta\u015f","year":"2011","unstructured":"Bekta\u015f T, Laporte G (2011) The pollution-routing problem. Trans Res Part B 45(8):1232\u20131250","journal-title":"Trans Res Part B"},{"issue":"6","key":"1048_CR6","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1108\/MEQ-08-2013-0086","volume":"25","author":"S MirHassani","year":"2014","unstructured":"MirHassani S, Mohammadyari S (2014) Reduction of carbon emissions in VRP by gravitational search algorithm. Manage Environ Quality 25(6):766\u2013782","journal-title":"Manage Environ Quality"},{"issue":"2","key":"1048_CR7","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1002\/net.3230110211","volume":"11","author":"JK Lenstra","year":"1981","unstructured":"Lenstra JK, Kan AR (1981) Complexity of vehicle routing and scheduling problems. Networks 11(2):221\u2013227","journal-title":"Networks"},{"issue":"1","key":"1048_CR8","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.cie.2012.01.005","volume":"65","author":"FP Goksal","year":"2013","unstructured":"Goksal FP, Karaoglan I, Altiparmak F (2013) A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery. Comput Ind Eng 65(1):39\u201353","journal-title":"Comput Ind Eng"},{"issue":"1","key":"1048_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2014.07.048","volume":"241","author":"R Lahyani","year":"2015","unstructured":"Lahyani R, Khemakhem M, Semet F (2015) Rich vehicle routing problems: From a taxonomy to a definition. Eur J Oper Res 241(1):1\u201314","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1048_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2013.02.053","volume":"231","author":"T Vidal","year":"2013","unstructured":"Vidal T et al (2013) Heuristics for multi-attribute vehicle routing problems: a survey and synthesis. Eur J Oper Res 231(1):1\u201321","journal-title":"Eur J Oper Res"},{"key":"1048_CR11","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/1045343.1045373","volume":"63","author":"JH Holland","year":"1977","unstructured":"Holland JH, Reitman JS (1977) Cognitive systems based on adaptive algorithms. Acm Sigart Bulletin 63:49\u201349","journal-title":"Acm Sigart Bulletin"},{"issue":"5","key":"1048_CR12","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1007\/BF01009452","volume":"34","author":"S Kirkpatrick","year":"1984","unstructured":"Kirkpatrick S (1984) Optimization by simulated annealing: quantitative studies. J Stat Phys 34(5):975\u2013986","journal-title":"J Stat Phys"},{"key":"1048_CR13","doi-asserted-by":"publisher","first-page":"20764","DOI":"10.1109\/ACCESS.2022.3152062","volume":"10","author":"FY Vincent","year":"2022","unstructured":"Vincent FY et al (2022) A simulated annealing algorithm for the vehicle routing problem with parcel lockers. IEEE Access 10:20764\u201320782","journal-title":"IEEE Access"},{"key":"1048_CR14","doi-asserted-by":"crossref","unstructured":"Cordeau J-F, Laporte G, Tabu search heuristics for the vehicle routing problem. 2005: Springer.","DOI":"10.1287\/trsc.1050.0120"},{"issue":"3","key":"1048_CR15","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F (1989) Tabu search\u2014part I. ORSA J Comput 1(3):190\u2013206","journal-title":"ORSA J Comput"},{"issue":"4","key":"1048_CR16","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/S0305-0548(03)00014-5","volume":"31","author":"M Reimann","year":"2004","unstructured":"Reimann M, Doerner K, Hartl RF (2004) D-ants: savings based ants divide and conquer the vehicle routing problem. Comput Oper Res 31(4):563\u2013591","journal-title":"Comput Oper Res"},{"issue":"4","key":"1048_CR17","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/MCI.2006.329691","volume":"1","author":"M Dorigo","year":"2006","unstructured":"Dorigo M, Birattari M, Stutzle T (2006) Ant colony optimization. IEEE Comput Intell Mag 1(4):28\u201339","journal-title":"IEEE Comput Intell Mag"},{"key":"1048_CR18","doi-asserted-by":"crossref","unstructured":"Pham VHS, Nguyen Dang NT, Nguyen VN (2024) Achieving improved performance in construction projects: Advanced time and cost optimization framework. Evol Intell. 17(4): 2885\u20132897.","DOI":"10.1007\/s12065-024-00918-7"},{"key":"1048_CR19","doi-asserted-by":"crossref","unstructured":"Pham VHS, Nguyen Dang NT, Nam NV (2024) Optimizing time and cost in construction projects with a hybridized multi-verse optimizer and opposition-based learning. Engineering, Construction and Architectural Management.","DOI":"10.1108\/ECAM-07-2023-0672"},{"key":"1048_CR20","doi-asserted-by":"crossref","unstructured":"Pham VHS, Nguyen DNT, VN and Nguyen (2025) Advanced vehicle routing in cement distribution: a discrete Salp Swarm Algorithm approach. Int J Manage Sci Eng Manage 20(1): 1\u201313.","DOI":"10.1080\/17509653.2024.2324172"},{"key":"1048_CR21","doi-asserted-by":"crossref","unstructured":"Pham VHS, Nguyen Dang NT, Nguyen VN (2024) Enhancing engineering optimization using hybrid sine cosine algorithm with Roulette wheel selection and opposition-based learning. Sci Rep 14(1): 694.","DOI":"10.1038\/s41598-024-51343-w"},{"key":"1048_CR22","doi-asserted-by":"crossref","unstructured":"Pham VHS, Nguyen VN Cement transport vehicle routing problem with hybrid sine cosine optimization algorithm in construction management. In: The International Conference on Sustainable Civil Engineering and Architecture. 2023. Springer.","DOI":"10.1007\/978-981-99-7434-4_42"},{"key":"1048_CR23","doi-asserted-by":"crossref","unstructured":"Pham VHS, Nguyen Dang NT, Nguyen VN (2024) Geometric mean optimizer for achieving efficiency in truss structural design. Evol Intell. 17(4): 2453\u20132466.","DOI":"10.1007\/s12065-023-00895-3"},{"key":"1048_CR24","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69:46\u201361","journal-title":"Adv Eng Softw"},{"issue":"2","key":"1048_CR25","doi-asserted-by":"publisher","first-page":"997","DOI":"10.1007\/s00500-019-03939-y","volume":"24","author":"W Long","year":"2020","unstructured":"Long W et al (2020) An efficient and robust grey wolf optimizer algorithm for large-scale numerical optimization. Soft Comput 24(2):997\u20131026","journal-title":"Soft Comput"},{"key":"1048_CR26","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.advengsoft.2016.01.008","volume":"95","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S, Lewis A (2016) The whale optimization algorithm. Adv Eng Softw 95:51\u201367","journal-title":"Adv Eng Softw"},{"issue":"7","key":"1048_CR27","doi-asserted-by":"publisher","first-page":"4113","DOI":"10.1007\/s11831-023-09928-7","volume":"30","author":"MH Nadimi-Shahraki","year":"2023","unstructured":"Nadimi-Shahraki MH et al (2023) A systematic review of the whale optimization algorithm: theoretical foundation, improvements, and hybridizations. Arch Comput Methods Engx 30(7):4113\u20134159","journal-title":"Arch Comput Methods Engx"},{"key":"1048_CR28","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.tcs.2022.05.031","volume":"927","author":"MAR Khan","year":"2022","unstructured":"Khan MAR et al (2022) Optimizing hybrid metaheuristic algorithm with cluster head to improve performance metrics on the IoT. Theoret Comput Sci 927:87\u201397","journal-title":"Theoret Comput Sci"},{"key":"1048_CR29","doi-asserted-by":"publisher","first-page":"3665","DOI":"10.1007\/s00366-020-01025-8","volume":"37","author":"Z Wang","year":"2021","unstructured":"Wang Z, Luo Q, Zhou Y (2021) Hybrid metaheuristic algorithm using butterfly and flower pollination base on mutualism mechanism for global optimization problems. Eng Comput 37:3665\u20133698","journal-title":"Eng Comput"},{"key":"1048_CR30","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s13042-020-01165-9","volume":"12","author":"Z Li","year":"2021","unstructured":"Li Z et al (2021) A hybrid grey wolf optimizer for solving the product knapsack problem. Int J Mach Learn Cybern 12:201\u2013222","journal-title":"Int J Mach Learn Cybern"},{"key":"1048_CR31","volume":"25","author":"VHS Pham","year":"2025","unstructured":"Pham VHS, Nguyen VN, Dang NTN (2025) Innovative hybrid algorithm for efficient routing of limited capacity vehicles. Intell Syst Appl 25:200491","journal-title":"Intell Syst Appl"},{"key":"1048_CR32","doi-asserted-by":"crossref","unstructured":"Toth P, Vigo D (2002) The vehicle routing problem. SIAM.","DOI":"10.1137\/1.9780898718515"},{"issue":"2","key":"1048_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2666003","volume":"47","author":"J Caceres-Cruz","year":"2014","unstructured":"Caceres-Cruz J et al (2014) Rich vehicle routing problem: survey. ACM Comput Surveys (CSUR) 47(2):1\u201328","journal-title":"ACM Comput Surveys (CSUR)"},{"issue":"2","key":"1048_CR34","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1016\/j.ejor.2005.08.015","volume":"176","author":"B Crevier","year":"2007","unstructured":"Crevier B, Cordeau J-F, Laporte G (2007) The multi-depot vehicle routing problem with inter-depot routes. Eur J Oper Res 176(2):756\u2013773","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1048_CR35","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1287\/trsc.29.1.17","volume":"29","author":"MW Savelsbergh","year":"1995","unstructured":"Savelsbergh MW, Sol M (1995) The general pickup and delivery problem. Transp Sci 29(1):17\u201329","journal-title":"Transp Sci"},{"issue":"4","key":"1048_CR36","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1016\/j.eswa.2013.07.107","volume":"41","author":"C Lin","year":"2014","unstructured":"Lin C et al (2014) Survey of green vehicle routing problem: past and future trends. Expert Syst Appl 41(4):1118\u20131138","journal-title":"Expert Syst Appl"},{"issue":"1","key":"1048_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2011.07.037","volume":"218","author":"R Baldacci","year":"2012","unstructured":"Baldacci R, Mingozzi A, Roberti R (2012) Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. Eur J Oper Res 218(1):1\u20136","journal-title":"Eur J Oper Res"},{"key":"1048_CR38","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2019.106242","volume":"140","author":"R Elshaer","year":"2020","unstructured":"Elshaer R, Awad H (2020) A taxonomic review of metaheuristic algorithms for solving the vehicle routing problem and its variants. Comput Ind Eng 140:106242","journal-title":"Comput Ind Eng"},{"issue":"3","key":"1048_CR39","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1287\/opre.1120.1048","volume":"60","author":"T Vidal","year":"2012","unstructured":"Vidal T et al (2012) A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Oper Res 60(3):611\u2013624","journal-title":"Oper Res"},{"issue":"2","key":"1048_CR40","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s11768-022-00091-1","volume":"20","author":"Q Liu","year":"2022","unstructured":"Liu Q et al (2022) A hybrid genetic algorithm for the electric vehicle routing problem with time windows. Control Theory Technol 20(2):279\u2013286","journal-title":"Control Theory Technol"},{"issue":"10","key":"1048_CR41","doi-asserted-by":"publisher","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","volume":"40","author":"M Gendreau","year":"1994","unstructured":"Gendreau M, Hertz A, Laporte G (1994) A tabu search heuristic for the vehicle routing problem. Manage Sci 40(10):1276\u20131290","journal-title":"Manage Sci"},{"issue":"2","key":"1048_CR42","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF02579017","volume":"10","author":"O Br\u00e4ysy","year":"2002","unstructured":"Br\u00e4ysy O, Gendreau M (2002) Tabu search heuristics for the vehicle routing problem with time windows. TOP 10(2):211\u2013237","journal-title":"TOP"},{"key":"1048_CR43","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s10732-014-9247-0","volume":"20","author":"JW Escobar","year":"2014","unstructured":"Escobar JW et al (2014) A hybrid granular tabu search algorithm for the multi-depot vehicle routing problem. J Heuristics 20:483\u2013509","journal-title":"J Heuristics"},{"key":"1048_CR44","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"IH Osman","year":"1993","unstructured":"Osman IH (1993) Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann Oper Res 41:421\u2013451","journal-title":"Ann Oper Res"},{"issue":"1","key":"1048_CR45","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.ejor.2008.02.028","volume":"196","author":"B Yu","year":"2009","unstructured":"Yu B, Yang Z-Z, Yao B (2009) An improved ant colony optimization for vehicle routing problem. Eur J Oper Res 196(1):171\u2013176","journal-title":"Eur J Oper Res"},{"key":"1048_CR46","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100675","volume":"55","author":"Y Wang","year":"2020","unstructured":"Wang Y et al (2020) An improved ant colony optimization algorithm to the periodic vehicle routing problem with time window and service choice. Swarm Evol Comput 55:100675","journal-title":"Swarm Evol Comput"},{"issue":"2","key":"1048_CR47","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/s11047-020-09783-6","volume":"19","author":"P Stodola","year":"2020","unstructured":"Stodola P (2020) Hybrid ant colony optimization algorithm applied to the multi-depot vehicle routing problem. Nat Comput 19(2):463\u2013475","journal-title":"Nat Comput"},{"key":"1048_CR48","unstructured":"Kennedy, J. and R. Eberhart. Particle swarm optimization. In: Proceedings of ICNN'95-international conference on neural networks. 1995. IEEE."},{"issue":"5","key":"1048_CR49","doi-asserted-by":"publisher","first-page":"1693","DOI":"10.1016\/j.cor.2008.04.003","volume":"36","author":"TJ Ai","year":"2009","unstructured":"Ai TJ, Kachitvichyanukul V (2009) A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery. Comput Oper Res 36(5):1693\u20131702","journal-title":"Comput Oper Res"},{"issue":"4","key":"1048_CR50","doi-asserted-by":"publisher","first-page":"1693","DOI":"10.1016\/j.asoc.2013.01.007","volume":"13","author":"Y Marinakis","year":"2013","unstructured":"Marinakis Y, Iordanidou G-R, Marinaki M (2013) Particle swarm optimization for the vehicle routing problem with stochastic demands. Appl Soft Comput 13(4):1693\u20131704","journal-title":"Appl Soft Comput"},{"issue":"02","key":"1048_CR51","doi-asserted-by":"publisher","first-page":"1840006","DOI":"10.1142\/S0217595918400067","volume":"35","author":"J Shi","year":"2018","unstructured":"Shi J et al (2018) Particle swarm optimization for split delivery vehicle routing problem. Asia-Pacific J Oper Res 35(02):1840006","journal-title":"Asia-Pacific J Oper Res"},{"key":"1048_CR52","first-page":"2728039","volume":"2023","author":"VHS Pham","year":"2023","unstructured":"Pham VHS, Nguyen VN (2023) Cement transport vehicle routing with a hybrid sine cosine optimization algorithm. Adv Civ Eng 2023:2728039","journal-title":"Adv Civ Eng"},{"key":"1048_CR53","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100730","volume":"58","author":"NR Sabar","year":"2020","unstructured":"Sabar NR et al (2020) An adaptive memetic approach for heterogeneous vehicle routing problems with two-dimensional loading constraints. Swarm Evol Comput 58:100730","journal-title":"Swarm Evol Comput"},{"key":"1048_CR54","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.trd.2014.05.015","volume":"31","author":"S Zhang","year":"2014","unstructured":"Zhang S et al (2014) Design and development of a hybrid artificial bee colony algorithm for the environmental vehicle routing problem. Transp Res Part D 31:85\u201399","journal-title":"Transp Res Part D"},{"key":"1048_CR55","doi-asserted-by":"crossref","unstructured":"Son Pham VH, Nguyen Dang NT, Nguyen VN (2024) Advancing large-scale cement vehicle distribution: the modified salp swarm algorithm. Int J Syst Sci. 11(1): 2305817.","DOI":"10.1080\/23302674.2024.2305817"},{"key":"1048_CR56","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106561","volume":"95","author":"M-X Song","year":"2020","unstructured":"Song M-X et al (2020) Metaheuristics for solving the vehicle routing problem with the time windows and energy consumption in cold chain logistics. Appl Soft Comput 95:106561","journal-title":"Appl Soft Comput"},{"issue":"6","key":"1048_CR57","doi-asserted-by":"publisher","first-page":"916","DOI":"10.1016\/j.engappai.2008.10.006","volume":"22","author":"C Prins","year":"2009","unstructured":"Prins C (2009) Two memetic algorithms for heterogeneous fleet vehicle routing problems. Eng Appl Artif Intell 22(6):916\u2013928","journal-title":"Eng Appl Artif Intell"},{"key":"1048_CR58","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.eswa.2016.01.038","volume":"53","author":"M Avci","year":"2016","unstructured":"Avci M, Topaloglu S (2016) A hybrid metaheuristic algorithm for heterogeneous vehicle routing problem with simultaneous pickup and delivery. Expert Syst Appl 53:160\u2013171","journal-title":"Expert Syst Appl"},{"key":"1048_CR59","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107655","volume":"110","author":"MA Islam","year":"2021","unstructured":"Islam MA, Gajpal Y, ElMekkawy TY (2021) Hybrid particle swarm optimization algorithm for solving the clustered vehicle routing problem. Appl Soft Comput 110:107655","journal-title":"Appl Soft Comput"},{"issue":"2","key":"1048_CR60","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/j.ejor.2021.04.032","volume":"296","author":"M Karimi-Mamaghan","year":"2022","unstructured":"Karimi-Mamaghan M et al (2022) Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art. Eur J Oper Res 296(2):393\u2013422","journal-title":"Eur J Oper Res"},{"issue":"11","key":"1048_CR61","doi-asserted-by":"publisher","first-page":"10307","DOI":"10.1109\/TVT.2018.2868942","volume":"67","author":"Y Yao","year":"2018","unstructured":"Yao Y, Peng Z, Xiao B (2018) Parallel hyper-heuristic algorithm for multi-objective route planning in a smart city. IEEE Trans Veh Technol 67(11):10307\u201310318","journal-title":"IEEE Trans Veh Technol"},{"key":"1048_CR62","doi-asserted-by":"publisher","first-page":"101622","DOI":"10.1109\/ACCESS.2022.3208899","volume":"10","author":"S Sabet","year":"2022","unstructured":"Sabet S, Farooq B (2022) Green vehicle routing problem: state of the art and future directions. IEEE Access 10:101622\u2013101642","journal-title":"IEEE Access"},{"issue":"2","key":"1048_CR63","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1080\/23249935.2018.1523249","volume":"15","author":"A Baykaso\u011flu","year":"2019","unstructured":"Baykaso\u011flu A et al (2019) A review of fleet planning problems in single and multimodal transportation systems. Transportmetrica A 15(2):631\u2013697","journal-title":"Transportmetrica A"},{"issue":"1","key":"1048_CR64","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2012.08.015","volume":"225","author":"V Pillac","year":"2013","unstructured":"Pillac V et al (2013) A review of dynamic vehicle routing problems. Eur J Oper Res 225(1):1\u201311","journal-title":"Eur J Oper Res"},{"issue":"5","key":"1048_CR65","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1016\/j.trc.2009.12.006","volume":"19","author":"C Archetti","year":"2011","unstructured":"Archetti C et al (2011) Complexity of the VRP and SDVRP. Trans Res Part C 19(5):741\u2013750","journal-title":"Trans Res Part C"},{"key":"1048_CR66","doi-asserted-by":"crossref","unstructured":"Shan Q, Wang J Solve Capacitated Vehicle Routing Problem Using Hybrid Chaotic Particle Swarm Optimization. In: 2013 Sixth International Symposium on Computational Intelligence and Design. 2013.","DOI":"10.1109\/ISCID.2013.218"},{"issue":"6","key":"1048_CR67","first-page":"1586","volume":"20","author":"N Singh","year":"2017","unstructured":"Singh N, Singh S (2017) A novel hybrid GWO-SCA approach for optimization problems. Eng Sci Technol Int J 20(6):1586\u20131601","journal-title":"Eng Sci Technol Int J"},{"key":"1048_CR68","unstructured":"Tizhoosh HR Opposition-based learning: a new scheme for machine intelligence. in International conference on computational intelligence for modelling, control and automation and international conference on intelligent agents, web technologies and internet commerce (CIMCA-IAWTIC'06). 2005. IEEE."},{"issue":"2","key":"1048_CR69","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/s00607-024-01397-5","volume":"107","author":"E Cuevas","year":"2025","unstructured":"Cuevas E, Barba O, Escobar H (2025) A novel cheetah optimizer hybrid approach based on opposition-based learning (OBL) and diversity metrics. Computing 107(2):62","journal-title":"Computing"},{"issue":"1","key":"1048_CR70","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s12559-025-10415-3","volume":"17","author":"T Kundu","year":"2025","unstructured":"Kundu T, Garg H (2025) An Adaptive neural network algorithm with quasi opposition-based learning for numerical optimization problems. Cogn Comput 17(1):55","journal-title":"Cogn Comput"},{"issue":"1","key":"1048_CR71","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s13042-024-02222-3","volume":"16","author":"A Qtaish","year":"2025","unstructured":"Qtaish A et al (2025) Enhanced coati optimization algorithm using elite opposition-based learning and adaptive search mechanism for feature selection. Int J Mach Learn Cybern 16(1):361\u2013394","journal-title":"Int J Mach Learn Cybern"},{"key":"1048_CR72","doi-asserted-by":"crossref","unstructured":"Anita S, Chamoli, Yadav A (2025) An oppositional learning and chaotic local search-based artificial electric field algorithm for engineering optimization. Evolutionary Intelligence. 18(2): p. 41.","DOI":"10.1007\/s12065-025-01025-x"},{"key":"1048_CR73","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2024.120522","volume":"668","author":"B Chen","year":"2024","unstructured":"Chen B et al (2024) Differential evolution algorithm with a complementary mutation strategy and data fusion-based parameter adaptation. Inf Sci 668:120522","journal-title":"Inf Sci"},{"key":"1048_CR74","doi-asserted-by":"crossref","unstructured":"Dong J, et al. (2024) An Optimization numerical spiking neural membrane system with adaptive multi-mutation operators for brain tumor segmentation. Int J Neural Syst: 2450036\u20132450036.","DOI":"10.1142\/S0129065724500369"},{"key":"1048_CR75","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.109280","volume":"251","author":"S Gupta","year":"2022","unstructured":"Gupta S, Su R (2022) An efficient differential evolution with fitness-based dynamic mutation strategy and control parameters. Knowl-Based Syst 251:109280","journal-title":"Knowl-Based Syst"},{"key":"1048_CR76","unstructured":"Abhishek Kumar KVP, Wagdy Mohamed A, Hadi AA, Suganthan PN, Problem Definitions and Evaluation Criteria for the 2022 Special Session and Competition on Single Objective Bound Constrained Numerical Optimization. 2021, Nanyang Technological University."},{"issue":"6","key":"1048_CR77","first-page":"48","volume":"13","author":"Z Wang","year":"2004","unstructured":"Wang Z et al (2004) A hybrid optimization algorithm solving vehicle routing problems. Oper Res Manage Sci 13(6):48\u201352","journal-title":"Oper Res Manage Sci"},{"issue":"4","key":"1048_CR78","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1631\/jzus.2006.A0607","volume":"7","author":"A-L Chen","year":"2006","unstructured":"Chen A-L, Yang G-K, Wu Z-M (2006) Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem. J Zhejiang Univ-Sci A 7(4):607\u2013614","journal-title":"J Zhejiang Univ-Sci A"},{"issue":"5","key":"1048_CR79","first-page":"2574","volume":"219","author":"RJ Kuo","year":"2012","unstructured":"Kuo RJ, Zulvia FE, Suryadi K (2012) Hybrid particle swarm optimization with genetic algorithm for solving capacitated vehicle routing problem with fuzzy demand\u2014a case study on garbage collection system. Appl Math Comput 219(5):2574\u20132588","journal-title":"Appl Math Comput"},{"key":"1048_CR80","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.wasman.2017.01.022","volume":"61","author":"M Akhtar","year":"2017","unstructured":"Akhtar M et al (2017) Backtracking search algorithm in CVRP models for efficient solid waste collection and route optimization. Waste Manage 61:117\u2013128","journal-title":"Waste Manage"},{"key":"1048_CR81","doi-asserted-by":"publisher","first-page":"1573","DOI":"10.1007\/978-1-4419-1153-7_1068","volume":"1","author":"KL Hoffman","year":"2013","unstructured":"Hoffman KL, Padberg M, Rinaldi G (2013) Traveling salesman problem. Encyclopedia Oper Res Manag Sci 1:1573\u20131578","journal-title":"Encyclopedia Oper Res Manag Sci"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-025-01048-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12065-025-01048-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-025-01048-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T06:01:43Z","timestamp":1750917703000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12065-025-01048-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,27]]},"references-count":81,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["1048"],"URL":"https:\/\/doi.org\/10.1007\/s12065-025-01048-4","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"type":"print","value":"1864-5909"},{"type":"electronic","value":"1864-5917"}],"subject":[],"published":{"date-parts":[[2025,5,27]]},"assertion":[{"value":"16 September 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 March 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 April 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 May 2025","order":4,"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 that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"61"}}