{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T13:43:07Z","timestamp":1762522987580,"version":"3.41.0"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"16","license":[{"start":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T00:00:00Z","timestamp":1741219200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T00:00:00Z","timestamp":1741219200000},"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":["Neural Comput & Applic"],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s00521-025-11048-1","type":"journal-article","created":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T13:49:35Z","timestamp":1741268975000},"page":"9639-9668","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Stepwise monogamous pairing genetic algorithm method applied to a multi-depot vehicle routing problem with time windows"],"prefix":"10.1007","volume":"37","author":[{"given":"Ting Yee","family":"Lim","sequence":"first","affiliation":[]},{"given":"Xin Ju","family":"Ng","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1748-1544","authenticated-orcid":false,"given":"Choo Jun","family":"Tan","sequence":"additional","affiliation":[]},{"given":"Chee Peng","family":"Lim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,6]]},"reference":[{"key":"11048_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108389","volume":"171","author":"Y Shi","year":"2022","unstructured":"Shi Y, Lin Y, Li B, YiMan Li R (2022) A bi-objective optimization model for the medical supplies\u2019 simultaneous pickup and delivery with drones. Comput Indust Eng 171:108389. https:\/\/doi.org\/10.1016\/j.cie.2022.108389","journal-title":"Comput Indust Eng"},{"issue":"7","key":"11048_CR2","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1177\/03611981231223287","volume":"2678","author":"K Sun","year":"2024","unstructured":"Sun K, Gu Y, Ma KWF, Zheng C, Wu F (2024) Medical supplies delivery route optimization under public health emergencies incorporating metro-based logistics system. Transp Res Rec 2678(7):111\u2013131. https:\/\/doi.org\/10.1177\/03611981231223287","journal-title":"Transp Res Rec"},{"issue":"7553","key":"11048_CR3","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1038\/nature14544","volume":"521","author":"AE Eiben","year":"2015","unstructured":"Eiben AE, Smith J (2015) From evolutionary computation to the evolution of things. Nature 521(7553):476\u2013482. https:\/\/doi.org\/10.1038\/nature14544","journal-title":"Nature"},{"key":"11048_CR4","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.ins.2023.01.120","volume":"629","author":"C Li","year":"2023","unstructured":"Li C, Sun G, Deng L, Qiao L, Yang G (2023) A population state evaluation-based improvement framework for differential evolution. Inform Sci 629:15\u201338. https:\/\/doi.org\/10.1016\/j.ins.2023.01.120","journal-title":"Inform Sci"},{"key":"11048_CR5","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.ins.2022.11.106","volume":"622","author":"Y Li","year":"2023","unstructured":"Li Y, Wang S, Yang H, Chen H, Yang B (2023) Enhancing differential evolution algorithm using leader-adjoint populations. Inform Sci 622:235\u2013268. https:\/\/doi.org\/10.1016\/j.ins.2022.11.106","journal-title":"Inform Sci"},{"key":"11048_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.119656","volume":"649","author":"Z Cai","year":"2023","unstructured":"Cai Z, Yang X, Zhou M, Zhan Z-H, Gao S (2023) Toward explicit control between exploration and exploitation in evolutionary algorithms: a case study of differential evolution. Inform Sci 649:119656. https:\/\/doi.org\/10.1016\/j.ins.2023.119656","journal-title":"Inform Sci"},{"issue":"3","key":"11048_CR7","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1109\/MCI.2013.2264563","volume":"8","author":"T Chai","year":"2013","unstructured":"Chai T, Jin Y, Sendhoff B (2013) Evolutionary complex engineering optimization: opportunities and challenges [guest editorial]. IEEE Comput Intell Mag 8(3):12\u201315. https:\/\/doi.org\/10.1109\/MCI.2013.2264563","journal-title":"IEEE Comput Intell Mag"},{"key":"11048_CR8","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10462-021-10042-y","volume":"55","author":"Z-H Zhan","year":"2022","unstructured":"Zhan Z-H, Shi L, Tan KC, Zhang J (2022) A survey on evolutionary computation for complex continuous optimization. Artif Intell Rev 55:59\u2013110. https:\/\/doi.org\/10.1007\/s10462-021-10042-y","journal-title":"Artif Intell Rev"},{"key":"11048_CR9","doi-asserted-by":"publisher","unstructured":"Potter MA, De\u00a0Jong KA (1994) A cooperative coevolutionary approach to function optimization. In: Davidor Y, Schwefel H-P, M\u00e4nner R (eds.) Parallel problem solving from nature\u2014PPSN III, pp. 249\u2013257. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/3-540-58484-6_269","DOI":"10.1007\/3-540-58484-6_269"},{"issue":"3\u20134","key":"11048_CR10","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1177\/105971239700500305","volume":"5","author":"F Gomez","year":"1997","unstructured":"Gomez F, Miikkulainen R (1997) Incremental evolution of complex general behavior. Adapt Behav 5(3\u20134):317\u2013342. https:\/\/doi.org\/10.1177\/105971239700500305","journal-title":"Adapt Behav"},{"key":"11048_CR11","doi-asserted-by":"publisher","unstructured":"Lim TY, Al-Betar MA, Khader AT (2015) Monogamous pair bonding in genetic algorithm. In: 2015 IEEE congress on evolutionary computation (CEC), pp. 15\u201322 (2015). https:\/\/doi.org\/10.1109\/CEC.2015.7256869","DOI":"10.1109\/CEC.2015.7256869"},{"key":"11048_CR12","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/j.amc.2014.12.030","volume":"252","author":"TY Lim","year":"2015","unstructured":"Lim TY, Al-Betar MA, Khader AT (2015) Adaptive pair bonds in genetic algorithm: an application to real-parameter optimization. Appl Math Comput 252:503\u2013519. https:\/\/doi.org\/10.1016\/j.amc.2014.12.030","journal-title":"Appl Math Comput"},{"key":"11048_CR13","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.eswa.2016.01.055","volume":"54","author":"TY Lim","year":"2016","unstructured":"Lim TY, Al-Betar MA, Khader AT (2016) Taming the 0\/1 knapsack problem with monogamous pairs genetic algorithm. Expert Syst Appl 54:241\u2013250. https:\/\/doi.org\/10.1016\/j.eswa.2016.01.055","journal-title":"Expert Syst Appl"},{"key":"11048_CR14","doi-asserted-by":"publisher","unstructured":"Tizhoosh HR (2005) 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\u201906), vol. 1, pp. 695\u2013701. https:\/\/doi.org\/10.1109\/CIMCA.2005.1631345","DOI":"10.1109\/CIMCA.2005.1631345"},{"issue":"1","key":"11048_CR15","doi-asserted-by":"publisher","first-page":"3209","DOI":"10.1038\/s41598-018-19996-6","volume":"8","author":"J Rodriguez","year":"2018","unstructured":"Rodriguez J, Jones TH, Sierwald P, Marek PE, Shear WA, Brewer MS, Kocot KM, Bond JE (2018) Step-wise evolution of complex chemical defenses in millipedes: a phylogenomic approach. Sci Rep 8(1):3209. https:\/\/doi.org\/10.1038\/s41598-018-19996-6","journal-title":"Sci Rep"},{"issue":"1","key":"11048_CR16","doi-asserted-by":"publisher","first-page":"11607","DOI":"10.1038\/ncomms11607","volume":"7","author":"B Szappanos","year":"2016","unstructured":"Szappanos B, Fritzemeier J, Cs\u00f6rg\u0151 B, L\u00e1z\u00e1r V, Lu X, Fekete G, B\u00e1lint B, Herczeg R, Nagy I, Notebaart RA et al (2016) Adaptive evolution of complex innovations through stepwise metabolic niche expansion. Nat Commun 7(1):11607. https:\/\/doi.org\/10.1038\/ncomms11607","journal-title":"Nat Commun"},{"issue":"6936","key":"11048_CR17","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1038\/nature01568","volume":"423","author":"RE Lenski","year":"2003","unstructured":"Lenski RE, Ofria C, Pennock RT, Adami C (2003) The evolutionary origin of complex features. Nature 423(6936):139\u2013144. https:\/\/doi.org\/10.1038\/nature01568","journal-title":"Nature"},{"issue":"2","key":"11048_CR18","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1162\/evco_a_00301","volume":"30","author":"J Huizinga","year":"2022","unstructured":"Huizinga J, Clune J (2022) Evolving multimodal robot behavior via many stepping stones with the combinatorial multiobjective evolutionary algorithm. Evol Comput 30(2):131\u2013164. https:\/\/doi.org\/10.1162\/evco_a_00301","journal-title":"Evol Comput"},{"issue":"8","key":"11048_CR19","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1002\/nav.20261","volume":"54","author":"G Laporte","year":"2007","unstructured":"Laporte G (2007) What you should know about the vehicle routing problem. Nav Res Logist 54(8):811\u2013819. https:\/\/doi.org\/10.1002\/nav.20261","journal-title":"Nav Res Logist"},{"key":"11048_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2020.101866","volume":"135","author":"L Zhen","year":"2020","unstructured":"Zhen L, Ma C, Wang K, Xiao L, Zhang W (2020) Multi-depot multi-trip vehicle routing problem with time windows and release dates. Transport Res Part E: Logist Transport Rev 135:101866. https:\/\/doi.org\/10.1016\/j.tre.2020.101866","journal-title":"Transport Res Part E: Logist Transport Rev"},{"issue":"5","key":"11048_CR21","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1057\/palgrave.jors.2601707","volume":"55","author":"J-F Cordeau","year":"2004","unstructured":"Cordeau J-F, Laporte G, Mercier A (2004) Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows. J Operat Res Soc 55(5):542\u2013546. https:\/\/doi.org\/10.1057\/palgrave.jors.2601707","journal-title":"J Operat Res Soc"},{"issue":"1","key":"11048_CR22","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"},{"issue":"3","key":"11048_CR23","doi-asserted-by":"publisher","first-page":"2033","DOI":"10.1007\/s12351-020-00600-7","volume":"22","author":"GD Konstantakopoulos","year":"2022","unstructured":"Konstantakopoulos GD, Gayialis SP, Kechagias EP (2022) Vehicle routing problem and related algorithms for logistics distribution: a literature review and classification. Oper Res Int J 22(3):2033\u20132062. https:\/\/doi.org\/10.1007\/s12351-020-00600-7","journal-title":"Oper Res Int J"},{"issue":"8","key":"11048_CR24","doi-asserted-by":"publisher","first-page":"928","DOI":"10.1057\/palgrave.jors.2601163","volume":"52","author":"J-F Cordeau","year":"2001","unstructured":"Cordeau J-F, Laporte G, Mercier A (2001) A unified tabu search heuristic for vehicle routing problems with time windows. J Oper Res Soc 52(8):928\u2013936. https:\/\/doi.org\/10.1057\/palgrave.jors.2601163","journal-title":"J Oper Res Soc"},{"issue":"9","key":"11048_CR25","doi-asserted-by":"publisher","first-page":"2033","DOI":"10.1016\/j.cor.2011.09.021","volume":"39","author":"J-F Cordeau","year":"2012","unstructured":"Cordeau J-F, Maischberger M (2012) A parallel iterated tabu search heuristic for vehicle routing problems. Comput Oper Res 39(9):2033\u20132050. https:\/\/doi.org\/10.1016\/j.cor.2011.09.021","journal-title":"Comput Oper Res"},{"key":"11048_CR26","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/s10732-005-5432-5","volume":"10","author":"M Polacek","year":"2004","unstructured":"Polacek M, Hartl RF, Doerner K, Reimann M (2004) A variable neighborhood search for the multi depot vehicle routing problem with time windows. J Heurist 10:613\u2013627. https:\/\/doi.org\/10.1007\/s10732-005-5432-5","journal-title":"J Heurist"},{"key":"11048_CR27","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF03343534","volume":"1","author":"M Polacek","year":"2008","unstructured":"Polacek M, Benkner S, Doerner KF, Hartl RF (2008) A cooperative and adaptive variable neighborhood search for the multi depot vehicle routing problem with time windows. Business Res 1:207\u2013218. https:\/\/doi.org\/10.1007\/BF03343534","journal-title":"Business Res"},{"key":"11048_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105269","volume":"133","author":"MEH Sadati","year":"2021","unstructured":"Sadati MEH, \u00c7atay B, Aksen D (2021) An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems. Comput Oper Res 133:105269. https:\/\/doi.org\/10.1016\/j.cor.2021.105269","journal-title":"Comput Oper Res"},{"issue":"1","key":"11048_CR29","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/j.cor.2012.07.018","volume":"40","author":"T Vidal","year":"2013","unstructured":"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\u2013489. https:\/\/doi.org\/10.1016\/j.cor.2012.07.018","journal-title":"Comput Oper Res"},{"key":"11048_CR30","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.cie.2014.03.004","volume":"72","author":"J Luo","year":"2014","unstructured":"Luo J, Chen M-R (2014) Multi-phase modified shuffled frog leaping algorithm with extremal optimization for the mdvrp and the mdvrptw. Comput Indust Eng 72:84\u201397. https:\/\/doi.org\/10.1016\/j.cie.2014.03.004","journal-title":"Comput Indust Eng"},{"key":"11048_CR31","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.comcom.2022.04.005","volume":"190","author":"R Yesodha","year":"2022","unstructured":"Yesodha R, Amudha T (2022) A bio-inspired approach: firefly algorithm for multi-depot vehicle routing problem with time windows. Comput Commun 190:48\u201356. https:\/\/doi.org\/10.1016\/j.comcom.2022.04.005","journal-title":"Comput Commun"},{"key":"11048_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.124608","volume":"255","author":"AA Jolfaei","year":"2024","unstructured":"Jolfaei AA, Alinaghian M (2024) Multi-depot vehicle routing problem with roaming delivery locations considering hard time windows: solved by a hybrid els-lns algorithm. Expert Syst Appl 255:124608. https:\/\/doi.org\/10.1016\/j.eswa.2024.124608","journal-title":"Expert Syst Appl"},{"key":"11048_CR33","doi-asserted-by":"publisher","unstructured":"Shi, Y-J, Teng H-F, Li Z-Q (2005) Cooperative co-evolutionary differential evolution for function optimization. In: Wang L, Chen K, Ong YS (eds.) Advances in natural computation, pp. 1080\u20131088. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/11539117_147","DOI":"10.1007\/11539117_147"},{"key":"11048_CR34","doi-asserted-by":"publisher","unstructured":"Li L, Fang W, Wang Q, Sun J (2019) Differential grouping with spectral clustering for large scale global optimization. In: 2019 IEEE congress on evolutionary computation (CEC), pp. 334\u2013341. https:\/\/doi.org\/10.1109\/CEC.2019.8790056","DOI":"10.1109\/CEC.2019.8790056"},{"key":"11048_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.jngse.2020.103695","volume":"85","author":"K Biswas","year":"2021","unstructured":"Biswas K, Vasant PM, Gamez Vintaned JA, Watada J (2021) Cellular automata-based multi-objective hybrid grey wolf optimization and particle swarm optimization algorithm for wellbore trajectory optimization. J Natural Gas Sci Eng 85:103695. https:\/\/doi.org\/10.1016\/j.jngse.2020.103695","journal-title":"J Natural Gas Sci Eng"},{"issue":"6","key":"11048_CR36","doi-asserted-by":"publisher","first-page":"3702","DOI":"10.1109\/TCYB.2021.3120788","volume":"53","author":"X Ma","year":"2023","unstructured":"Ma X, Huang Z, Li X, Qi Y, Wang L, Zhu Z (2023) Multiobjectivization of single-objective optimization in evolutionary computation: a survey. IEEE Transact Cybernet 53(6):3702\u20133715. https:\/\/doi.org\/10.1109\/TCYB.2021.3120788","journal-title":"IEEE Transact Cybernet"},{"issue":"4","key":"11048_CR37","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1109\/TEVC.2010.2093579","volume":"15","author":"HK Singh","year":"2011","unstructured":"Singh HK, Isaacs A, Ray T (2011) A pareto corner search evolutionary algorithm and dimensionality reduction in many-objective optimization problems. IEEE Trans Evol Comput 15(4):539\u2013556. https:\/\/doi.org\/10.1109\/TEVC.2010.2093579","journal-title":"IEEE Trans Evol Comput"},{"issue":"12","key":"11048_CR38","doi-asserted-by":"publisher","first-page":"13654","DOI":"10.1109\/TCYB.2021.3082200","volume":"52","author":"S-C Liu","year":"2022","unstructured":"Liu S-C, Zhan Z-H, Tan KC, Zhang J (2022) A multiobjective framework for many-objective optimization. IEEE Transact Cybernet 52(12):13654\u201313668. https:\/\/doi.org\/10.1109\/TCYB.2021.3082200","journal-title":"IEEE Transact Cybernet"},{"key":"11048_CR39","doi-asserted-by":"publisher","first-page":"117699","DOI":"10.1109\/ACCESS.2019.2931742","volume":"7","author":"M Xiong","year":"2019","unstructured":"Xiong M, Xiong W, Liu C (2019) A hybrid many-objective evolutionary algorithm with region preference for decision makers. IEEE Access 7:117699\u2013117715. https:\/\/doi.org\/10.1109\/ACCESS.2019.2931742","journal-title":"IEEE Access"},{"key":"11048_CR40","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10696-018-9323-0","volume":"31","author":"R Liu","year":"2019","unstructured":"Liu R, Jiang Z (2019) A constraint relaxation-based algorithm for the load-dependent vehicle routing problem with time windows. Flex Serv Manuf J 31:331\u2013353. https:\/\/doi.org\/10.1007\/s10696-018-9323-0","journal-title":"Flex Serv Manuf J"},{"issue":"3","key":"11048_CR41","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"},{"key":"11048_CR42","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.121511","volume":"237","author":"M Song","year":"2024","unstructured":"Song M, Cheng L, Lu B (2024) Solving the multi-compartment vehicle routing problem by an augmented Lagrangian relaxation method. Expert Syst Appl 237:121511. https:\/\/doi.org\/10.1016\/j.eswa.2023.121511","journal-title":"Expert Syst Appl"},{"issue":"3","key":"11048_CR43","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1109\/TCYB.2015.2409837","volume":"46","author":"J Wang","year":"2016","unstructured":"Wang J, Zhou Y, Wang Y, Zhang J, Chen CLP, Zheng Z (2016) Multiobjective vehicle routing problems with simultaneous delivery and pickup and time windows: Formulation, instances, and algorithms. IEEE Transact Cybernet 46(3):582\u2013594. https:\/\/doi.org\/10.1109\/TCYB.2015.2409837","journal-title":"IEEE Transact Cybernet"},{"key":"11048_CR44","doi-asserted-by":"publisher","unstructured":"Lewis MA, Fagg AH, Bekey GA (1993) Genetic algorithms for gait synthesis in a hexapod robot. In: Recent trends in mobile robots, pp. 317\u2013331. https:\/\/doi.org\/10.1142\/9789814354301_0011","DOI":"10.1142\/9789814354301_0011"},{"key":"11048_CR45","doi-asserted-by":"publisher","unstructured":"Nolfi S, Parisi D (1995) Evolving non-trivial behaviors on real robots: an autonomous robot that picks up objects. In: Gori M, Soda G (eds.) Topics in artificial intelligence, pp. 243\u2013254. Springer, Berlin, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60437-5_24","DOI":"10.1007\/3-540-60437-5_24"},{"key":"11048_CR46","doi-asserted-by":"publisher","unstructured":"Larsen T, Hansen ST (2005) Evolving composite robot behaviour\u2013a modular architecture. In: Proceedings of the fifth international workshop on robot motion and control, 2005. RoMoCo \u201905., pp. 271\u2013276. https:\/\/doi.org\/10.1109\/ROMOCO.2005.201435","DOI":"10.1109\/ROMOCO.2005.201435"},{"key":"11048_CR47","doi-asserted-by":"publisher","unstructured":"Mouret J-B, Doncieux S (2008) Incremental evolution of animats\u2019 behaviors as a multi-objective optimization. In: Asada M, Hallam JCT, Meyer J-A, Tani J (eds.) From animals to animats 10, pp. 210\u2013219. Springer, Berlin, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-69134-1_21","DOI":"10.1007\/978-3-540-69134-1_21"},{"key":"11048_CR48","doi-asserted-by":"publisher","unstructured":"Wang X, Xu C, Shang H (2008) Multi-depot vehicle routing problem with time windows and multi-type vehicle number limits and its genetic algorithm. In: 2008 4th international conference on wireless communications, networking and mobile computing, pp. 1\u20135. https:\/\/doi.org\/10.1109\/WiCom.2008.1502","DOI":"10.1109\/WiCom.2008.1502"},{"issue":"6","key":"11048_CR49","doi-asserted-by":"publisher","first-page":"5945","DOI":"10.1109\/TVT.2020.2979637","volume":"69","author":"V Hassija","year":"2020","unstructured":"Hassija V, Saxena V, Chamola V, Yu FR (2020) A parking slot allocation framework based on virtual voting and adaptive pricing algorithm. IEEE Trans Veh Technol 69(6):5945\u20135957. https:\/\/doi.org\/10.1109\/TVT.2020.2979637","journal-title":"IEEE Trans Veh Technol"},{"issue":"8","key":"11048_CR50","doi-asserted-by":"publisher","first-page":"9757","DOI":"10.1109\/TVT.2023.3254604","volume":"72","author":"A Andreou","year":"2023","unstructured":"Andreou A, Mavromoustakis CX, Batalla JM, Markakis EK, Mastorakis G, Mumtaz S (2023) UAV trajectory optimisation in smart cities using modified A* algorithm combined with haversine and vincenty formulas. IEEE Trans Veh Technol 72(8):9757\u20139769. https:\/\/doi.org\/10.1109\/TVT.2023.3254604","journal-title":"IEEE Trans Veh Technol"},{"key":"11048_CR51","doi-asserted-by":"publisher","first-page":"112206","DOI":"10.1109\/ACCESS.2021.3103640","volume":"9","author":"H Lim","year":"2021","unstructured":"Lim H, Lee GM, Singgih IK (2021) Multi-depot split-delivery vehicle routing problem. IEEE Access 9:112206\u2013112220. https:\/\/doi.org\/10.1109\/ACCESS.2021.3103640","journal-title":"IEEE Access"},{"issue":"1","key":"11048_CR52","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/TEVC.2007.894200","volume":"12","author":"S Rahnamayan","year":"2008","unstructured":"Rahnamayan S, Tizhoosh HR, Salama MMA (2008) Opposition-based differential evolution. IEEE Trans Evol Comput 12(1):64\u201379. https:\/\/doi.org\/10.1109\/TEVC.2007.894200","journal-title":"IEEE Trans Evol Comput"},{"key":"11048_CR53","doi-asserted-by":"publisher","unstructured":"Forrest S, Mitchell M (1993) Relative building-block fitness and the building-block hypothesis. In: WHITLEY LD (ed.) Foundations of genetic algorithms. foundations of genetic algorithms, vol. 2, pp. 109\u2013126. https:\/\/doi.org\/10.1016\/B978-0-08-094832-4.50013-1","DOI":"10.1016\/B978-0-08-094832-4.50013-1"},{"key":"11048_CR54","doi-asserted-by":"publisher","unstructured":"Morrison RW, De\u00a0Jong KA (2002) Measurement of population diversity. In: Collet P, Fonlupt C, Hao J-K, Lutton E, Schoenauer M (eds.) Artificial evolution, pp. 31\u201341. Springer, Berlin, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46033-0_3","DOI":"10.1007\/3-540-46033-0_3"},{"key":"11048_CR55","doi-asserted-by":"publisher","unstructured":"Wang R, Lehman J, Clune J, Stanley KO (2019) POET: open-ended coevolution of environments and their optimized solutions. In: Proceedings of the genetic and evolutionary computation conference, pp. 142\u2013151. https:\/\/doi.org\/10.1145\/3321707.3321799","DOI":"10.1145\/3321707.3321799"},{"key":"11048_CR56","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2022) Introduction to algorithms. MIT Press (2022)"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-025-11048-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-025-11048-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-025-11048-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T07:07:38Z","timestamp":1748329658000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-025-11048-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,6]]},"references-count":56,"journal-issue":{"issue":"16","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["11048"],"URL":"https:\/\/doi.org\/10.1007\/s00521-025-11048-1","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"type":"print","value":"0941-0643"},{"type":"electronic","value":"1433-3058"}],"subject":[],"published":{"date-parts":[[2025,3,6]]},"assertion":[{"value":"24 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}