{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T16:39:17Z","timestamp":1776357557332,"version":"3.51.2"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T00:00:00Z","timestamp":1749772800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T00:00:00Z","timestamp":1749772800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1007\/s40747-025-01920-x","type":"journal-article","created":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T04:27:59Z","timestamp":1749788879000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An efficient hybrid framework with knowledge transfer for solving capacitated vehicle routing problems"],"prefix":"10.1007","volume":"11","author":[{"given":"Yanlin","family":"Wu","sequence":"first","affiliation":[]},{"given":"Yanguang","family":"Cai","sequence":"additional","affiliation":[]},{"given":"Chuncheng","family":"Fang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,13]]},"reference":[{"issue":"1","key":"1920_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. Manag Sci 6(1):80\u201391. https:\/\/doi.org\/10.1287\/mnsc.6.1.80","journal-title":"Manag Sci"},{"issue":"1","key":"1920_CR2","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.ejor.2023.06.021","volume":"312","author":"J Jiang","year":"2024","unstructured":"Jiang J, Dai Y, Yang F, Ma Z (2024) A multi-visit flexible-docking vehicle routing problem with drones for simultaneous pickup and delivery services. Eur J Oper Res 312(1):125\u2013137. https:\/\/doi.org\/10.1016\/j.ejor.2023.06.021","journal-title":"Eur J Oper Res"},{"key":"1920_CR3","doi-asserted-by":"publisher","first-page":"102263","DOI":"10.1016\/j.tre.2021.102263","volume":"148","author":"SS \u00d6zar\u0131k","year":"2021","unstructured":"\u00d6zar\u0131k SS, Veelenturf LP, Van Woensel T, Laporte G (2021) Optimizing e-commerce last-mile vehicle routing and scheduling under uncertain customer presence. Transp Res Part E Logist Transp Rev 148:102263. https:\/\/doi.org\/10.1016\/j.tre.2021.102263","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"1920_CR4","doi-asserted-by":"publisher","first-page":"102949","DOI":"10.1016\/j.trb.2024.102949","volume":"184","author":"JA Nasir","year":"2024","unstructured":"Nasir JA, Kuo Y-H (2024) Stochastic home care transportation with dynamically prioritized patients: an integrated facility location, fleet sizing, and routing approach. Transp Res Part B Methodol 184:102949. https:\/\/doi.org\/10.1016\/j.trb.2024.102949","journal-title":"Transp Res Part B Methodol"},{"key":"1920_CR5","doi-asserted-by":"publisher","first-page":"104188","DOI":"10.1016\/j.engappai.2021.104188","volume":"100","author":"F Goodarzian","year":"2021","unstructured":"Goodarzian F, Taleizadeh AA, Ghasemi P, Abraham A (2021) An integrated sustainable medical supply chain network during COVID-19. Eng Appl Artif Intell 100:104188. https:\/\/doi.org\/10.1016\/j.engappai.2021.104188","journal-title":"Eng Appl Artif Intell"},{"key":"1920_CR6","doi-asserted-by":"publisher","first-page":"100611","DOI":"10.1016\/j.jii.2024.100611","volume":"40","author":"G Rahmanifar","year":"2024","unstructured":"Rahmanifar G, Mohammadi M, Hajiaghaei-Keshteli M, Fusco G, Colombaroni C (2024) An integrated temporal and spatial synchronization for two-echelon vehicle routing problem in waste collection system. J Ind Inf Integr 40:100611. https:\/\/doi.org\/10.1016\/j.jii.2024.100611","journal-title":"J Ind Inf Integr"},{"key":"1920_CR7","doi-asserted-by":"publisher","first-page":"3345","DOI":"10.1109\/TASE.2024.3393507","volume":"22","author":"G Tresca","year":"2025","unstructured":"Tresca G, Salem H, Cavone G, Zgaya-Biau H, Ben-Othman S, Hammadi S, Dotoli M (2025) A metaheuristic approach for delivery planning and dynamic vehicle routing in logistics 4.0. IEEE Trans Autom Sci Eng 22:3345\u20133365. https:\/\/doi.org\/10.1109\/TASE.2024.3393507","journal-title":"IEEE Trans Autom Sci Eng"},{"issue":"4","key":"1920_CR8","doi-asserted-by":"publisher","first-page":"1472","DOI":"10.1016\/j.cie.2009.05.009","volume":"57","author":"B Eksioglu","year":"2009","unstructured":"Eksioglu B, Vural AV, Reisman A (2009) The vehicle routing problem: a taxonomic review. Comput Ind Eng 57(4):1472\u20131483. https:\/\/doi.org\/10.1016\/j.cie.2009.05.009","journal-title":"Comput Ind Eng"},{"key":"1920_CR9","doi-asserted-by":"publisher","first-page":"107989","DOI":"10.1016\/j.resconrec.2024.107989","volume":"212","author":"L Luo","year":"2025","unstructured":"Luo L, Wu X, Hu J, Dong X, Wang H (2025) Assessing the environmental and economic impacts of intracity express delivery: pathways for carbon reduction and cost efficiency in China. Resour Conserv Recycl 212:107989. https:\/\/doi.org\/10.1016\/j.resconrec.2024.107989","journal-title":"Resour Conserv Recycl"},{"key":"1920_CR10","doi-asserted-by":"publisher","first-page":"117619","DOI":"10.1016\/j.jclepro.2019.117619","volume":"236","author":"P He","year":"2019","unstructured":"He P, Li J, Fang E, deVoil P, Cao G (2019) Reducing agricultural fuel consumption by minimizing inefficiencies. J Clean Prod 236:117619. https:\/\/doi.org\/10.1016\/j.jclepro.2019.117619","journal-title":"J Clean Prod"},{"key":"1920_CR11","doi-asserted-by":"publisher","first-page":"104437","DOI":"10.1016\/j.trc.2023.104437","volume":"158","author":"R Shahin","year":"2024","unstructured":"Shahin R, Hosteins P, Pellegrini P, Vandanjon P-O, Quadrifoglio L (2024) A survey of flex-route transit problem and its link with vehicle routing problem. Transp Res Part C Emerg Technol 158:104437. https:\/\/doi.org\/10.1016\/j.trc.2023.104437","journal-title":"Transp Res Part C Emerg Technol"},{"key":"1920_CR12","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s10107-005-0644-x","volume":"106","author":"R Fukasawa","year":"2006","unstructured":"Fukasawa R, Longo H, Lysgaard J, Arag\u00e3o MP, Reis M, Uchoa E, Werneck RF (2006) Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math Program 106:491\u2013511. https:\/\/doi.org\/10.1007\/s10107-005-0644-x","journal-title":"Math Program"},{"key":"1920_CR13","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s11831-021-09574-x","volume":"29","author":"H Zhang","year":"2022","unstructured":"Zhang H, Ge H, Yang J, Tong Y (2022) Review of vehicle routing problems: models, classification and solving algorithms. Arch Comput Methods Eng 29:195\u2013221. https:\/\/doi.org\/10.1007\/s11831-021-09574-x","journal-title":"Arch Comput Methods Eng"},{"key":"1920_CR14","doi-asserted-by":"publisher","first-page":"101245","DOI":"10.1016\/j.swevo.2023.101245","volume":"77","author":"IP Souza","year":"2023","unstructured":"Souza IP, Boeres MCS, Moraes REN (2023) A robust algorithm based on differential evolution with local search for the capacitated vehicle routing problem. Swarm Evol Comput 77:101245. https:\/\/doi.org\/10.1016\/j.swevo.2023.101245","journal-title":"Swarm Evol Comput"},{"key":"1920_CR15","doi-asserted-by":"publisher","first-page":"115556","DOI":"10.1016\/j.eswa.2021.115556","volume":"184","author":"AM Machado","year":"2021","unstructured":"Machado AM, Mauri GR, Boeres MCS, Alvarenga Rosa R (2021) A new hybrid metaheuristic of grasp and VNS based on constructive heuristics, set-covering and set-partitioning formulations applied to the capacitated vehicle routing problem. Expert Syst Appl 184:115556. https:\/\/doi.org\/10.1016\/j.eswa.2021.115556","journal-title":"Expert Syst Appl"},{"issue":"3","key":"1920_CR16","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1109\/TEVC.2015.2458037","volume":"20","author":"A Gupta","year":"2016","unstructured":"Gupta A, Ong Y-S, Feng L (2016) Multifactorial evolution: toward evolutionary multitasking. IEEE Trans Evol Comput 20(3):343\u2013357. https:\/\/doi.org\/10.1109\/TEVC.2015.2458037","journal-title":"IEEE Trans Evol Comput"},{"key":"1920_CR17","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s12293-021-00352-7","volume":"14","author":"Q Shang","year":"2022","unstructured":"Shang Q, Huang Y, Wang Y, Li M, Feng L (2022) Solving vehicle routing problem by memetic search with evolutionary multitasking. Memet Comput 14:31\u201344. https:\/\/doi.org\/10.1007\/s12293-021-00352-7","journal-title":"Memet Comput"},{"key":"1920_CR18","doi-asserted-by":"publisher","first-page":"121600","DOI":"10.1016\/j.eswa.2023.121600","volume":"237","author":"Y Cai","year":"2024","unstructured":"Cai Y, Wu Y, Fang C (2024) Double-assistant evolutionary multitasking algorithm for enhanced electric vehicle routing with backup batteries and battery swapping stations. Expert Syst Appl 237:121600. https:\/\/doi.org\/10.1016\/j.eswa.2023.121600","journal-title":"Expert Syst Appl"},{"issue":"3","key":"1920_CR19","doi-asserted-by":"publisher","first-page":"2400","DOI":"10.1109\/TASE.2023.3326315","volume":"21","author":"J Li","year":"2024","unstructured":"Li J, Cai J, Sun T, Zhu Q, Lin Q (2024) Multitask-based evolutionary optimization for vehicle routing problems in autonomous transportation. IEEE Trans Autom Sci Eng 21(3):2400\u20132411. https:\/\/doi.org\/10.1109\/TASE.2023.3326315","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"1920_CR20","doi-asserted-by":"publisher","first-page":"110780","DOI":"10.1016\/j.asoc.2023.110780","volume":"147","author":"H Lv","year":"2023","unstructured":"Lv H, Liu R (2023) Multitasking evolutionary algorithm based on adaptive seed transfer for combinatorial problem. Appl Soft Comput 147:110780. https:\/\/doi.org\/10.1016\/j.asoc.2023.110780","journal-title":"Appl Soft Comput"},{"issue":"4","key":"1920_CR21","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":"9","key":"1920_CR22","doi-asserted-by":"publisher","first-page":"5404","DOI":"10.1109\/TSMC.2023.3270308","volume":"53","author":"Y Huang","year":"2023","unstructured":"Huang Y, Feng L, Li M, Wang Y, Zhu Z, Tan KC (2023) Fast vehicle routing via knowledge transfer in a reproducing kernel Hilbert space. IEEE Trans Syst Man Cybern Syst 53(9):5404\u20135416. https:\/\/doi.org\/10.1109\/TSMC.2023.3270308","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"1920_CR23","doi-asserted-by":"publisher","first-page":"110605","DOI":"10.1016\/j.asoc.2023.110605","volume":"145","author":"Y Wu","year":"2023","unstructured":"Wu Y, Cai Y, Fang C (2023) Evolutionary multitasking for bidirectional adaptive codec: a case study on vehicle routing problem with time windows. Appl Soft Comput 145:110605. https:\/\/doi.org\/10.1016\/j.asoc.2023.110605","journal-title":"Appl Soft Comput"},{"key":"1920_CR24","doi-asserted-by":"publisher","first-page":"118812","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. https:\/\/doi.org\/10.1016\/j.eswa.2022.118812","journal-title":"Expert Syst Appl"},{"issue":"1","key":"1920_CR25","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0167-6377(91)90083-2","volume":"10","author":"M Desrochers","year":"1991","unstructured":"Desrochers M, Laporte G (1991) Improvements and extensions to the Miller\u2013Tucker\u2013Zemlin subtour elimination constraints. Oper Res Lett 10(1):27\u201336. https:\/\/doi.org\/10.1016\/0167-6377(91)90083-2","journal-title":"Oper Res Lett"},{"issue":"6","key":"1920_CR26","doi-asserted-by":"publisher","first-page":"1823","DOI":"10.1016\/j.cor.2004.11.020","volume":"33","author":"H Longo","year":"2006","unstructured":"Longo H, De Aragao MP, Uchoa E (2006) Solving capacitated ARC routing problems using a transformation to the CVRP. Comput Oper Res 33(6):1823\u20131837. https:\/\/doi.org\/10.1016\/j.cor.2004.11.020","journal-title":"Comput Oper Res"},{"key":"1920_CR27","doi-asserted-by":"publisher","unstructured":"Mohammed MA, Ahmad MS, Mostafa SA (2012) Using genetic algorithm in implementing capacitated vehicle routing problem. In: 2012 International conference on computer & information science (ICCIS), vol 1. IEEE, pp 257\u2013262. https:\/\/doi.org\/10.1109\/ICCISci.2012.6297250","DOI":"10.1109\/ICCISci.2012.6297250"},{"issue":"7","key":"1920_CR28","doi-asserted-by":"publisher","first-page":"1419","DOI":"10.1016\/j.cor.2011.08.013","volume":"39","author":"Y Xiao","year":"2012","unstructured":"Xiao Y, Zhao Q, Kaku I, Xu Y (2012) Development of a fuel consumption optimization model for the capacitated vehicle routing problem. Comput Oper Res 39(7):1419\u20131431. https:\/\/doi.org\/10.1016\/j.cor.2011.08.013","journal-title":"Comput Oper Res"},{"issue":"3","key":"1920_CR29","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1016\/j.ejor.2013.08.032","volume":"236","author":"J Lysgaard","year":"2014","unstructured":"Lysgaard J, W\u00f8hlk S (2014) A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem. Eur J Oper Res 236(3):800\u2013810. https:\/\/doi.org\/10.1016\/j.ejor.2013.08.032","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1920_CR30","doi-asserted-by":"publisher","first-page":"1995658","DOI":"10.1080\/08839514.2021.1995658","volume":"36","author":"F Alesiani","year":"2022","unstructured":"Alesiani F, Ermis G, Gkiotsalitis K (2022) Constrained clustering for the capacitated vehicle routing problem (CC-CVRP). Appl Artif Intell 36(1):1995658. https:\/\/doi.org\/10.1080\/08839514.2021.1995658","journal-title":"Appl Artif Intell"},{"key":"1920_CR31","doi-asserted-by":"publisher","first-page":"108431","DOI":"10.1016\/j.asoc.2022.108431","volume":"117","author":"H Jiang","year":"2022","unstructured":"Jiang H, Lu M, Tian Y, Qiu J, Zhang X (2022) An evolutionary algorithm for solving capacitated vehicle routing problems by using local information. Appl Soft Comput 117:108431. https:\/\/doi.org\/10.1016\/j.asoc.2022.108431","journal-title":"Appl Soft Comput"},{"key":"1920_CR32","doi-asserted-by":"publisher","first-page":"8745","DOI":"10.1007\/s00500-022-07198-2","volume":"26","author":"J Cai","year":"2022","unstructured":"Cai J, Wang P, Sun S, Dong H (2022) A dynamic space reduction ant colony optimization for capacitated vehicle routing problem. Soft Comput 26:8745\u20138756. https:\/\/doi.org\/10.1007\/s00500-022-07198-2","journal-title":"Soft Comput"},{"key":"1920_CR33","doi-asserted-by":"publisher","first-page":"108505","DOI":"10.1016\/j.cie.2022.108505","volume":"171","author":"M K\u00fc\u00e7\u00fck","year":"2022","unstructured":"K\u00fc\u00e7\u00fck M, Yildiz ST (2022) Constraint programming-based solution approaches for three-dimensional loading capacitated vehicle routing problems. Comput Ind Eng 171:108505. https:\/\/doi.org\/10.1016\/j.cie.2022.108505","journal-title":"Comput Ind Eng"},{"key":"1920_CR34","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 22:507\u2013549. https:\/\/doi.org\/10.1007\/s12351-019-00543-8","journal-title":"Oper Res"},{"key":"1920_CR35","doi-asserted-by":"publisher","first-page":"110309","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":"1920_CR36","doi-asserted-by":"publisher","first-page":"16019","DOI":"10.1007\/s00500-023-08888-1","volume":"27","author":"VP Singh","year":"2023","unstructured":"Singh VP, Sharma K, Chakraborty D (2023) Solving capacitated vehicle routing problem with demands as fuzzy random variable. Soft Comput 27:16019\u201316039. https:\/\/doi.org\/10.1007\/s00500-023-08888-1","journal-title":"Soft Comput"},{"key":"1920_CR37","doi-asserted-by":"publisher","first-page":"103208","DOI":"10.1016\/j.tre.2023.103208","volume":"176","author":"J Chi","year":"2023","unstructured":"Chi J, He S (2023) Pickup capacitated vehicle routing problem with three-dimensional loading constraints: model and algorithms. Transp Res Part E Logist Transp Rev 176:103208. https:\/\/doi.org\/10.1016\/j.tre.2023.103208","journal-title":"Transp Res Part E Logist Transp Rev"},{"issue":"2","key":"1920_CR38","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1287\/opre.2021.0669","volume":"72","author":"S Ghosal","year":"2023","unstructured":"Ghosal S, Ho CP, Wiesemann W (2023) A unifying framework for the capacitated vehicle routing problem under risk and ambiguity. Oper Res 72(2):425\u2013443. https:\/\/doi.org\/10.1287\/opre.2021.0669","journal-title":"Oper Res"},{"issue":"1","key":"1920_CR39","doi-asserted-by":"publisher","first-page":"2339385","DOI":"10.1080\/23302674.2024.2339385","volume":"11","author":"MH Rahman","year":"2024","unstructured":"Rahman MH, Menezes BC, Al Amin M (2024) Determination of optimal depot location for a capacitated vehicle routing problem (CVRP) based on gross vehicle weight. Int J Syst Sci Oper Logist 11(1):2339385. https:\/\/doi.org\/10.1080\/23302674.2024.2339385","journal-title":"Int J Syst Sci Oper Logist"},{"issue":"3","key":"1920_CR40","doi-asserted-by":"publisher","first-page":"836","DOI":"10.1016\/j.ejor.2023.10.042","volume":"314","author":"R Bernardino","year":"2024","unstructured":"Bernardino R, Paias A (2024) The family capacitated vehicle routing problem. Eur J Oper Res 314(3):836\u2013853. https:\/\/doi.org\/10.1016\/j.ejor.2023.10.042","journal-title":"Eur J Oper Res"},{"key":"1920_CR41","doi-asserted-by":"publisher","first-page":"101529","DOI":"10.1016\/j.swevo.2024.101529","volume":"86","author":"J Li","year":"2024","unstructured":"Li J, Liu R, Wang R (2024) Handling dynamic capacitated vehicle routing problems based on adaptive genetic algorithm with elastic strategy. Swarm Evol Comput 86:101529. https:\/\/doi.org\/10.1016\/j.swevo.2024.101529","journal-title":"Swarm Evol Comput"},{"issue":"2","key":"1920_CR42","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1109\/TEVC.2024.3361910","volume":"29","author":"Y Zou","year":"2025","unstructured":"Zou Y, Hao J-K, Wu Q (2025) A two-individual evolutionary algorithm for cumulative capacitated vehicle routing with single and multiple depots. IEEE Trans Evol Comput 29(2):505\u2013518. https:\/\/doi.org\/10.1109\/TEVC.2024.3361910","journal-title":"IEEE Trans Evol Comput"},{"key":"1920_CR43","doi-asserted-by":"publisher","unstructured":"Yuan Y, Ong Y-S, Gupta A, Tan PS, Xu H (2016) Evolutionary multitasking in permutation-based combinatorial optimization problems: realization with TSP, QAP, LOP, and JSP. In: 2016 IEEE region 10 conference (TENCON). IEEE, pp 3157\u20133164. https:\/\/doi.org\/10.1109\/TENCON.2016.7848632","DOI":"10.1109\/TENCON.2016.7848632"},{"key":"1920_CR44","doi-asserted-by":"publisher","unstructured":"Zhou L, Feng L, Zhong J, Ong Y-S, Zhu Z, Sha E (2016) Evolutionary multitasking in combinatorial search spaces: a case study in capacitated vehicle routing problem. In: 2016 IEEE symposium series on computational intelligence (SSCI). IEEE, pp 1\u20138. https:\/\/doi.org\/10.1109\/SSCI.2016.7850039","DOI":"10.1109\/SSCI.2016.7850039"},{"key":"1920_CR45","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1016\/j.cie.2019.02.031","volume":"130","author":"A Rauniyar","year":"2019","unstructured":"Rauniyar A, Nath R, Muhuri PK (2019) Multi-factorial evolutionary algorithm based novel solution approach for multi-objective pollution-routing problem. Comput Ind Eng 130:757\u2013771. https:\/\/doi.org\/10.1016\/j.cie.2019.02.031","journal-title":"Comput Ind Eng"},{"key":"1920_CR46","doi-asserted-by":"publisher","unstructured":"Osaba E, Martinez AD, Lobo JL, La\u00f1a I, Del\u00a0Ser J (2020) On the transferability of knowledge among vehicle routing problems by using cellular evolutionary multitasking. In: 2020 IEEE 23rd international conference on intelligent transportation systems (ITSC). IEEE, pp 1\u20138. https:\/\/doi.org\/10.1109\/ITSC45102.2020.9294497","DOI":"10.1109\/ITSC45102.2020.9294497"},{"issue":"6","key":"1920_CR47","doi-asserted-by":"publisher","first-page":"3171","DOI":"10.1109\/TCYB.2019.2955599","volume":"51","author":"L Feng","year":"2021","unstructured":"Feng L, Zhou L, Gupta A, Zhong J, Zhu Z, Tan K-C, Qin K (2021) Solving generalized vehicle routing problem with occasional drivers via evolutionary multitasking. IEEE Trans Cybern 51(6):3171\u20133184. https:\/\/doi.org\/10.1109\/TCYB.2019.2955599","journal-title":"IEEE Trans Cybern"},{"key":"1920_CR48","doi-asserted-by":"publisher","unstructured":"Feng L, Huang Y, Zhou L, Zhong J, Gupta A, Tang K, Tan KC (2021) Explicit evolutionary multitasking for combinatorial optimization: a case study on capacitated vehicle routing problem. IEEE Trans Cybern 51(6):3143\u20133156. https:\/\/doi.org\/10.1109\/TCYB.2019.2962865","DOI":"10.1109\/TCYB.2019.2962865"},{"key":"1920_CR49","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.ins.2022.08.103","volume":"612","author":"Y Cai","year":"2022","unstructured":"Cai Y, Cheng M, Zhou Y, Liu P, Guo J-M (2022) A hybrid evolutionary multitask algorithm for the multiobjective vehicle routing problem with time windows. Inf Sci 612:168\u2013187. https:\/\/doi.org\/10.1016\/j.ins.2022.08.103","journal-title":"Inf Sci"},{"issue":"2","key":"1920_CR50","doi-asserted-by":"publisher","first-page":"952","DOI":"10.1109\/TITS.2020.3018903","volume":"23","author":"L Feng","year":"2022","unstructured":"Feng L, Huang Y, Tsang IW, Gupta A, Tang K, Tan KC, Ong Y-S (2022) Towards faster vehicle routing by transferring knowledge from customer representation. IEEE Trans Intell Transp Syst 23(2):952\u2013965. https:\/\/doi.org\/10.1109\/TITS.2020.3018903","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"1920_CR51","doi-asserted-by":"publisher","first-page":"110913","DOI":"10.1016\/j.asoc.2023.110913","volume":"148","author":"C Wang","year":"2023","unstructured":"Wang C, Ma B, Sun J (2023) A co-evolutionary genetic algorithm with knowledge transfer for multi-objective capacitated vehicle routing problems. Appl Soft Comput 148:110913. https:\/\/doi.org\/10.1016\/j.asoc.2023.110913","journal-title":"Appl Soft Comput"},{"issue":"2","key":"1920_CR52","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1109\/TEVC.2022.3169289","volume":"27","author":"MA Ardeh","year":"2023","unstructured":"Ardeh MA, Mei Y, Zhang M, Yao X (2023) Knowledge transfer genetic programming with auxiliary population for solving uncertain capacitated arc routing problem. IEEE Trans Evol Comput 27(2):311\u2013325. https:\/\/doi.org\/10.1109\/TEVC.2022.3169289","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"1920_CR53","doi-asserted-by":"publisher","first-page":"305","DOI":"10.26599\/TST.2023.9010048","volume":"29","author":"Y Cai","year":"2024","unstructured":"Cai Y, Lin Z, Cheng M, Liu P, Zhou Y (2024) Solving multi-objective vehicle routing problems with time windows: a decomposition-based multiform optimization approach. Tsinghua Sci Technol 29(2):305\u2013324. https:\/\/doi.org\/10.26599\/TST.2023.9010048","journal-title":"Tsinghua Sci Technol"},{"key":"1920_CR54","doi-asserted-by":"publisher","first-page":"108179","DOI":"10.1016\/j.engappai.2024.108179","volume":"133","author":"Y Cai","year":"2024","unstructured":"Cai Y, Wu Y, Fang C (2024) Tsemta: a tripartite shared evolutionary multi-task algorithm for optimizing many-task vehicle routing problems. Eng Appl Artif Intell 133:108179. https:\/\/doi.org\/10.1016\/j.engappai.2024.108179","journal-title":"Eng Appl Artif Intell"},{"key":"1920_CR55","doi-asserted-by":"publisher","unstructured":"Goldberg, D.E., Lingle, R.: Alleles, loci, and the traveling salesman problem. In: Proceedings of the first international conference on genetic algorithms and their applications. Psychology Press, pp 154\u2013159 (2014). https:\/\/doi.org\/10.4324\/9781315799674","DOI":"10.4324\/9781315799674"},{"key":"1920_CR56","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2022.102782","volume":"164","author":"C Friedrich","year":"2022","unstructured":"Friedrich C, Elbert R (2022) Urban consolidation centers and city toll schemes-investigating the impact of city tolls on transshipment decisions. Transp Res Part E Logist Transp Rev 164:102782. https:\/\/doi.org\/10.1016\/j.tre.2022.102782","journal-title":"Transp Res Part E Logist Transp Rev"},{"issue":"2","key":"1920_CR57","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/S0377-2217(98)00099-X","volume":"113","author":"C Voudouris","year":"1999","unstructured":"Voudouris C, Tsang E (1999) Guided local search and its application to the traveling salesman problem. Eur J Oper Res 113(2):469\u2013499. https:\/\/doi.org\/10.1016\/S0377-2217(98)00099-X","journal-title":"Eur J Oper Res"},{"issue":"11","key":"1920_CR58","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107 N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24(11):1097\u20131100. https:\/\/doi.org\/10.1016\/S0305-0548(97)00031-2","journal-title":"Comput Oper Res"},{"issue":"1","key":"1920_CR59","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar J (2006) Statistical comparisons of classifiers over multiple data sets. J Mach Learn Res 7(1):1\u201330","journal-title":"J Mach Learn Res"},{"issue":"5","key":"1920_CR60","doi-asserted-by":"publisher","first-page":"1514","DOI":"10.1109\/TEVC.2022.3210783","volume":"27","author":"Y Jiang","year":"2023","unstructured":"Jiang Y, Zhan Z-H, Tan KC, Zhang J (2023) A bi-objective knowledge transfer framework for evolutionary many-task optimization. IEEE Trans Evol Comput 27(5):1514\u20131528. https:\/\/doi.org\/10.1109\/TEVC.2022.3210783","journal-title":"IEEE Trans Evol Comput"},{"key":"1920_CR61","doi-asserted-by":"publisher","unstructured":"Da B, Ong Y-S, Feng L, Qin AK, Gupta A, Zhu Z, Ting C-K, Tang K, Yao X (2017) Evolutionary multitasking for single-objective continuous optimization: benchmark problems, performance metric, and baseline results. arXiv preprint arXiv:1706.03470. https:\/\/doi.org\/10.48550\/arXiv.1706.03470","DOI":"10.48550\/arXiv.1706.03470"}],"container-title":["Complex & Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-025-01920-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-025-01920-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-025-01920-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,17]],"date-time":"2025-07-17T19:04:35Z","timestamp":1752779075000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-025-01920-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,13]]},"references-count":61,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["1920"],"URL":"https:\/\/doi.org\/10.1007\/s40747-025-01920-x","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,13]]},"assertion":[{"value":"13 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 April 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 June 2025","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 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":"337"}}