{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T12:52:10Z","timestamp":1780059130810,"version":"3.54.0"},"reference-count":105,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,1,5]],"date-time":"2024-01-05T00:00:00Z","timestamp":1704412800000},"content-version":"vor","delay-in-days":4,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2024,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Designing routing schedules is a pivotal aspect of smart delivery systems. Therefore, the field has been blooming for decades, and numerous algorithms for this task have been proposed for various formulations of rich vehicle routing problems. There is, however, an important gap in the state of the art that concerns the lack of an established and widely-adopted approach toward thorough verification and validation of such algorithms in practical scenarios. We tackle this issue and propose a comprehensive validation approach that can shed more light on functional and non-functional abilities of the solvers. Additionally, we propose novel similarity metrics to measure the distance between the routing schedules that can be used in verifying the convergence abilities of randomized techniques. To reflect practical aspects of intelligent transportation systems, we introduce an algorithm for elaborating solvable benchmark instances for any vehicle routing formulation, alongside the set of quality metrics that help quantify the real-life characteristics of the delivery systems, such as their profitability. The experiments prove the flexibility of our approach through utilizing it to the NP-hard pickup and delivery problem with time windows, and present the qualitative, quantitative, and statistical analysis scenarios which help understand the capabilities of the investigated techniques. We believe that our efforts will be a step toward the more critical and consistent evaluation of emerging vehicle routing (and other) solvers, and will allow the community to easier confront them, thus ultimately focus on the most promising research avenues that are determined in the quantifiable and traceable manner.<\/jats:p>","DOI":"10.1007\/s10489-023-05212-0","type":"journal-article","created":{"date-parts":[[2024,1,5]],"date-time":"2024-01-05T13:03:15Z","timestamp":1704459795000},"page":"1335-1364","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Standardized validation of vehicle routing algorithms"],"prefix":"10.1007","volume":"54","author":[{"given":"Tomasz","family":"Jastrzab","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michal","family":"Myller","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lukasz","family":"Tulczyjew","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Miroslaw","family":"Blocho","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michal","family":"Kawulok","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adam","family":"Czornik","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jakub","family":"Nalepa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,1,5]]},"reference":[{"key":"5212_CR1","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2021.107403","volume":"108","author":"AM Altabeeb","year":"2021","unstructured":"Altabeeb AM, Mohsen AM, Abualigah L, Ghallab A (2021) Solving capacitated vehicle routing problem using cooperative firefly algorithm. Appl Soft Comput 108:107403","journal-title":"Appl Soft Comput"},{"key":"5212_CR2","doi-asserted-by":"crossref","first-page":"3774","DOI":"10.1109\/JIOT.2020.3024223","volume":"8","author":"J Bi","year":"2021","unstructured":"Bi J, Yuan H, Duanmu S, Zhou M, Abusorrah A (2021) Energy-optimized partial computation offloading in mobile-edge computing with genetic simulated-annealing-based particle swarm optimization. IEEE Int Things J 8:3774\u20133785","journal-title":"IEEE Int Things J"},{"key":"5212_CR3","doi-asserted-by":"crossref","unstructured":"Blocho M (2020) Exact algorithms for solving rich VRPs. In: Nalepa J (ed) smart delivery systems. Solving complex vehicle routing problems. Elsevier, Intelligent Data Centric Systems, pp 93\u2013100","DOI":"10.1016\/B978-0-12-815715-2.00008-7"},{"key":"5212_CR4","doi-asserted-by":"crossref","unstructured":"Blocho M (2020) Heuristics, metaheuristics, and hyperheuristics for rich vehicle routing problems. In: Nalepa J (ed) smart delivery systems. solving complex vehicle routing problems. Elsevier, Intelligent Data Centric Systems, pp 101\u2013156","DOI":"10.1016\/B978-0-12-815715-2.00009-9"},{"key":"5212_CR5","doi-asserted-by":"publisher","unstructured":"Blocho M, Jastrzab T, Nalepa J (2022) Cooperative co-evolutionary memetic algorithm for pickup and delivery problem with time windows, In: Proceedings of the genetic and evolutionary computation conference companion, Association for Computing Machinery, New York, USA. pp 176-179. https:\/\/doi.org\/10.1145\/3520304.3528782","DOI":"10.1145\/3520304.3528782"},{"key":"5212_CR6","doi-asserted-by":"publisher","unstructured":"Blocho M, Jastrzab T, Nalepa J (2023) Parallel cooperative memetic co-evolution for VRPTW. In: Silva S, Paquete L (eds) Companion proceedings of the conference on genetic and evolutionary computation, GECCO 2023. Companion Volume, Lisbon, Portugal, July 15-19, 2023, ACM. pp 53\u201354. https:\/\/doi.org\/10.1145\/3583133.3596436","DOI":"10.1145\/3583133.3596436"},{"key":"5212_CR7","doi-asserted-by":"crossref","unstructured":"Blocho M, Nalepa J (2017) LCS-based selective route exchange crossover for the pickup and delivery problem with time windows, In: Evolutionary computation in combinatorial optimization, Springer. pp 124\u2013140","DOI":"10.1007\/978-3-319-55453-2_9"},{"key":"5212_CR8","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1109\/TASE.2019.2945717","volume":"18","author":"Z Cao","year":"2021","unstructured":"Cao Z, Lin C, Zhou M (2021) A knowledge-based cuckoo search algorithm to schedule a flexible job shop with sequencing flexibility. IEEE Trans on Autom Sci Eng 18:56\u201369","journal-title":"IEEE Trans on Autom Sci Eng"},{"key":"5212_CR9","doi-asserted-by":"publisher","unstructured":"Cavalcanti\u00a0Costa JG, Mei Y, Zhang M (2023) Learning to select initialisation heuristic for vehicle routing problems, In: Proceedings of the genetic and evolutionary computation conference, Association for Computing Machinery, New York, USA. pp 266-274. https:\/\/doi.org\/10.1145\/3583131.3590397","DOI":"10.1145\/3583131.3590397"},{"key":"5212_CR10","doi-asserted-by":"crossref","first-page":"1164","DOI":"10.1016\/j.ejor.2021.02.027","volume":"294","author":"C Chen","year":"2021","unstructured":"Chen C, Demir E, Huang Y (2021) An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and delivery robots. Eur J Oper Res 294:1164\u20131180","journal-title":"Eur J Oper Res"},{"key":"5212_CR11","doi-asserted-by":"crossref","first-page":"1135","DOI":"10.1109\/TSMC.2016.2560128","volume":"47","author":"W Dong","year":"2017","unstructured":"Dong W, Zhou M (2017) A supervised learning and control method to improve particle swarm optimization algorithms. IEEE Trans Syst Man Cybern Syst 47:1135\u20131148","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"5212_CR12","doi-asserted-by":"crossref","first-page":"105211","DOI":"10.1016\/j.cor.2021.105211","volume":"129","author":"H Fan","year":"2021","unstructured":"Fan H, Zhang Y, Tian P, Lv Y, Fan H (2021) Time-dependent multi-depot green vehicle routing problem with time windows considering temporal-spatial distance. Comput Oper Res 129:105211","journal-title":"Comput Oper Res"},{"key":"5212_CR13","doi-asserted-by":"publisher","unstructured":"Fan L, Liu C, Dai B, Li J, Wu Z, Guo Y (2023) Electric vehicle routing problem considering energy differences of charging stations. Journal of Cleaner Production 418:138184. https:\/\/doi.org\/10.1016\/j.jclepro.2023.138184https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0959652623023429","DOI":"10.1016\/j.jclepro.2023.138184"},{"key":"5212_CR14","doi-asserted-by":"publisher","first-page":"11786","DOI":"10.1007\/s10489-022-04061-7","volume":"53","author":"B Feng","year":"2023","unstructured":"Feng B, Wei L (2023) An improved multi-directional local search algorithm for vehicle routing problem with time windows and route balance. Appl Intell 53:11786\u201311798. https:\/\/doi.org\/10.1007\/s10489-022-04061-7","journal-title":"Appl Intell"},{"key":"5212_CR15","doi-asserted-by":"publisher","unstructured":"Feng L, Zhou L, Gupta A, Zhong J, Zhu Z, Tan KC, Qin K (2019) Solving generalized vehicle routing problem with occasional drivers via evolutionary multitasking. IEEE Trans Cybern 1\u201314. https:\/\/doi.org\/10.1109\/TCYB.2019.2955599","DOI":"10.1109\/TCYB.2019.2955599"},{"key":"5212_CR16","doi-asserted-by":"crossref","first-page":"2438","DOI":"10.1109\/TSMC.2018.2847448","volume":"49","author":"Y Feng","year":"2019","unstructured":"Feng Y, Zhou M, Tian G, Li Z, Zhang Z, Zhang Q, Tan J (2019) Target disassembly sequencing and scheme evaluation for CNC machine tools using improved multiobjective ant colony algorithm and fuzzy integral. IEEE Trans Syst Man Cybern: Syst 49:2438\u20132451","journal-title":"IEEE Trans Syst Man Cybern: Syst"},{"key":"5212_CR17","doi-asserted-by":"publisher","unstructured":"Fern\u00e1ndez Gil A, Lalla-Ruiz E, G\u00f3mez S\u00e1nchez M, Castro C (2023) The cumulative vehicle routing problem with time windows: models and algorithm. Annals Oper Res. https:\/\/doi.org\/10.1007\/s10479-022-05102-7","DOI":"10.1007\/s10479-022-05102-7"},{"key":"5212_CR18","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1109\/TNNLS.2018.2846646","volume":"30","author":"S Gao","year":"2019","unstructured":"Gao S, Zhou M, Wang Y, Cheng J, Yachi H, Wang J (2019) Dendritic neuron model with effective learning algorithms for classification, approximation, and prediction. IEEE Trans Neural Netw Learn Syst 30:601\u2013614","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"5212_CR19","doi-asserted-by":"publisher","first-page":"7326","DOI":"10.1007\/s10489-022-03912-7","volume":"53","author":"Y Gao","year":"2023","unstructured":"Gao Y, Wu H, Wang W (2023) A hybrid ant colony optimization with fireworks algorithm to solve capacitated vehicle routing problem. Appl Intell 53:7326\u20137342. https:\/\/doi.org\/10.1007\/s10489-022-03912-7","journal-title":"Appl Intell"},{"key":"5212_CR20","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.ejor.2020.05.041","volume":"288","author":"M Gmira","year":"2021","unstructured":"Gmira M, Gendreau M, Lodi A, Potvin JY (2021) Tabu search for the time-dependent vehicle routing problem with time windows on a road network. Eur J Oper Res 288:129\u2013140","journal-title":"Eur J Oper Res"},{"key":"5212_CR21","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1016\/j.ejor.2019.05.010","volume":"276","author":"D Goeke","year":"2019","unstructured":"Goeke D (2019) Granular tabu search for the pickup and delivery problem with time windows and electric vehicles. Eur J Oper Res 276:821\u2013836. https:\/\/doi.org\/10.1016\/j.ejor.2019.05.010","journal-title":"Eur J Oper Res"},{"key":"5212_CR22","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.jocs.2017.12.012","volume":"25","author":"R Goel","year":"2018","unstructured":"Goel R, Maini R (2018) A hybrid of ant colony and firefly algorithms (HAFA) for solving vehicle routing problems. J Comput Sci 25:28\u201337. https:\/\/doi.org\/10.1016\/j.jocs.2017.12.012","journal-title":"J Comput Sci"},{"key":"5212_CR23","doi-asserted-by":"crossref","unstructured":"Goel RK, Rani Bansal S (2020) Hybrid algorithms for rich vehicle routing problems: a survey. In: Nalepa J (ed) Smart delivery systems. Elsevier, Intelligent Data-Centric Systems, pp 157\u2013184","DOI":"10.1016\/B978-0-12-815715-2.00011-7"},{"key":"5212_CR24","doi-asserted-by":"publisher","first-page":"7588595","DOI":"10.1155\/2023\/7588595","volume":"2023","author":"X Han","year":"2023","unstructured":"Han X (2023) Path planning algorithm for the multiple depot vehicle routing problem based on parallel clustering. Sci Program 2023:7588595. https:\/\/doi.org\/10.1155\/2023\/7588595","journal-title":"Sci Program"},{"key":"5212_CR25","doi-asserted-by":"publisher","unstructured":"Herath H, Mittal M (2022) Adoption of artificial intelligence in smart cities: a comprehensive review. Int J Inf Manag Data Insights 2:100076. https:\/\/doi.org\/10.1016\/j.jjimei.2022.100076https:\/\/www.sciencedirect.com\/science\/article\/pii\/S2667096822000192","DOI":"10.1016\/j.jjimei.2022.100076"},{"key":"5212_CR26","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1109\/TSMC.2015.2507161","volume":"47","author":"Y Hou","year":"2017","unstructured":"Hou Y, Wu N, Zhou M, Li Z (2017) Pareto-optimization for scheduling of crude oil operations in refinery via genetic algorithm. IEEE Trans Syst Man Cybern Syst 47:517\u2013530","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"5212_CR27","doi-asserted-by":"crossref","first-page":"100911","DOI":"10.1016\/j.swevo.2021.100911","volume":"64","author":"I Ilhan","year":"2021","unstructured":"Ilhan I (2021) An improved simulated annealing algorithm with crossover operator for capacitated vehicle routing problem. Swarm Evol Comput 64:100911","journal-title":"Swarm Evol Comput"},{"key":"5212_CR28","doi-asserted-by":"crossref","unstructured":"Jastrzab T, Buchcik A (2020) Practical applications of smart delivery systems. In: Nalepa J (ed) Smart delivery systems. solving complex vehicle routing problems. Elsevier, Intelligent Data Centric Systems, pp 249\u2013268","DOI":"10.1016\/B978-0-12-815715-2.00012-9"},{"key":"5212_CR29","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/978-3-031-08754-7_11","volume-title":"Computational Science - ICCS 2022","author":"T Jastrzab","year":"2022","unstructured":"Jastrzab T, Myller M, Tulczyjew L, Blocho M, Ryczko W, Kawulok M, Nalepa J (2022) Particle swarm optimization configures the route minimization algorithm. In: Groen D, de Mulatier C, Paszynski M, Krzhizhanovskaya VV, Dongarra JJ, Sloot PMA (eds) Computational Science - ICCS 2022. Springer International Publishing, Cham, pp 80\u201387"},{"key":"5212_CR30","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1109\/TASE.2019.2950964","volume":"17","author":"H Jia","year":"2020","unstructured":"Jia H, Miao H, Tian G, Zhou M, Feng Y, Li Z, Li J (2020) Multiobjective bike repositioning in bike-sharing systems via a modified artificial bee colony algorithm. IEEE Trans Autom Sci Eng 17:909\u2013920","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"5212_CR31","doi-asserted-by":"crossref","unstructured":"Jiang G, Lam SK, Ning F, He P, Xie J (2020) Peak-hour vehicle routing for first-mile transportation: problem formulation and algorithms. IEEE Trans Intell Transp Syst 21:3308\u20133321","DOI":"10.1109\/TITS.2019.2926065"},{"key":"5212_CR32","doi-asserted-by":"crossref","unstructured":"Jin X, Qin H, Zhang Z, Zhou M, Wang J (2021) Planning of garbage collection service: an arc-routing problem with time-dependent penalty cost. IEEE Trans Intell Transp Syst 22:2692\u20132705","DOI":"10.1109\/TITS.2020.2973806"},{"key":"5212_CR33","doi-asserted-by":"publisher","unstructured":"Kalatzantonakis P, Sifaleras A, Samaras N (2023) A reinforcement learning-variable neighborhood search method for the capacitated vehicle routing problem. Expert Sys Appl 213:118812. https:\/\/doi.org\/10.1016\/j.eswa.2022.118812https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0957417422018309","DOI":"10.1016\/j.eswa.2022.118812"},{"key":"5212_CR34","doi-asserted-by":"crossref","unstructured":"Kapoor S, Narayanan A (2022) Leakage and the Reproducibility Crisis in ML-based Science. arXiv:2207.07048, 10.48550\/ARXIV.2207.07048","DOI":"10.1016\/j.patter.2023.100804"},{"key":"5212_CR35","doi-asserted-by":"crossref","first-page":"105060","DOI":"10.1016\/j.cor.2020.105060","volume":"125","author":"M Keskin","year":"2021","unstructured":"Keskin M, \u00c7atay B, Laporte G (2021) A simulation-based heuristic for the electric vehicle routing problem with time windows and stochastic waiting times at recharging stations. Comput Oper Res 125:105060","journal-title":"Comput Oper Res"},{"key":"5212_CR36","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1109\/JAS.2020.1003048","volume":"7","author":"AH Khan","year":"2020","unstructured":"Khan AH, Cao X, Li S, Katsikis VN, Liao L (2020) Bas-adam: an adam based approach to improve the performance of beetle antennae search optimizer. IEEE\/CAA Journal of Automatica Sinica 7:461\u2013471","journal-title":"IEEE\/CAA Journal of Automatica Sinica"},{"key":"5212_CR37","doi-asserted-by":"publisher","unstructured":"Kim G, Ong Y, Heng CK, Tan PS, Zhang NA (2015) City vehicle routing problem (City VRP): a review. IEEE Trans Intell Transp Syst 16:1654\u20131666. https:\/\/doi.org\/10.1109\/TITS.2015.2395536","DOI":"10.1109\/TITS.2015.2395536"},{"key":"5212_CR38","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-020-00600-7","author":"G Konstantakopoulos","year":"2020","unstructured":"Konstantakopoulos G, Gayialis S, Kechagias E (2020) Vehicle routing problem and related algorithms for logistics distribution: a literature review and classification. Oper Res. https:\/\/doi.org\/10.1007\/s12351-020-00600-7","journal-title":"Oper Res"},{"key":"5212_CR39","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.tre.2015.12.001","volume":"86","author":"D Lai","year":"2016","unstructured":"Lai D, Demirag O, Leung J (2016) A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph. Transp Res Part E 86:32\u201352","journal-title":"Transp Res Part E"},{"key":"5212_CR40","doi-asserted-by":"crossref","first-page":"1135","DOI":"10.1111\/itor.12885","volume":"28","author":"H Lespay","year":"2021","unstructured":"Lespay H, Suchan K (2021) A case study of consistent vehicle routing problem with time windows. Int Trans Oper Res 28:1135\u20131163","journal-title":"Int Trans Oper Res"},{"key":"5212_CR41","doi-asserted-by":"publisher","unstructured":"Li H, Li Z, Cao L, Wang R, Ren M (2020) Research on optimization of electric vehicle routing problem with time window. IEEE Access 8. https:\/\/doi.org\/10.1109\/ACCESS.2020.3014638","DOI":"10.1109\/ACCESS.2020.3014638"},{"key":"5212_CR42","doi-asserted-by":"publisher","unstructured":"Lin B, Ghaddar B, Nathwani J (2021) Deep reinforcement learning for the electric vehicle routing problem with time windows. IEEE Trans Intell Transp Syst 1\u201311. https:\/\/doi.org\/10.1109\/TITS.2021.3105232","DOI":"10.1109\/TITS.2021.3105232"},{"key":"5212_CR43","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1049\/iet-cim.2019.0035","volume":"1","author":"J Liu","year":"2019","unstructured":"Liu J, Feng S, Niu Q, Li L (2019) New construction heuristic algorithm for solving the vehicle routing problem with time windows. IET Collab Intell Manuf 1:90\u201396. https:\/\/doi.org\/10.1049\/iet-cim.2019.0035","journal-title":"IET Collab Intell Manuf"},{"key":"5212_CR44","doi-asserted-by":"publisher","unstructured":"Liu X, Wang D, Yin Y, Cheng T (2023) Robust optimization for the electric vehicle pickup and delivery problem with time windows and uncertain demands. Comput Oper Res 151:106119. https:\/\/doi.org\/10.1016\/j.cor.2022.106119https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0305054822003495","DOI":"10.1016\/j.cor.2022.106119"},{"key":"5212_CR45","first-page":"481","volume-title":"Proc","author":"PR Lorenzo","year":"2017","unstructured":"Lorenzo PR, Nalepa J, Kawulok M, Ramos LS, Pastor JR (2017) Particle swarm optimization for hyper-parameter selection in deep neural networks. Proc. GECCO, ACM, USA, pp 481\u2013488"},{"key":"5212_CR46","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez M, Dubois-Lacoste J, P\u00e9rez C\u00e1ceres L, Birattari M, St\u00fctzle T (2016) The irace package: iterated racing for automatic algorithm configuration. Oper Res Perspect. 3:43\u201358","DOI":"10.1016\/j.orp.2016.09.002"},{"key":"5212_CR47","doi-asserted-by":"publisher","unstructured":"Lv Z, Shang W (2023) Impacts of intelligent transportation systems on energy conservation and emission reduction of transport systems: a comprehensive review. Green Technologies and Sustainability 1:100002. https:\/\/doi.org\/10.1016\/j.grets.2022.100002https:\/\/www.sciencedirect.com\/science\/article\/pii\/S2949736122000021","DOI":"10.1016\/j.grets.2022.100002"},{"key":"5212_CR48","doi-asserted-by":"crossref","unstructured":"Moghdani R, Salimifard K, Demir E, Benyettou A (2021) The green vehicle routing problem: a systematic literature review. J Clean Prod 279:123691","DOI":"10.1016\/j.jclepro.2020.123691"},{"key":"5212_CR49","doi-asserted-by":"crossref","unstructured":"Mohamed E, Ndiaye M (2018) Optimal routing and scheduling in e-commerce logistics using crowdsourcing strategies, In: 7th International conference on industrial technology and management, IEEE. pp 248\u2013253","DOI":"10.1109\/ICITM.2018.8333955"},{"key":"5212_CR50","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s10288-020-00433-2","volume":"18","author":"A Mor","year":"2020","unstructured":"Mor A, Speranza MG (2020) Vehicle routing problems over time: a survey. 4OR 18:129\u2013149","journal-title":"4OR"},{"key":"5212_CR51","doi-asserted-by":"publisher","unstructured":"Muniasamy RP, Singh S, Nasre R, Narayanaswamy N (2023) Effective parallelization of the vehicle routing problem, In: Proceedings of the genetic and evolutionary computation conference, Association for Computing Machinery, New York, USA. pp 1036-1044. https:\/\/doi.org\/10.1145\/3583131.3590458","DOI":"10.1145\/3583131.3590458"},{"key":"5212_CR52","doi-asserted-by":"crossref","first-page":"1108","DOI":"10.1016\/j.ejor.2021.02.024","volume":"294","author":"VR M\u00e1ximo","year":"2021","unstructured":"M\u00e1ximo VR, Nascimento MC (2021) A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem. Eur J Oper Res 294:1108\u20131119","journal-title":"Eur J Oper Res"},{"key":"5212_CR53","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1007\/s10766-014-0343-4","volume":"43","author":"J Nalepa","year":"2015","unstructured":"Nalepa J, Blocho M (2015) Co-operation in the parallel memetic algorithm. Int J Parallel Program 43:812\u2013839. https:\/\/doi.org\/10.1007\/s10766-014-0343-4","journal-title":"Int J Parallel Program"},{"key":"5212_CR54","doi-asserted-by":"publisher","unstructured":"Nalepa J, Blocho M, (2015b) A parallel algorithm with the search space partition for the pickup and delivery with time windows, In: 10th international conference on P2P, parallel, grid, cloud and internet computing, IEEE. pp 92\u201399. https:\/\/doi.org\/10.1109\/3PGCIC.2015.12","DOI":"10.1109\/3PGCIC.2015.12"},{"key":"5212_CR55","doi-asserted-by":"crossref","first-page":"2309","DOI":"10.1007\/s00500-015-1642-4","volume":"20","author":"J Nalepa","year":"2016","unstructured":"Nalepa J, Blocho M (2016) Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows. Soft Comput 20:2309\u20132327","journal-title":"Soft Comput"},{"key":"5212_CR56","doi-asserted-by":"crossref","first-page":"1547","DOI":"10.3233\/JIFS-169149","volume":"32","author":"J Nalepa","year":"2017","unstructured":"Nalepa J, Blocho M (2017) Adaptive guided ejection search for pickup and delivery with time windows. J Intell Fuzzy Syst 32:1547\u20131559","journal-title":"J Intell Fuzzy Syst"},{"key":"5212_CR57","doi-asserted-by":"publisher","unstructured":"Nalepa J, Blocho M, (2017b) A parallel memetic algorithm for the pickup and delivery problem with time windows, In: 25th Euromicro international conference on parallel, distributed and network-based processing, IEEE. pp 1\u20138. https:\/\/doi.org\/10.1109\/PDP.2017.75","DOI":"10.1109\/PDP.2017.75"},{"key":"5212_CR58","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1504\/IJGUC.2018.091724","volume":"9","author":"J Nalepa","year":"2018","unstructured":"Nalepa J, Blocho M (2018) Adaptive cooperation in parallel memetic algorithms for rich vehicle routing problems. Int J Grid Util Comput 9:179\u2013192","journal-title":"Int J Grid Util Comput"},{"key":"5212_CR59","doi-asserted-by":"crossref","unstructured":"Nalepa J, Czech Z, (2013) New selection schemes in a memetic algorithm for the vehicle routing problem with time windows, In: Adaptive and natural computing algorithms, Springer. pp 396\u2013405","DOI":"10.1007\/978-3-642-37213-1_41"},{"key":"5212_CR60","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.swevo.2018.04.001","volume":"44","author":"E Osaba","year":"2019","unstructured":"Osaba E, Yang X, Fister I Jr, Del Ser J, Lopez-Garcia P, Vazquez-Pardavila A (2019) A discrete and improved bat algorithm for solving a medical goods distribution problem with pharmacological waste collection. Swarm Evol Comput 44:273\u2013286. https:\/\/doi.org\/10.1016\/j.swevo.2018.04.001","journal-title":"Swarm Evol Comput"},{"key":"5212_CR61","doi-asserted-by":"publisher","first-page":"106293","DOI":"10.1016\/j.cor.2023.106293","volume":"158","author":"A Osorio-Mora","year":"2023","unstructured":"Osorio-Mora A, Escobar JW, Toth P (2023) An iterated local search algorithm for latency vehicle routing problems with multiple depots. Comput Oper Res 158:106293. https:\/\/doi.org\/10.1016\/j.cor.2023.106293 (https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0305054823001570)","journal-title":"Comput Oper Res"},{"key":"5212_CR62","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1007\/978-3-031-23615-0_42","volume-title":"Advances in Integrated Design and Production II","author":"A Oumachtaq","year":"2023","unstructured":"Oumachtaq A, Ouzizi L, Douimi M (2023) Green vehicle routing problem (gvrp): State-of-the-art. In: Azrar L, Jalid A, Lamouri S, Siadat A, Taha Janan M, Chaari F, Haddar M (eds) Advances in Integrated Design and Production II. Springer International Publishing, Cham, pp 406\u2013425"},{"key":"5212_CR63","doi-asserted-by":"crossref","first-page":"105193","DOI":"10.1016\/j.cor.2020.105193","volume":"128","author":"B Pan","year":"2021","unstructured":"Pan B, Zhang Z, Lim A (2021) A hybrid algorithm for time-dependent vehicle routing problem with time windows. Comput Oper Res 128:105193","journal-title":"Comput Oper Res"},{"key":"5212_CR64","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/j.ejor.2020.09.022","volume":"291","author":"B Pan","year":"2021","unstructured":"Pan B, Zhang Z, Lim A (2021) Multi-trip time-dependent vehicle routing problem with time windows. Eur J Oper Res 291:218\u2013231","journal-title":"Eur J Oper Res"},{"key":"5212_CR65","first-page":"2256","volume":"8","author":"F Pan","year":"2013","unstructured":"Pan F, Ye C, Wang K, Cao J (2013) Research on the vehicle routing problem with time windows using firefly algorithm. J Comput 8:2256\u20132261","journal-title":"J Comput"},{"key":"5212_CR66","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1007\/978-3-540-74827-4_79","volume-title":"Knowledge-Based Intelligent Information and Engineering Systems","author":"P Pellegrini","year":"2007","unstructured":"Pellegrini P, Favaretto D, Moretti E (2007) Multiple ant colony optimization for a rich vehicle routing problem: a case study. In: Apolloni B, Howlett R, Jain L (eds) Knowledge-Based Intelligent Information and Engineering Systems. Springer, Berlin-Heidelberg, pp 627\u2013634"},{"key":"5212_CR67","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/s10107-020-01523-z","volume":"183","author":"A Pessoa","year":"2020","unstructured":"Pessoa A, Sadykov R, Uchoa E, Vanderbeck F (2020) A generic exact solver for vehicle routing and related problems. Math Program 183:483\u2013523","journal-title":"Math Program"},{"key":"5212_CR68","doi-asserted-by":"crossref","first-page":"105475","DOI":"10.1016\/j.cor.2021.105475","volume":"136","author":"E Queiroga","year":"2021","unstructured":"Queiroga E, Sadykov R, Uchoa E (2021) A popmusic matheuristic for the capacitated vehicle routing problem. Comput Oper Res 136:105475","journal-title":"Comput Oper Res"},{"key":"5212_CR69","doi-asserted-by":"crossref","first-page":"102340","DOI":"10.1016\/j.omega.2020.102340","volume":"102","author":"O Quirion-Blais","year":"2021","unstructured":"Quirion-Blais O, Chen L (2021) A case-based reasoning approach to solve the vehicle routing problem with time windows and drivers\u2019 experience. Omega 102:102340","journal-title":"Omega"},{"key":"5212_CR70","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/s00521-020-04983-8","volume":"33","author":"R RamachandranPillai","year":"2021","unstructured":"RamachandranPillai R, Arock M (2021) Spiking neural firefly optimization scheme for the capacitated dynamic vehicle routing problem with time windows. Neural Comput Appl 33:409\u2013432","journal-title":"Neural Comput Appl"},{"key":"5212_CR71","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s41604-019-00010-9","volume":"2","author":"J Rasku","year":"2019","unstructured":"Rasku J, Musliu N, K\u00e4rkk\u00e4inen T (2019) On automatic algorithm configuration of vehicle routing problem solvers. J Vehicle Routing Algorithms 2:1\u201322","journal-title":"J Vehicle Routing Algorithms"},{"key":"5212_CR72","doi-asserted-by":"crossref","unstructured":"Rastani S, \u00c7atay B (2021) A large neighborhood search-based matheuristic for the load-dependent electric vehicle routing problem with time windows. Annals Oper Res","DOI":"10.1007\/s10479-021-04320-9"},{"key":"5212_CR73","doi-asserted-by":"publisher","unstructured":"Sar K, Ghadimi P (2023) A systematic literature review of the vehicle routing problem in reverse logistics operations. Comput Ind Eng 177:109011. https:\/\/doi.org\/10.1016\/j.cie.2023.109011https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0360835223000359","DOI":"10.1016\/j.cie.2023.109011"},{"key":"5212_CR74","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1016\/j.cam.2015.03.050","volume":"291","author":"J Sicilia","year":"2016","unstructured":"Sicilia J, Quemada C, Royo B, Escuin D (2016) An optimization algorithm for solving the rich vehicle routing problem based on variable neighborhood search and tabu search metaheuristics. J Comput Appl Math 291:468\u2013477","journal-title":"J Comput Appl Math"},{"key":"5212_CR75","unstructured":"Siglidis G, Nikolentzos G, Limnios S, Giatsidis C, Skianis K, Vazirgiannis M (2020) GraKeL: a graph kernel library in Python. J Mach Learn Res 21:1\u20135"},{"key":"5212_CR76","doi-asserted-by":"crossref","unstructured":"Sitek P, Wikarek J, Rutczy\u0144ska-Wdowiak K, Bocewicz G, Banaszak Z (2021) Optimization of capacitated vehicle routing problem with alternative delivery, pick-up and time windows: a modified hybrid approach. Neurocomputing 423:670\u2013678","DOI":"10.1016\/j.neucom.2020.02.126"},{"key":"5212_CR77","doi-asserted-by":"publisher","unstructured":"Sluijk N, Florio AM, Kinable J, Dellaert N, Van Woensel T (2023) Two-echelon vehicle routing problems: a literature review. Eur J Oper Res 304:865\u2013886. https:\/\/doi.org\/10.1016\/j.ejor.2022.02.022https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221722001278","DOI":"10.1016\/j.ejor.2022.02.022"},{"key":"5212_CR78","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/j.cor.2015.04.022","volume":"63","author":"K Smith-Miles","year":"2015","unstructured":"Smith-Miles K, Bowly S (2015) Generating new test instances by evolving in instance space. Comput Oper Res 63:102\u2013113","journal-title":"Comput Oper Res"},{"key":"5212_CR79","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 (https:\/\/www.sciencedirect.com\/science\/article\/pii\/S2210650223000196)","journal-title":"Swarm Evol Comput"},{"key":"5212_CR80","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1111\/itor.12001","volume":"22","author":"K S\u00f6rensen","year":"2015","unstructured":"S\u00f6rensen K (2015) Metaheuristics-the metaphor exposed. Int Trans Oper Res 22:3\u201318","journal-title":"Int Trans Oper Res"},{"key":"5212_CR81","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2021.114779","volume":"176","author":"G Srivastava","year":"2021","unstructured":"Srivastava G, Singh A, Mallipeddi R (2021) NSGA-II with objective-specific variation operators for multiobjective vehicle routing problem with time windows. Expert Syst Appl 176:114779","journal-title":"Expert Syst Appl"},{"key":"5212_CR82","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1007\/s13177-022-00310-8","volume":"20","author":"A Susanty","year":"2022","unstructured":"Susanty A, Putri VA, Purwanggono B (2022) Proposed policy to manage the barrier of the implementation of intelligent transportation system. Int J Intell Transp Syst Res 20:540\u2013559. https:\/\/doi.org\/10.1007\/s13177-022-00310-8","journal-title":"Int J Intell Transp Syst Res"},{"key":"5212_CR83","doi-asserted-by":"crossref","first-page":"6665","DOI":"10.1007\/s00500-021-05665-w","volume":"25","author":"K Szwarc","year":"2021","unstructured":"Szwarc K, Nowakowski P, Boryczka U (2021) An evolutionary approach to the vehicle route planning in e-waste mobile collection on demand. Soft Comput 25:6665\u20136680","journal-title":"Soft Comput"},{"key":"5212_CR84","doi-asserted-by":"publisher","unstructured":"Tan F, Chai, Zy, Li, Yl, (2023) Multi-objective evolutionary algorithm for vehicle routing problem with time window under uncertainty. Evol Intel 16:493\u2013508. https:\/\/doi.org\/10.1007\/s12065-021-00672-0","DOI":"10.1007\/s12065-021-00672-0"},{"key":"5212_CR85","doi-asserted-by":"publisher","unstructured":"Tavares L, Lopes H, Lima C (2009) Construction and improvement heuristics applied to the capacitated vehicle routing problem, In: World congress on nature & biologically inspired computing, IEEE. pp 690\u2013695. https:\/\/doi.org\/10.1109\/NABIC.2009.5393467","DOI":"10.1109\/NABIC.2009.5393467"},{"key":"5212_CR86","doi-asserted-by":"crossref","unstructured":"Uchoa E, Pecin D, Pessoa A, Poggi M, Vidal T, Subramanian A (2017) New benchmark instances for the capacitated vehicle routing problem. Eur J Oper Res 257:845\u2013858","DOI":"10.1016\/j.ejor.2016.08.012"},{"key":"5212_CR87","doi-asserted-by":"crossref","first-page":"107131","DOI":"10.1016\/j.cie.2021.107131","volume":"154","author":"F Wang","year":"2021","unstructured":"Wang F, Liao F, Li Y, Yan X, Chen X (2021) An ensemble learning based multi-objective evolutionary algorithm for the dynamic vehicle routing problem with time windows. Comput Ind Eng 154:107131","journal-title":"Comput Ind Eng"},{"key":"5212_CR88","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1109\/JAS.2019.1911348","volume":"6","author":"J Wang","year":"2019","unstructured":"Wang J, Kumbasar T (2019) Parameter optimization of interval type-2 fuzzy neural networks based on pso and bbbc methods. IEEE\/CAA J Autom Sin 6:247\u2013257","journal-title":"IEEE\/CAA J Autom Sin"},{"key":"5212_CR89","doi-asserted-by":"crossref","first-page":"3444","DOI":"10.1109\/TITS.2020.2983398","volume":"22","author":"X Wang","year":"2021","unstructured":"Wang X, Shao S, Tang J (2021) Iterative local-search heuristic for weighted vehicle routing problem. IEEE Trans Intell Transp Syst 22:3444\u20133454","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"5212_CR90","doi-asserted-by":"crossref","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. Knowl-Based Syst 231:107412","journal-title":"Knowl-Based Syst"},{"key":"5212_CR91","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1109\/TCSS.2021.3055823","volume":"8","author":"G Wei","year":"2021","unstructured":"Wei G, Wu Q, Zhou M (2021) A hybrid probabilistic multiobjective evolutionary algorithm for commercial recommendation systems. IEEE Trans Comput Social Syst 8:589\u2013598","journal-title":"IEEE Trans Comput Social Syst"},{"key":"5212_CR92","doi-asserted-by":"crossref","first-page":"105110","DOI":"10.1016\/j.cor.2020.105110","volume":"126","author":"D Wolfinger","year":"2021","unstructured":"Wolfinger D (2021) A large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipments. Comput Oper Res 126:105110","journal-title":"Comput Oper Res"},{"key":"5212_CR93","doi-asserted-by":"publisher","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.110605https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1568494623006233","DOI":"10.1016\/j.asoc.2023.110605"},{"key":"5212_CR94","doi-asserted-by":"publisher","unstructured":"Xue S (2023) An adaptive ant colony algorithm for crowdsourcing multi-depot vehicle routing problem with time windows. Sustain Oper Comput 4:62\u201375. https:\/\/doi.org\/10.1016\/j.susoc.2023.02.002https:\/\/www.sciencedirect.com\/science\/article\/pii\/S2666412723000028","DOI":"10.1016\/j.susoc.2023.02.002"},{"key":"5212_CR95","doi-asserted-by":"crossref","unstructured":"Yang N, Zheng Z, Zhou M, Guo X, Qi L, Wang T (2021) A domain-guided noise-optimization-based inversion method for facial image manipulation. IEEE Trans Image Process 30:6198\u20136211","DOI":"10.1109\/TIP.2021.3089905"},{"key":"5212_CR96","doi-asserted-by":"crossref","first-page":"3806","DOI":"10.1109\/TITS.2019.2909109","volume":"20","author":"JJQ Yu","year":"2019","unstructured":"Yu JJQ, Yu W, Gu J (2019) Online vehicle routing with neural combinatorial optimization and deep reinforcement learning. IEEE Trans Intell Transp Syst 20:3806\u20133817","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"5212_CR97","doi-asserted-by":"crossref","first-page":"1380","DOI":"10.1109\/JAS.2020.1003177","volume":"7","author":"H Yuan","year":"2020","unstructured":"Yuan H, Zhou M, Liu Q, Abusorrah A (2020) Fine-grained resource provisioning and task scheduling for heterogeneous applications in distributed green clouds. IEEE\/CAA J Autom Sin 7:1380\u20131393","journal-title":"IEEE\/CAA J Autom Sin"},{"key":"5212_CR98","doi-asserted-by":"crossref","first-page":"102391","DOI":"10.1016\/j.tre.2021.102391","volume":"152","author":"Y Yuan","year":"2021","unstructured":"Yuan Y, Cattaruzza D, Ogier M, Semet F, Vigo D (2021) A column generation based heuristic for the generalized vehicle routing problem with time windows. Transp Res Part E: Logist Transp Rev 152:102391","journal-title":"Transp Res Part E: Logist Transp Rev"},{"key":"5212_CR99","unstructured":"Zeni GA, Menzori M, Martins PS, Meira LAA (2016) VRPBench: A vehicle routing benchmark tool. arXiv:1610.05402"},{"key":"5212_CR100","doi-asserted-by":"crossref","first-page":"63468","DOI":"10.1109\/ACCESS.2018.2877767","volume":"6","author":"J Zhang","year":"2018","unstructured":"Zhang J, Yang F, Weng X (2018) An evolutionary scatter search particle swarm optimization algorithm for the vehicle routing problem with time windows. IEEE Access 6:63468\u201363485","journal-title":"IEEE Access"},{"key":"5212_CR101","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1109\/JAS.2017.7510817","volume":"5","author":"P Zhang","year":"2018","unstructured":"Zhang P, Shu S, Zhou M (2018) An online fault detection model and strategies based on SVM-grid in clouds. IEEE\/CAA J Autom Sin 5:445\u2013456","journal-title":"IEEE\/CAA J Autom Sin"},{"key":"5212_CR102","doi-asserted-by":"crossref","first-page":"1725","DOI":"10.1109\/TASE.2020.2975225","volume":"17","author":"P Zhang","year":"2020","unstructured":"Zhang P, Zhou M, Wang X (2020) An intelligent optimization method for optimal virtual machine allocation in cloud data centers. IEEE Trans Autom Sci Eng 17:1725\u20131735","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"5212_CR103","doi-asserted-by":"crossref","first-page":"1199","DOI":"10.1109\/JAS.2020.1003539","volume":"8","author":"Z Zhao","year":"2021","unstructured":"Zhao Z, Liu S, Zhou M, Abusorrah A (2021) Dual-objective mixed integer linear program and memetic algorithm for an industrial group scheduling problem. IEEE\/CAA J Autom Sin 8:1199\u20131209","journal-title":"IEEE\/CAA J Autom Sin"},{"key":"5212_CR104","doi-asserted-by":"publisher","unstructured":"Zunic E, Delalic S, Donko D (2020a) Adaptive multi-phase approach for solving the realistic vehicle routing problems in logistics with innovative comparison method for evaluation based on real GPS data. Transp Lett. https:\/\/doi.org\/10.1080\/19427867.2020.1824311","DOI":"10.1080\/19427867.2020.1824311"},{"key":"5212_CR105","doi-asserted-by":"publisher","unstructured":"Zunic E, Donkox D, Supic H, Delalic S (2020b) Cluster-based approach for successful solving real-world vehicle routing problems, In: Proceedings of the federated conference on computer science and information systems, Springer. pp 619\u2013626. https:\/\/doi.org\/10.15439\/2020F184","DOI":"10.15439\/2020F184"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-05212-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-023-05212-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-05212-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T14:08:20Z","timestamp":1730988500000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-023-05212-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1]]},"references-count":105,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["5212"],"URL":"https:\/\/doi.org\/10.1007\/s10489-023-05212-0","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1]]},"assertion":[{"value":"5 December 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Statements & Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}]}}