{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T14:40:02Z","timestamp":1767969602425,"version":"3.49.0"},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T00:00:00Z","timestamp":1737504000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T00:00:00Z","timestamp":1737504000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/501100007128","name":"Natural Science Foundation of Shaanxi Province","doi-asserted-by":"publisher","award":["2019JZ-26"],"award-info":[{"award-number":["2019JZ-26"]}],"id":[{"id":"10.13039\/501100007128","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61373111"],"award-info":[{"award-number":["61373111"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61876141"],"award-info":[{"award-number":["61876141"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s40747-024-01750-3","type":"journal-article","created":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T10:37:35Z","timestamp":1737542255000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A multitasking ant system for multi-depot pick-up and delivery location routing problem with time window"],"prefix":"10.1007","volume":"11","author":[{"given":"Haoyuan","family":"Lv","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0502-4074","authenticated-orcid":false,"given":"Ruochen","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Jianxia","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,22]]},"reference":[{"issue":"22","key":"1750_CR1","doi-asserted-by":"publisher","first-page":"15267","DOI":"10.3390\/ijerph192215267","volume":"19","author":"Y Li","year":"2022","unstructured":"Li Y, Yao P, Osman S, Zainudin N, Sabri MF (2022) A thematic review on using food delivery services during the pandemic: insights for the post-COVID-19 era. Int J Environ Res Public Health 19(22):15267. https:\/\/doi.org\/10.3390\/ijerph192215267","journal-title":"Int J Environ Res Public Health"},{"key":"1750_CR2","doi-asserted-by":"publisher","first-page":"94","DOI":"10.28991\/esj-2021-SPER-08","volume":"5","author":"W Puriwat","year":"2021","unstructured":"Puriwat W, Tripopsakul S (2021) Understanding food delivery mobile application technology adoption: a UTAUT model integrating perceived fear of COVID-19. Emerg Sci J 5:94\u2013104. https:\/\/doi.org\/10.28991\/esj-2021-SPER-08","journal-title":"Emerg Sci J"},{"issue":"2","key":"1750_CR3","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1080\/15378020.2021.2006040","volume":"26","author":"MO Gani","year":"2023","unstructured":"Gani MO, Faroque AR, Muzareba AM, Amin S, Rahman M (2023) An integrated model to decipher online food delivery app adoption behavior in the COVID-19 pandemic. J Foodserv Bus Res 26(2):123\u2013163. https:\/\/doi.org\/10.1080\/15378020.2021.2006040","journal-title":"J Foodserv Bus Res"},{"key":"1750_CR4","first-page":"1","volume":"2021","author":"G Xue","year":"2021","unstructured":"Xue G, Wang Z, Wang G (2021) Optimization of rider scheduling for a food delivery service in o2o business. J Adv Transp 2021:1\u201315","journal-title":"J Adv Transp"},{"key":"1750_CR5","doi-asserted-by":"publisher","unstructured":"Ben\u00a0Alaia E, Dridi IH, Bouchriha H, Borne P (2013) Optimization of the multi-depot & Multi-vehicle pickup and delivery problem with time windows using genetic algorithm. In: 2013 International Conference on Control, Decision and Information Technologies (CoDIT), pp. 343\u2013348. https:\/\/doi.org\/10.1109\/CoDIT.2013.6689568","DOI":"10.1109\/CoDIT.2013.6689568"},{"issue":"1","key":"1750_CR6","doi-asserted-by":"publisher","first-page":"8","DOI":"10.15837\/ijccc.2018.1.2970","volume":"13","author":"EB Alaia","year":"2018","unstructured":"Alaia EB, Harbaoui I, Borne P, Bouchriha H (2018) A comparative study of the PSO and GA for the m-MDPDPTW. Int J Comput Commun Control 13(1):8\u201323","journal-title":"Int J Comput Commun Control"},{"key":"1750_CR7","doi-asserted-by":"publisher","unstructured":"Genetic Algorithm for Multi-Criteria Optimization of Multi-Depots Pick-up and Delivery Problems with Time Windows and Multi-Vehicles. Acta Polytechnica Hungarica (2015) https:\/\/doi.org\/10.12700\/APH.12.8.2015.8.9","DOI":"10.12700\/APH.12.8.2015.8.9"},{"issue":"14","key":"1750_CR8","doi-asserted-by":"publisher","first-page":"4201","DOI":"10.1080\/00207543.2019.1650975","volume":"58","author":"I Harbaoui Dridi","year":"2020","unstructured":"Harbaoui Dridi I, Ben Ala\u00efa E, Borne P, Bouchriha H (2020) Optimisation of the multi-depots pick-up and delivery problems with time windows and multi-vehicles using pso algorithm. Int J Prod Res 58(14):4201\u20134214","journal-title":"Int J Prod Res"},{"issue":"2","key":"1750_CR9","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.ejor.2014.08.030","volume":"241","author":"M Drexl","year":"2015","unstructured":"Drexl M, Schneider M (2015) A survey of variants and extensions of the location-routing problem. Eur J Oper Res 241(2):283\u2013308. https:\/\/doi.org\/10.1016\/j.ejor.2014.08.030","journal-title":"Eur J Oper Res"},{"key":"1750_CR10","doi-asserted-by":"publisher","unstructured":"Ala\u00efa EB, Dridi IH, Bouchriha H, Borne P (2015) Insertion of new depot locations for the optimization of multi-vehicles multi-depots pickup and Delivery Problems using Genetic Algorithm. In: 2015 International Conference on Industrial Engineering and Systems Management (IESM), pp. 695\u2013701. https:\/\/doi.org\/10.1109\/IESM.2015.7380234","DOI":"10.1109\/IESM.2015.7380234"},{"issue":"6","key":"1750_CR11","doi-asserted-by":"publisher","first-page":"2941","DOI":"10.1111\/itor.12950","volume":"28","author":"STW Mara","year":"2021","unstructured":"Mara STW, Kuo RJ, Asih AMS (2021) Location-routing problem: a classification of recent research. Int Trans Oper Res 28(6):2941\u20132983. https:\/\/doi.org\/10.1111\/itor.12950","journal-title":"Int Trans Oper Res"},{"key":"1750_CR12","doi-asserted-by":"publisher","first-page":"107168","DOI":"10.1016\/j.knosys.2021.107168","volume":"226","author":"Y Wang","year":"2021","unstructured":"Wang Y, Sun Y, Guan X, Fan J, Xu M, Wang H (2021) Two-echelon multi-period location routing problem with shared transportation resource. Knowledge-Based Syst 226:107168. https:\/\/doi.org\/10.1016\/j.knosys.2021.107168","journal-title":"Knowledge-Based Syst"},{"issue":"2","key":"1750_CR13","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1109\/MCI.2022.3155332","volume":"17","author":"A Gupta","year":"2022","unstructured":"Gupta A, Zhou L, Ong Y-S, Chen Z, Hou Y (2022) Half a Dozen Real-World Applications of Evolutionary Multitasking, and More. IEEE Comput Intell Mag 17(2):49\u201366. https:\/\/doi.org\/10.1109\/MCI.2022.3155332","journal-title":"IEEE Comput Intell Mag"},{"key":"1750_CR14","doi-asserted-by":"crossref","unstructured":"Feng Y, Feng L, Hou Y, Tan KC (2020) Large-scale optimization via evolutionary multitasking assisted random embedding. In: 2020 IEEE Congress on Evolutionary Computation (CEC), pp. 1\u20138. IEEE","DOI":"10.1109\/CEC48606.2020.9185660"},{"issue":"2","key":"1750_CR15","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1109\/TEVC.2021.3119933","volume":"26","author":"Y Feng","year":"2021","unstructured":"Feng Y, Feng L, Kwong S, Tan KC (2021) A multivariation multifactorial evolutionary algorithm for large-scale multiobjective optimization. IEEE Trans Evol Comput 26(2):248\u2013262","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"1750_CR16","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1109\/TEVC.2017.2785351","volume":"23","author":"J Ding","year":"2017","unstructured":"Ding J, Yang C, Jin Y, Chai T (2017) Generalized multitasking for evolutionary optimization of expensive problems. IEEE Trans Evol Comput 23(1):44\u201358","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"1750_CR17","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1109\/TEVC.2021.3100056","volume":"26","author":"K Chen","year":"2021","unstructured":"Chen K, Xue B, Zhang M, Zhou F (2021) Evolutionary multitasking for feature selection in high-dimensional classification via particle swarm optimization. IEEE Trans Evol Comput 26(3):446\u2013460","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"1750_CR18","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1109\/TETCI.2017.2769104","volume":"2","author":"A Gupta","year":"2018","unstructured":"Gupta A, Ong Y-S, Feng L (2018) Insights on transfer optimization: because experience is the best teacher. IEEE Transa Emerg Top Comput Intell 2(1):51\u201364. https:\/\/doi.org\/10.1109\/TETCI.2017.2769104","journal-title":"IEEE Transa Emerg Top Comput Intell"},{"issue":"1","key":"1750_CR19","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1109\/TEVC.2019.2906927","volume":"24","author":"KK Bali","year":"2020","unstructured":"Bali KK, Ong Y-S, Gupta A, Tan PS (2020) Multifactorial evolutionary algorithm with online transfer parameter estimation: MFEA-II. IEEE Trans Evol Comput 24(1):69\u201383. https:\/\/doi.org\/10.1109\/TEVC.2019.2906927","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"1750_CR20","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/0377-2217(85)90284-X","volume":"20","author":"RV Kulkarni","year":"1985","unstructured":"Kulkarni RV, Bhave PR (1985) Integer programming formulations of vehicle routing problems. Eur J Oper Res 20(1):58\u201367. https:\/\/doi.org\/10.1016\/0377-2217(85)90284-X","journal-title":"Eur J Oper Res"},{"issue":"5","key":"1750_CR21","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1002\/net.3230190505","volume":"19","author":"G Carpaneto","year":"1989","unstructured":"Carpaneto G, Dell\u2019amico M, Fischetti M, Toth P (1989) A branch and bound algorithm for the multiple depot vehicle scheduling problem. Networks 19(5):531\u2013548. https:\/\/doi.org\/10.1002\/net.3230190505","journal-title":"Networks"},{"key":"1750_CR22","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.disopt.2014.03.001","volume":"12","author":"C Contardo","year":"2014","unstructured":"Contardo C, Martinelli R (2014) A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. Discrete Optimiz 12:129\u2013146. https:\/\/doi.org\/10.1016\/j.disopt.2014.03.001","journal-title":"Discrete Optimiz"},{"issue":"1","key":"1750_CR23","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1287\/ijoc.2013.0549","volume":"26","author":"C Contardo","year":"2014","unstructured":"Contardo C, Cordeau J-F, Gendron B (2014) An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem. INFORMS J Comput 26(1):88\u2013102. https:\/\/doi.org\/10.1287\/ijoc.2013.0549","journal-title":"INFORMS J Comput"},{"issue":"8","key":"1750_CR24","doi-asserted-by":"publisher","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","volume":"34","author":"D Pisinger","year":"2007","unstructured":"Pisinger D, Ropke S (2007) A general heuristic for vehicle routing problems. Comput Oper Res 34(8):2403\u20132435. https:\/\/doi.org\/10.1016\/j.cor.2005.09.012","journal-title":"Comput Oper Res"},{"key":"1750_CR25","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.trc.2015.06.016","volume":"70","author":"S Mancini","year":"2016","unstructured":"Mancini S (2016) A real-life Multi Depot Multi Period Vehicle Routing Problem with a Heterogeneous Fleet: Formulation and Adaptive Large Neighborhood Search based Matheuristic. Transp Res Part C 70:100\u2013112. https:\/\/doi.org\/10.1016\/j.trc.2015.06.016","journal-title":"Transp Res Part C"},{"key":"1750_CR26","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.cor.2014.07.004","volume":"53","author":"A Rahimi-Vahed","year":"2015","unstructured":"Rahimi-Vahed A, Gabriel Crainic T, Gendreau M, Rei W (2015) Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm. Comput Oper Res 53:9\u201323. https:\/\/doi.org\/10.1016\/j.cor.2014.07.004","journal-title":"Comput Oper Res"},{"issue":"02","key":"1750_CR27","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1142\/S0218213003001186","volume":"12","author":"H Li","year":"2003","unstructured":"Li H, Lim A (2003) A metaheuristic for the pickup and delivery problem with time windows. Int J Artif Intell Tools 12(02):173\u2013186. https:\/\/doi.org\/10.1142\/S0218213003001186","journal-title":"Int J Artif Intell Tools"},{"issue":"8","key":"1750_CR28","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","journal-title":"J Oper Res Soc"},{"issue":"9","key":"1750_CR29","doi-asserted-by":"publisher","first-page":"2025","DOI":"10.3390\/ijerph15092025","volume":"15","author":"L Shen","year":"2018","unstructured":"Shen L, Tao F, Wang S (2018) Multi-depot open vehicle routing problem with time windows based on carbon trading. Int J Environ Res Public Health 15(9):2025. https:\/\/doi.org\/10.3390\/ijerph15092025","journal-title":"Int J Environ Res Public Health"},{"issue":"3","key":"1750_CR30","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":"1750_CR31","doi-asserted-by":"publisher","first-page":"107412","DOI":"10.1016\/j.knosys.2021.107412","volume":"231","author":"Y Wang","year":"2021","unstructured":"Wang Y, Li Q, Guan X, Fan J, Xu M, Wang H (2021) Collaborative multi-depot pickup and delivery vehicle routing problem with split loads and time windows. Knowledge-Based Syst 231:107412. https:\/\/doi.org\/10.1016\/j.knosys.2021.107412","journal-title":"Knowledge-Based Syst"},{"issue":"3","key":"1750_CR32","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1016\/j.cie.2011.11.025","volume":"62","author":"AS Tasan","year":"2012","unstructured":"Tasan AS, Gen M (2012) A genetic algorithm based approach to vehicle routing problem with simultaneous pick-up and deliveries. Comput Indus Eng 62(3):755\u2013761","journal-title":"Comput Indus Eng"},{"issue":"2","key":"1750_CR33","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s10732-011-9184-0","volume":"19","author":"JJ De la Cruz","year":"2013","unstructured":"De la Cruz JJ, Paternina-Arboleda CD, Cantillo V, Montoya-Torres JR (2013) A two-pheromone trail ant colony system\u2014tabu search approach for the heterogeneous vehicle routing problem with time windows and multiple products. J Heuristics 19(2):233\u2013252. https:\/\/doi.org\/10.1007\/s10732-011-9184-0","journal-title":"J Heuristics"},{"issue":"1","key":"1750_CR34","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/s10489-008-0136-9","volume":"32","author":"C-Y Lee","year":"2010","unstructured":"Lee C-Y, Lee Z-J, Lin S-W, Ying K-C (2010) An enhanced ant colony optimization (EACO) applied to capacitated vehicle routing problem. Appl Intell 32(1):88\u201395. https:\/\/doi.org\/10.1007\/s10489-008-0136-9","journal-title":"Appl Intell"},{"issue":"1","key":"1750_CR35","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1057\/jors.2009.161","volume":"62","author":"B Yu","year":"2011","unstructured":"Yu B, Yang Z-Z, Xie J-X (2011) A parallel improved ant colony optimization for multi-depot vehicle routing problem. J Oper Res Soc 62(1):183\u2013188. https:\/\/doi.org\/10.1057\/jors.2009.161","journal-title":"J Oper Res Soc"},{"key":"1750_CR36","doi-asserted-by":"publisher","unstructured":"Zhou L, Feng L, Zhong J, Zhu Z, Da B, Wu Z (2018) A study of similarity measure between tasks for multifactorial evolutionary algorithm. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion. GECCO \u201918, pp. 229\u2013230. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/3205651.3205736","DOI":"10.1145\/3205651.3205736"},{"issue":"3","key":"1750_CR37","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":"1750_CR38","doi-asserted-by":"publisher","unstructured":"Zheng X, Lei Y, Qin AK, Zhou D, Shi J, Gong M (2019) Differential Evolutionary Multi-task Optimization. In: 2019 IEEE Congress on Evolutionary Computation (CEC), pp. 1914\u20131921. https:\/\/doi.org\/10.1109\/CEC.2019.8789933","DOI":"10.1109\/CEC.2019.8789933"},{"issue":"11","key":"1750_CR39","doi-asserted-by":"publisher","first-page":"4492","DOI":"10.1109\/TSMC.2018.2853719","volume":"50","author":"J Zhong","year":"2020","unstructured":"Zhong J, Feng L, Cai W, Ong Y-S (2020) Multifactorial genetic programming for symbolic regression problems. IEEE Trans Syst Man Cybern 50(11):4492\u20134505. https:\/\/doi.org\/10.1109\/TSMC.2018.2853719","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"1750_CR40","doi-asserted-by":"crossref","unstructured":"Feng L, Zhou W, Zhou L, Jiang S, Zhong J, Da B, Zhu Z, Wang Y (2017) An empirical study of multifactorial pso and multifactorial de. In: 2017 IEEE Congress on Evolutionary Computation (CEC), pp. 921\u2013928 . IEEE","DOI":"10.1109\/CEC.2017.7969407"},{"issue":"3","key":"1750_CR41","doi-asserted-by":"publisher","first-page":"1046","DOI":"10.1109\/TASE.2018.2865593","volume":"16","author":"C Yang","year":"2019","unstructured":"Yang C, Ding J, Jin Y, Wang C, Chai T (2019) Multitasking multiobjective evolutionary operational indices optimization of beneficiation processes. IEEE Trans Autom Sci Eng 16(3):1046\u20131057. https:\/\/doi.org\/10.1109\/TASE.2018.2865593","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"1750_CR42","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 Indus Eng 130:757\u2013771. https:\/\/doi.org\/10.1016\/j.cie.2019.02.031","journal-title":"Comput Indus Eng"},{"key":"1750_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), pp. 3157\u20133164. https:\/\/doi.org\/10.1109\/TENCON.2016.7848632","DOI":"10.1109\/TENCON.2016.7848632"},{"issue":"6","key":"1750_CR44","doi-asserted-by":"publisher","first-page":"3143","DOI":"10.1109\/TCYB.2019.2962865","volume":"51","author":"L Feng","year":"2021","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","journal-title":"IEEE Trans Cybern"},{"issue":"7","key":"1750_CR45","doi-asserted-by":"publisher","first-page":"6217","DOI":"10.1109\/TCYB.2020.3036393","volume":"52","author":"X Xue","year":"2022","unstructured":"Xue X, Zhang K, Tan KC, Feng L, Wang J, Chen G, Zhao X, Zhang L, Yao J (2022) Affine transformation-enhanced multifactorial optimization for heterogeneous problems. IEEE Trans Cybern 52(7):6217\u20136231. https:\/\/doi.org\/10.1109\/TCYB.2020.3036393","journal-title":"IEEE Trans Cybern"},{"key":"1750_CR46","doi-asserted-by":"publisher","first-page":"112509","DOI":"10.1016\/j.enconman.2020.112509","volume":"207","author":"J Liang","year":"2020","unstructured":"Liang J, Qiao K, Yuan M, Yu K, Qu B, Ge S, Li Y, Chen G (2020) Evolutionary multi-task optimization for parameters extraction of photovoltaic models. Energy Convers Manage 207:112509. https:\/\/doi.org\/10.1016\/j.enconman.2020.112509","journal-title":"Energy Convers Manage"},{"issue":"2","key":"1750_CR47","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1109\/TEVC.2021.3068157","volume":"26","author":"C Wang","year":"2022","unstructured":"Wang C, Liu J, Wu K, Wu Z (2022) Solving multitask optimization problems with adaptive knowledge transfer via anomaly detection. IEEE Trans Evol Comput 26(2):304\u2013318. https:\/\/doi.org\/10.1109\/TEVC.2021.3068157","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"1750_CR48","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/MCI.2022.3155325","volume":"17","author":"C Wang","year":"2022","unstructured":"Wang C, Wu K, Liu J (2022) Evolutionary multitasking AUC optimization [Research Frontier]. IEEE Comput Intell Mag 17(2):67\u201382. https:\/\/doi.org\/10.1109\/MCI.2022.3155325","journal-title":"IEEE Comput Intell Mag"},{"issue":"1","key":"1750_CR49","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1109\/TEVC.2021.3099289","volume":"26","author":"N Zhang","year":"2022","unstructured":"Zhang N, Gupta A, Chen Z, Ong Y-S (2022) Evolutionary machine learning with minions: a case study in feature selection. IEEE Trans Evol Comput 26(1):130\u2013144. https:\/\/doi.org\/10.1109\/TEVC.2021.3099289","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"1750_CR50","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1016\/j.ejor.2013.08.042","volume":"236","author":"R Masson","year":"2014","unstructured":"Masson R, Ropke S, Lehu\u00e9d\u00e9 F, P\u00e9ton O (2014) A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes. Eur J Oper Res 236(3):849\u2013862","journal-title":"Eur J Oper Res"},{"key":"1750_CR51","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.jclepro.2017.01.001","volume":"144","author":"Y Wang","year":"2017","unstructured":"Wang Y, Ma X, Li Z, Liu Y, Xu M, Wang Y (2017) Profit distribution in collaborative multiple centers vehicle routing problem. J Cleaner Prod 144:203\u2013219","journal-title":"J Cleaner Prod"},{"key":"1750_CR52","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.neucom.2016.04.017","volume":"205","author":"RJ Kuo","year":"2016","unstructured":"Kuo RJ, Mei CH, Zulvia FE, Tsai CY (2016) An application of a metaheuristic algorithm-based clustering ensemble method to APP customer segmentation. Neurocomputing 205:116\u2013129. https:\/\/doi.org\/10.1016\/j.neucom.2016.04.017","journal-title":"Neurocomputing"},{"issue":"1","key":"1750_CR53","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.ejor.2015.06.082","volume":"248","author":"\u00c7 Ko\u00e7","year":"2016","unstructured":"Ko\u00e7 \u00c7, Bekta\u015f T, Jabali O, Laporte G (2016) The fleet size and mix location-routing problem with time windows: Formulations and a heuristic algorithm. Eur J Oper Res 248(1):33\u201351. https:\/\/doi.org\/10.1016\/j.ejor.2015.06.082","journal-title":"Eur J Oper Res"},{"key":"1750_CR54","doi-asserted-by":"publisher","unstructured":"Liu-ai W, Wen-Qing F (2012) A Parameter Model of Genetic Algorithm Regulating Ant Colony Algorithm. In: 2012 IEEE Ninth International Conference on E-Business Engineering, pp. 50\u201354 . https:\/\/doi.org\/10.1109\/ICEBE.2012.18","DOI":"10.1109\/ICEBE.2012.18"},{"issue":"1","key":"1750_CR55","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/s10489-009-0179-6","volume":"34","author":"B Shuang","year":"2011","unstructured":"Shuang B, Chen J, Li Z (2011) Study on hybrid PS-ACO algorithm. Appl Intell 34(1):64\u201373. https:\/\/doi.org\/10.1007\/s10489-009-0179-6","journal-title":"Appl Intell"},{"issue":"11","key":"1750_CR56","doi-asserted-by":"publisher","first-page":"3132","DOI":"10.1109\/TITS.2016.2542264","volume":"17","author":"X Wang","year":"2016","unstructured":"Wang X, Choi T-M, Liu H, Yue X (2016) Novel ant colony optimization methods for simplifying solution construction in vehicle routing problems. IEEE Trans Intell Trans Syst 17(11):3132\u20133141. https:\/\/doi.org\/10.1109\/TITS.2016.2542264","journal-title":"IEEE Trans Intell Trans Syst"},{"issue":"1","key":"1750_CR57","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1109\/TSMCB.2011.2164245","volume":"42","author":"I Ciornei","year":"2012","unstructured":"Ciornei I, Kyriakides E (2012) Hybrid ant colony-genetic algorithm (GAAPI) for global continuous optimization. IEEE Trans Syst Man Cybern Part B (Cybernetics) 42(1):234\u2013245. https:\/\/doi.org\/10.1109\/TSMCB.2011.2164245","journal-title":"IEEE Trans Syst Man Cybern Part B (Cybernetics)"},{"key":"1750_CR58","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.ins.2019.03.070","volume":"490","author":"H Zhang","year":"2019","unstructured":"Zhang H, Zhang Q, Ma L, Zhang Z, Liu Y (2019) A hybrid ant colony optimization algorithm for a multi-objective vehicle routing problem with flexible time windows. Inform Sci 490:166\u2013190. https:\/\/doi.org\/10.1016\/j.ins.2019.03.070","journal-title":"Inform Sci"},{"key":"1750_CR59","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.neucom.2016.04.017","volume":"205","author":"R-J Kuo","year":"2016","unstructured":"Kuo R-J, Mei C, Zulvia FE, Tsai C (2016) An application of a metaheuristic algorithm-based clustering ensemble method to app customer segmentation. Neurocomputing 205:116\u2013129","journal-title":"Neurocomputing"},{"key":"1750_CR60","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.cor.2017.02.007","volume":"83","author":"C Defryn","year":"2017","unstructured":"Defryn C, S\u00f6rensen K (2017) A fast two-level variable neighborhood search for the clustered vehicle routing problem. Comput Oper Res 83:78\u201394. https:\/\/doi.org\/10.1016\/j.cor.2017.02.007","journal-title":"Comput Oper Res"},{"issue":"8","key":"1750_CR61","first-page":"155","volume":"12","author":"EB Alaia","year":"2015","unstructured":"Alaia EB, Dridi IH, Bouchriha H, Borne P (2015) Genetic algorithm for multi-criteria optimization of multi-depots pick-up and delivery problems with time windows and multi-vehicles. Acta Polytech Hung 12(8):155\u2013174","journal-title":"Acta Polytech Hung"},{"issue":"8","key":"1750_CR62","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T St\u00fctzle","year":"2000","unstructured":"St\u00fctzle T, Hoos HH (2000) MAX\u2013MIN ant system. Future Gener Comp Syst 16(8):889\u2013914. https:\/\/doi.org\/10.1016\/S0167-739X(00)00043-1","journal-title":"Future Gener Comp Syst"},{"issue":"4","key":"1750_CR63","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1162\/evco_a_00289","volume":"29","author":"R Liu","year":"2021","unstructured":"Liu R, Li J, Jin Y, Jiao L (2021) A self-adaptive response strategy for dynamic multiobjective evolutionary optimization based on objective space decomposition. Evol Comput 29(4):491\u2013519. https:\/\/doi.org\/10.1162\/evco_a_00289","journal-title":"Evol Comput"}],"container-title":["Complex & Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-024-01750-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-024-01750-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-024-01750-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,7]],"date-time":"2025-02-07T16:31:27Z","timestamp":1738945887000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-024-01750-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,22]]},"references-count":63,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["1750"],"URL":"https:\/\/doi.org\/10.1007\/s40747-024-01750-3","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,22]]},"assertion":[{"value":"13 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 December 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 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":"On behalf of all authors, the corresponding author states that there is no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"159"}}