{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T18:07:13Z","timestamp":1770833233473,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,3,17]],"date-time":"2025-03-17T00:00:00Z","timestamp":1742169600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,3,17]],"date-time":"2025-03-17T00:00:00Z","timestamp":1742169600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"name":"the National Key Research and Development Program of the Corps","award":["2023AB021"],"award-info":[{"award-number":["2023AB021"]}]},{"DOI":"10.13039\/501100012165","name":"Key Technologies Research and Development Program","doi-asserted-by":"publisher","award":["2023AB010"],"award-info":[{"award-number":["2023AB010"]}],"id":[{"id":"10.13039\/501100012165","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012165","name":"Key Technologies Research and Development Program","doi-asserted-by":"publisher","award":["S2023AA5383"],"award-info":[{"award-number":["S2023AA5383"]}],"id":[{"id":"10.13039\/501100012165","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012165","name":"Key Technologies Research and Development Program","doi-asserted-by":"publisher","award":["S2024AB048"],"award-info":[{"award-number":["S2024AB048"]}],"id":[{"id":"10.13039\/501100012165","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100019595","name":"Youth and Middle-aged Scientific and Technological Innovation Leading Talents Program of the Corps","doi-asserted-by":"publisher","award":["2023TSYCCx0120"],"award-info":[{"award-number":["2023TSYCCx0120"]}],"id":[{"id":"10.13039\/501100019595","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100018189","name":"Center for Big Data Analytics, University of Texas at Austin","doi-asserted-by":"publisher","award":["KXO0760202"],"award-info":[{"award-number":["KXO0760202"]}],"id":[{"id":"10.13039\/100018189","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,5]]},"DOI":"10.1007\/s40747-025-01826-8","type":"journal-article","created":{"date-parts":[[2025,3,17]],"date-time":"2025-03-17T16:37:12Z","timestamp":1742229432000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Mcaaco: a multi-objective strategy heuristic search algorithm for solving capacitated vehicle routing problems"],"prefix":"10.1007","volume":"11","author":[{"given":"Yanling","family":"Chen","sequence":"first","affiliation":[]},{"given":"Jingyi","family":"Wei","sequence":"additional","affiliation":[]},{"given":"Tao","family":"Luo","sequence":"additional","affiliation":[]},{"given":"Jie","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,17]]},"reference":[{"issue":"2","key":"1826_CR1","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1109\/TEVC.2023.3265869","volume":"28","author":"Y Li","year":"2024","unstructured":"Li Y, Zhao Q, Yang S et al (2024) Tailoring evolutionary algorithms to solve the multiobjective location-routing problem for biomass waste collection. IEEE Trans Evol Comput 28(2):489\u2013500. https:\/\/doi.org\/10.1109\/TEVC.2023.3265869","journal-title":"IEEE Trans Evol Comput"},{"issue":"10","key":"1826_CR2","doi-asserted-by":"publisher","first-page":"10855","DOI":"10.1109\/TCYB.2021.3069942","volume":"52","author":"YH Jia","year":"2022","unstructured":"Jia YH, Mei Y, Zhang M (2022) A bilevel ant colony optimization algorithm for capacitated electric vehicle routing problem. IEEE Trans Cybern 52(10):10855\u201310868. https:\/\/doi.org\/10.1109\/TCYB.2021.3069942","journal-title":"IEEE Trans Cybern"},{"issue":"8","key":"1826_CR3","doi-asserted-by":"publisher","first-page":"4173","DOI":"10.1109\/TCYB.2019.2950626","volume":"51","author":"J Xiao","year":"2021","unstructured":"Xiao J, Zhang T, Du J et al (2021) An evolutionary multiobjective route grouping-based heuristic algorithm for large-scale capacitated vehicle routing problems. IEEE Trans Cybern 51(8):4173\u20134186. https:\/\/doi.org\/10.1109\/TCYB.2019.2950626","journal-title":"IEEE Trans Cybern"},{"issue":"12","key":"1826_CR4","doi-asserted-by":"publisher","first-page":"25062","DOI":"10.1109\/TITS.2022.3180760","volume":"23","author":"JY Li","year":"2022","unstructured":"Li JY, Deng XY, Zhan ZH et al (2022) A multipopulation multiobjective ant colony system considering travel and prevention costs for vehicle routing in covid-19-like epidemics. IEEE Trans Intell Transp Syst 23(12):25062\u201325076. https:\/\/doi.org\/10.1109\/TITS.2022.3180760","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"1826_CR5","doi-asserted-by":"publisher","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":"6","key":"1826_CR6","doi-asserted-by":"publisher","first-page":"1394","DOI":"10.1109\/TEVC.2022.3144142","volume":"26","author":"YH Jia","year":"2022","unstructured":"Jia YH, Mei Y, Zhang M (2022) Confidence-based ant colony optimization for capacitated electric vehicle routing problem with comparison of different encoding schemes. IEEE Trans Evol Comput 26(6):1394\u20131408. https:\/\/doi.org\/10.1109\/TEVC.2022.3144142","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"1826_CR7","doi-asserted-by":"publisher","first-page":"1661","DOI":"10.1109\/TITS.2021.3105105","volume":"23","author":"K Leng","year":"2022","unstructured":"Leng K, Li S (2022) Distribution path optimization for intelligent logistics vehicles of urban rail transportation using vrp optimization model. IEEE Trans Intell Transp Syst 23(2):1661\u20131669. https:\/\/doi.org\/10.1109\/TITS.2021.3105105","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"10","key":"1826_CR8","doi-asserted-by":"publisher","first-page":"17491","DOI":"10.1109\/TITS.2022.3150471","volume":"23","author":"L Shi","year":"2022","unstructured":"Shi L, Zhan ZH, Liang D et al (2022) Memory-based ant colony system approach for multi-source data associated dynamic electric vehicle dispatch optimization. IEEE Trans Intell Transp Syst 23(10):17491\u201317505. https:\/\/doi.org\/10.1109\/TITS.2022.3150471","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"1","key":"1826_CR9","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1109\/TSMC.2023.3308922","volume":"54","author":"W Huang","year":"2024","unstructured":"Huang W, Ding H, Qiao J (2024) Large-scale and knowledge-based dynamic multiobjective optimization for mswi process using adaptive competitive swarm optimization. IEEE Trans Syst Man Cybern Syst 54(1):379\u2013390. https:\/\/doi.org\/10.1109\/TSMC.2023.3308922","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"issue":"3","key":"1826_CR10","doi-asserted-by":"publisher","first-page":"1583","DOI":"10.1109\/TITS.2020.2972389","volume":"22","author":"X Xu","year":"2021","unstructured":"Xu X, Li J, Zhou M (2021) Delaunay-triangulation-based variable neighborhood search to solve large-scale general colored traveling salesman problems. IEEE Trans Intell Transp Syst 22(3):1583\u20131593. https:\/\/doi.org\/10.1109\/TITS.2020.2972389","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"3","key":"1826_CR11","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1109\/TEVC.2022.3170212","volume":"27","author":"A Awad","year":"2023","unstructured":"Awad A, Hawash A, Abdalhaq B (2023) A genetic algorithm (ga) and swarm-based binary decision diagram (bdd) reordering optimizer reinforced with recent operators. IEEE Trans Evol Comput 27(3):535\u2013549. https:\/\/doi.org\/10.1109\/TEVC.2022.3170212","journal-title":"IEEE Trans Evol Comput"},{"key":"1826_CR12","doi-asserted-by":"publisher","first-page":"125800","DOI":"10.1109\/ACCESS.2023.3325787","volume":"11","author":"N Fr\u00edas","year":"2023","unstructured":"Fr\u00edas N, Johnson F, Valle C (2023) Hybrid algorithms for energy minimizing vehicle routing problem: Integrating clusterization and ant colony optimization. IEEE Access 11:125800\u2013125821. https:\/\/doi.org\/10.1109\/ACCESS.2023.3325787","journal-title":"IEEE Access"},{"issue":"8","key":"1826_CR13","doi-asserted-by":"publisher","first-page":"1786","DOI":"10.1109\/JAS.2024.124548","volume":"11","author":"S Qi","year":"2024","unstructured":"Qi S, Wang R, Zhang T et al (2024) Enhancing evolutionary algorithms with pattern mining for sparse large-scale multi-objective optimization problems. IEEE\/CAA J Autom Sin 11(8):1786\u20131801. https:\/\/doi.org\/10.1109\/JAS.2024.124548","journal-title":"IEEE\/CAA J Autom Sin"},{"issue":"12","key":"1826_CR14","doi-asserted-by":"publisher","first-page":"13572","DOI":"10.1109\/TCYB.2021.3111082","volume":"52","author":"J Li","year":"2022","unstructured":"Li J, Ma Y, Gao R et al (2022) Deep reinforcement learning for solving the heterogeneous capacitated vehicle routing problem. IEEE Trans Cybern 52(12):13572\u201313585. https:\/\/doi.org\/10.1109\/TCYB.2021.3111082","journal-title":"IEEE Trans Cybern"},{"issue":"6","key":"1826_CR15","doi-asserted-by":"publisher","first-page":"5867","DOI":"10.1109\/TITS.2023.3344086","volume":"25","author":"Y Chen","year":"2024","unstructured":"Chen Y, Xue J, Zhou Y et al (2024) An efficient threshold acceptance-based multi-layer search algorithm for capacitated electric vehicle routing problem. IEEE Trans Intell Transp Syst 25(6):5867\u20135879. https:\/\/doi.org\/10.1109\/TITS.2023.3344086","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"1826_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TNNLS.2023.3285077","volume":"11","author":"J Li","year":"2023","unstructured":"Li J, Ma Y, Cao Z et al (2023) Learning feature embedding refiner for solving vehicle routing problems. IEEE Trans Neural Netw Learn Syst 11:1\u201313. https:\/\/doi.org\/10.1109\/TNNLS.2023.3285077","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"6","key":"1826_CR17","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 et al (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"},{"issue":"4","key":"1826_CR18","doi-asserted-by":"publisher","first-page":"2933","DOI":"10.1109\/TASE.2021.3097778","volume":"19","author":"NR Sabar","year":"2022","unstructured":"Sabar NR, Goh SL, Turky A et al (2022) Population-based iterated local search approach for dynamic vehicle routing problems. IEEE Trans Autom Sci Eng 19(4):2933\u20132943. https:\/\/doi.org\/10.1109\/TASE.2021.3097778","journal-title":"IEEE Trans Autom Sci Eng"},{"issue":"7","key":"1826_CR19","doi-asserted-by":"publisher","first-page":"9294","DOI":"10.1109\/TITS.2021.3086154","volume":"23","author":"L Li","year":"2022","unstructured":"Li L, Liang H, Fan P et al (2022) Joint optimization and online algorithms of fuel-aware multi-objective routing for autonomous vehicles. IEEE Trans Intell Transp Syst 23(7):9294\u20139300. https:\/\/doi.org\/10.1109\/TITS.2021.3086154","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"3","key":"1826_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TMAG.2023.3301454","volume":"60","author":"Y Hidaka","year":"2024","unstructured":"Hidaka Y (2024) Multi-objective topology optimization method for hybrid-type motors combining combinatorial optimization and local search. IEEE Trans Magn 60(3):1\u20134. https:\/\/doi.org\/10.1109\/TMAG.2023.3301454","journal-title":"IEEE Trans Magn"},{"issue":"7","key":"1826_CR21","doi-asserted-by":"publisher","first-page":"6571","DOI":"10.1109\/TITS.2021.3058419","volume":"23","author":"S Deb","year":"2022","unstructured":"Deb S, Tammi K, Gao XZ et al (2022) A robust two-stage planning model for the charging station placement problem considering road traffic uncertainty. IEEE Trans Intell Transp Syst 23(7):6571\u20136585. https:\/\/doi.org\/10.1109\/TITS.2021.3058419","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"5","key":"1826_CR22","doi-asserted-by":"publisher","first-page":"2672","DOI":"10.1109\/TCBB.2021.3103777","volume":"19","author":"C Li","year":"2022","unstructured":"Li C, Sun J, Li LW et al (2022) An effective swarm intelligence optimization algorithm for flexible ligand docking. IEEE\/ACM Trans Comput Biol Bioinf 19(5):2672\u20132684. https:\/\/doi.org\/10.1109\/TCBB.2021.3103777","journal-title":"IEEE\/ACM Trans Comput Biol Bioinf"},{"key":"1826_CR23","doi-asserted-by":"publisher","first-page":"121087","DOI":"10.1109\/ACCESS.2023.3328404","volume":"11","author":"M Liu","year":"2023","unstructured":"Liu M, Zhao Q, Song Q et al (2023) A hybrid brain storm optimization algorithm for dynamic vehicle routing problem with time windows. IEEE Access 11:121087\u2013121095. https:\/\/doi.org\/10.1109\/ACCESS.2023.3328404","journal-title":"IEEE Access"},{"issue":"5","key":"1826_CR24","doi-asserted-by":"publisher","first-page":"2725","DOI":"10.1109\/TCYB.2019.2931288","volume":"51","author":"SM Zandavi","year":"2021","unstructured":"Zandavi SM, Chung VYY, Anaissi A (2021) Stochastic dual simplex algorithm: a novel heuristic optimization algorithm. IEEE Trans Cybern 51(5):2725\u20132734. https:\/\/doi.org\/10.1109\/TCYB.2019.2931288","journal-title":"IEEE Trans Cybern"},{"issue":"11","key":"1826_CR25","doi-asserted-by":"publisher","first-page":"7348","DOI":"10.1109\/TII.2021.3049338","volume":"17","author":"X Li","year":"2021","unstructured":"Li X, Xing K (2021) Iterative widen heuristic beam search algorithm for scheduling problem of flexible assembly systems. IEEE Trans Ind Inf 17(11):7348\u20137358. https:\/\/doi.org\/10.1109\/TII.2021.3049338","journal-title":"IEEE Trans Ind Inf"},{"issue":"9","key":"1826_CR26","doi-asserted-by":"publisher","first-page":"8529","DOI":"10.1109\/TVT.2021.3097203","volume":"70","author":"J Wen","year":"2021","unstructured":"Wen J, Yang J, Wang T (2021) Path planning for autonomous underwater vehicles under the influence of ocean currents based on a fusion heuristic algorithm. IEEE Trans Veh Technol 70(9):8529\u20138544. https:\/\/doi.org\/10.1109\/TVT.2021.3097203","journal-title":"IEEE Trans Veh Technol"},{"issue":"10","key":"1826_CR27","doi-asserted-by":"publisher","first-page":"6122","DOI":"10.1109\/TSMC.2019.2958494","volume":"51","author":"X Wang","year":"2021","unstructured":"Wang X, Xing K, Feng Y et al (2021) Scheduling of flexible manufacturing systems subject to no-wait constraints via petri nets and heuristic search. IEEE Trans Syst Man Cybern Syst 51(10):6122\u20136133. https:\/\/doi.org\/10.1109\/TSMC.2019.2958494","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"issue":"3","key":"1826_CR28","doi-asserted-by":"publisher","first-page":"1403","DOI":"10.1109\/TCYB.2022.3199147","volume":"54","author":"C Luo","year":"2024","unstructured":"Luo C, Xing W, Cai S et al (2024) Nusc: an effective local search algorithm for solving the set covering problem. IEEE Trans Cybern 54(3):1403\u20131416. https:\/\/doi.org\/10.1109\/TCYB.2022.3199147","journal-title":"IEEE Trans Cybern"},{"key":"1826_CR29","doi-asserted-by":"publisher","first-page":"97142","DOI":"10.1109\/ACCESS.2022.3205756","volume":"10","author":"J Wang","year":"2022","unstructured":"Wang J, Zhang P, Zhang H et al (2022) A carnivorous plant algorithm with heuristic decoding method for traveling salesman problem. IEEE Access 10:97142\u201397164. https:\/\/doi.org\/10.1109\/ACCESS.2022.3205756","journal-title":"IEEE Access"},{"key":"1826_CR30","doi-asserted-by":"publisher","unstructured":"Gao S, Yu Y, Wang Y et al (2021) Chaotic local search-based differential evolution algorithms for optimization. IEEE Trans Syst Man Cybern Syst 51(6):3954\u20133967. https:\/\/doi.org\/10.1109\/TSMC.2019.2956121","DOI":"10.1109\/TSMC.2019.2956121"},{"issue":"9","key":"1826_CR31","doi-asserted-by":"publisher","first-page":"9121","DOI":"10.1109\/TITS.2023.3266807","volume":"24","author":"C Wang","year":"2023","unstructured":"Wang C, Liu R, Su Y et al (2023) Accelerating two-phase multiobjective evolutionary algorithm for electric location-routing problems. IEEE Trans Intell Transp Syst 24(9):9121\u20139136. https:\/\/doi.org\/10.1109\/TITS.2023.3266807","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"8","key":"1826_CR32","doi-asserted-by":"publisher","first-page":"8286","DOI":"10.1109\/TCYB.2020.3043265","volume":"52","author":"Y Zhang","year":"2022","unstructured":"Zhang Y, Mei Y, Huang S et al (2022) A route clustering and search heuristic for large-scale multidepot-capacitated arc routing problem. IEEE Trans Cybern 52(8):8286\u20138299. https:\/\/doi.org\/10.1109\/TCYB.2020.3043265","journal-title":"IEEE Trans Cybern"},{"issue":"7","key":"1826_CR33","doi-asserted-by":"publisher","first-page":"5695","DOI":"10.1109\/TCYB.2021.3108597","volume":"52","author":"H Huang","year":"2022","unstructured":"Huang H, Yang S, Li X et al (2022) An embedded Hamiltonian graph-guided heuristic algorithm for two-echelon vehicle routing problem. IEEE Trans Cybern 52(7):5695\u20135707. https:\/\/doi.org\/10.1109\/TCYB.2021.3108597","journal-title":"IEEE Trans Cybern"},{"issue":"12","key":"1826_CR34","doi-asserted-by":"publisher","first-page":"13930","DOI":"10.1109\/TITS.2023.3308593","volume":"24","author":"J Li","year":"2023","unstructured":"Li J, Liu R, Wang R (2023) Elastic strategy-based adaptive genetic algorithm for solving dynamic vehicle routing problem with time windows. IEEE Trans Intell Transp Syst 24(12):13930\u201313947. https:\/\/doi.org\/10.1109\/TITS.2023.3308593","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"5","key":"1826_CR35","doi-asserted-by":"publisher","first-page":"1413","DOI":"10.1109\/TEVC.2022.3211954","volume":"27","author":"SJ Jian","year":"2023","unstructured":"Jian SJ, Hsieh SY (2023) A niching regression adaptive memetic algorithm for multimodal optimization of the Euclidean traveling salesman problem. IEEE Trans Evol Comput 27(5):1413\u20131426. https:\/\/doi.org\/10.1109\/TEVC.2022.3211954","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"1826_CR36","doi-asserted-by":"publisher","first-page":"1682","DOI":"10.1109\/TITS.2022.3220429","volume":"24","author":"EHC Lu","year":"2023","unstructured":"Lu EHC, Syu SS (2023) One-way search algorithm for route planning with multiple requests. IEEE Trans Intell Transp Syst 24(2):1682\u20131691. https:\/\/doi.org\/10.1109\/TITS.2022.3220429","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"1826_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.116118","volume":"189","author":"Q Gu","year":"2022","unstructured":"Gu Q, Liu Y, Chen L et al (2022) An improved competitive particle swarm optimization for many-objective optimization problems. Expert Syst Appl 189:116118. https:\/\/doi.org\/10.1016\/j.eswa.2021.116118","journal-title":"Expert Syst Appl"},{"issue":"12","key":"1826_CR38","doi-asserted-by":"publisher","first-page":"15217","DOI":"10.1007\/s10462-023-10526-z","volume":"56","author":"H Ma","year":"2023","unstructured":"Ma H, Zhang Y, Sun S et al (2023) A comprehensive survey on nsga-ii for multi-objective optimization and applications. Artif Intell Rev 56(12):15217\u201315270. https:\/\/doi.org\/10.1007\/s10462-023-10526-z","journal-title":"Artif Intell Rev"},{"key":"1826_CR39","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.118414","volume":"210","author":"B Li","year":"2022","unstructured":"Li B, Wang H (2022) Multi-objective sparrow search algorithm: A novel algorithm for solving complex multi-objective optimisation problems. Expert Syst Appl 210:118414. https:\/\/doi.org\/10.1016\/j.eswa.2022.118414","journal-title":"Expert Syst Appl"}],"container-title":["Complex & Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-025-01826-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-025-01826-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-025-01826-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T10:36:22Z","timestamp":1745922982000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-025-01826-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,17]]},"references-count":39,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,5]]}},"alternative-id":["1826"],"URL":"https:\/\/doi.org\/10.1007\/s40747-025-01826-8","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,17]]},"assertion":[{"value":"26 September 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 March 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":"All the authors declare that they have no competing financial interests or personal relationships that could influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This study did not involve human participants or animals, so no ethical approval or consent to participate is required.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}}],"article-number":"211"}}