{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T12:21:22Z","timestamp":1761394882376,"version":"build-2065373602"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,9,22]],"date-time":"2025-09-22T00:00:00Z","timestamp":1758499200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,22]],"date-time":"2025-09-22T00:00:00Z","timestamp":1758499200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62272418","62102058"],"award-info":[{"award-number":["62272418","62102058"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100017577","name":"Basic public welfare research program of Zhejiang Province","doi-asserted-by":"crossref","award":["No.LGG18E050011"],"award-info":[{"award-number":["No.LGG18E050011"]}],"id":[{"id":"10.13039\/501100017577","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Major Open Project of Key Laboratory for Advanced Design and Intelligent Computing of the Ministry of Education","award":["ADIC2023ZD001"],"award-info":[{"award-number":["ADIC2023ZD001"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Evol. Intel."],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1007\/s12065-025-01082-2","type":"journal-article","created":{"date-parts":[[2025,9,22]],"date-time":"2025-09-22T17:53:58Z","timestamp":1758563638000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Matrix-based particle swarm optimization with hybrid strategy for multi-traveling salesman problem"],"prefix":"10.1007","volume":"18","author":[{"given":"Zhaoquan","family":"Huang","sequence":"first","affiliation":[]},{"given":"Donglin","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Changjun","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Shi","family":"Cheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,22]]},"reference":[{"key":"1082_CR1","first-page":"225","volume":"7","author":"M J\u00fcnger","year":"1995","unstructured":"J\u00fcnger M, Reinelt G, Rinaldi G (1995) The traveling salesman problem. Handb Oper Res Manag Sci 7:225\u2013330","journal-title":"Handb Oper Res Manag Sci"},{"key":"1082_CR2","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.omega.2004.10.004","volume":"34","author":"T Bektas","year":"2006","unstructured":"Bektas T (2006a) The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34:209\u2013219","journal-title":"Omega"},{"key":"1082_CR3","first-page":"71","volume":"57","author":"S Baressi \u0160egota","year":"2019","unstructured":"Baressi \u0160egota S, Lorencin I, Ohkura K, Car Z (2019) On the traveling salesman problem in nautical environments: an evolutionary computing approach to optimization of tourist route paths in Medulin, Croatia. Pomorski Zbornik 57:71\u201387","journal-title":"Pomorski Zbornik"},{"key":"1082_CR4","doi-asserted-by":"crossref","first-page":"e0257317","DOI":"10.1371\/journal.pone.0257317","volume":"16","author":"S Liang","year":"2021","unstructured":"Liang S, Jiao T, Du W, Qu S (2021) An improved ant colony optimization algorithm based on context for tourism route planning. PLoS ONE 16:e0257317","journal-title":"PLoS ONE"},{"key":"1082_CR5","doi-asserted-by":"crossref","first-page":"3973","DOI":"10.1007\/s40747-021-00635-z","volume":"8","author":"S Li","year":"2022","unstructured":"Li S, Luo T, Wang L, Xing L, Ren T (2022) Tourism route optimization based on improved knowledge ant colony algorithm. Complex Intell Syst 8:3973\u20133988","journal-title":"Complex Intell Syst"},{"key":"1082_CR6","first-page":"6467086","volume":"2022","author":"B Lu","year":"2022","unstructured":"Lu B, Zhou C (2022) Particle swarm algorithm and its application in tourism route design and optimization. Comput Intell Neurosci 2022:6467086","journal-title":"Comput Intell Neurosci"},{"key":"1082_CR7","first-page":"1","volume":"42","author":"M Akhand","year":"2015","unstructured":"Akhand M, Akter S, Rashid MA, Yaakob S (2015) Velocity tentative PSO: an optimal velocity implementation based particle swarm optimization to solve traveling salesman problem. IAENG Int J Comput Sci 42:1\u201312","journal-title":"IAENG Int J Comput Sci"},{"key":"1082_CR8","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.swevo.2018.02.017","volume":"42","author":"Y Zhong","year":"2018","unstructured":"Zhong Y, Lin J, Wang L, Zhang H (2018) Discrete comprehensive learning particle swarm optimization algorithm with metropolis acceptance criterion for traveling salesman problem. Swarm Evol Comput 42:77\u201388","journal-title":"Swarm Evol Comput"},{"key":"1082_CR9","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/j.ejor.2005.04.027","volume":"175","author":"AE Carter","year":"2006","unstructured":"Carter AE, Ragsdale CT (2006) A new approach to solving the multiple traveling salesperson problem using genetic algorithms. Eur J Oper Res 175:246\u2013257","journal-title":"Eur J Oper Res"},{"key":"1082_CR10","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/j.cie.2016.12.017","volume":"106","author":"Y Wang","year":"2017","unstructured":"Wang Y, Chen Y, Lin Y (2017) Memetic algorithm based on sequential variable neighborhood descent for the minmax multiple traveling salesman problem. Comput Ind Eng 106:105\u2013122","journal-title":"Comput Ind Eng"},{"key":"1082_CR11","doi-asserted-by":"crossref","unstructured":"Junjie P, Dingwei W (2006) An ant colony optimization algorithm for multiple travelling salesman problem. In: First International Conference on Innovative Computing, Information and Control-Volume I (ICICIC\u201906), vol 1. IEEE, pp 210\u2013213","DOI":"10.1109\/ICICIC.2006.40"},{"key":"1082_CR12","doi-asserted-by":"crossref","unstructured":"Liu W, Li S, Zhao F, Zheng A (2009) An ant colony optimization algorithm for the multiple traveling salesmen problem. In: 2009 4th IEEE conference on industrial electronics and applications. IEEE, pp 1533\u20131537","DOI":"10.1109\/ICIEA.2009.5138451"},{"key":"1082_CR13","doi-asserted-by":"crossref","first-page":"105192","DOI":"10.1016\/j.cor.2020.105192","volume":"129","author":"K Karabulut","year":"2021","unstructured":"Karabulut K, \u00d6ztop H, Kandiller L, Tasgetiren MF (2021) Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach. Comput Oper Res 129:105192","journal-title":"Comput Oper Res"},{"key":"1082_CR14","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.asoc.2014.09.029","volume":"26","author":"P Venkatesh","year":"2015","unstructured":"Venkatesh P, Singh A (2015) Two metaheuristic approaches for the multiple traveling salesperson problem. Appl Soft Comput 26:74\u201389","journal-title":"Appl Soft Comput"},{"key":"1082_CR15","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/j.cie.2015.10.010","volume":"90","author":"B Soylu","year":"2015","unstructured":"Soylu B (2015) A general variable neighborhood search heuristic for multiple traveling salesmen problem. Comput Ind Eng 90:390\u2013401","journal-title":"Comput Ind Eng"},{"key":"1082_CR16","unstructured":"Vandermeulen I, Gro\u00df R, Kolling A (2019) Balanced task allocation by partitioning the multiple traveling salesperson problem. In: 2019 international conference on autonomous agents and multiagent systems. ACM, pp 1479\u20131487"},{"key":"1082_CR17","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/j.jclepro.2015.05.036","volume":"111","author":"A Kir\u00e1ly","year":"2016","unstructured":"Kir\u00e1ly A, Christidou M, Chov\u00e1n T, Karlopoulos E, Abonyi J (2016) Minimization of off-grade production in multi-site multi-product plants by solving multiple traveling salesman problem. J Clean Prod 111:253\u2013261","journal-title":"J Clean Prod"},{"key":"1082_CR18","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/j.ijpe.2016.03.005","volume":"176","author":"S Shiri","year":"2016","unstructured":"Shiri S, Huynh N (2016) Optimization of drayage operations with time-window constraints. Int J Prod Econ 176:7\u201320","journal-title":"Int J Prod Econ"},{"key":"1082_CR19","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/S0377-2217(99)00380-X","volume":"124","author":"L Tang","year":"2000","unstructured":"Tang L, Liu J, Rong A, Yang Z (2000) A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan iron & steel complex. Eur J Oper Res 124:267\u2013282","journal-title":"Eur J Oper Res"},{"key":"1082_CR20","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1080\/02564602.2015.1057770","volume":"33","author":"M Anantathanavit","year":"2016","unstructured":"Anantathanavit M, Munlin M (2016) Using k-means radius particle swarm optimization for the travelling salesman problem. IETE Tech Rev 33:172\u2013180","journal-title":"IETE Tech Rev"},{"key":"1082_CR21","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.swevo.2015.05.002","volume":"24","author":"N Lynn","year":"2015","unstructured":"Lynn N, Suganthan PN (2015) Heterogeneous comprehensive learning particle swarm optimization with enhanced exploration and exploitation. Swarm Evol Comput 24:11\u201324","journal-title":"Swarm Evol Comput"},{"key":"1082_CR22","doi-asserted-by":"crossref","unstructured":"Selmi ATE, Zerarka MF, Cheriet A, Femmam S (2023) Improving time efficiency of a hierarchical metaheuristic for the euclidean tsp using crossed cubes interconnection networks. In: Proceedings of the 2023 6th international conference on E-business, information management and computer science, pp 50\u201356","DOI":"10.1145\/3644479.3644488"},{"key":"1082_CR23","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/j.asoc.2014.09.031","volume":"25","author":"W Elloumi","year":"2014","unstructured":"Elloumi W, El Abed H, Abraham A, Alimi AM (2014) A comparative study of the improvement of performance using a PSO modified by ACO applied to TSP. Appl Soft Comput 25:234\u2013241","journal-title":"Appl Soft Comput"},{"key":"1082_CR24","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1109\/TETCI.2020.3047410","volume":"6","author":"Z-H Zhan","year":"2021","unstructured":"Zhan Z-H, Zhang J, Lin Y, Li J-Y, Huang T, Guo X-Q, Wei F-F, Kwong S, Zhang X-Y, You R (2021) Matrix-based evolutionary computation. IEEE Trans Emerg Top Comput Intell 6:315\u2013328","journal-title":"IEEE Trans Emerg Top Comput Intell"},{"key":"1082_CR25","volume":"170","author":"J-K Li","year":"2025","unstructured":"Li J-K, Li R-H, Li J-Q, Yu X, Xu Y (2025) A multi-dimensional co-evolutionary algorithm for multi-objective resource-constrained flexible flowshop with robotic transportation. Appl Soft Comput 170:112689","journal-title":"Appl Soft Comput"},{"key":"1082_CR26","doi-asserted-by":"crossref","first-page":"110855","DOI":"10.1016\/j.cie.2024.110855","volume":"200","author":"J Li","year":"2025","unstructured":"Li J, Li J, Xu Y (2025) HGNP: a PCA-based heterogeneous graph neural network for a family distributed flexible job shop. Comput Ind Eng 200:110855","journal-title":"Comput Ind Eng"},{"key":"1082_CR27","doi-asserted-by":"crossref","first-page":"7291","DOI":"10.1109\/TSMC.2024.3449413","volume":"54","author":"J Li","year":"2024","unstructured":"Li J, Li J, Gao K, Duan P (2024) A hybrid graph-based imitation learning method for a realistic distributed hybrid flow shop with family setup time. IEEE Trans Syst Man Cybern Syst 54:7291\u20137304","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"1082_CR28","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1142\/S0219622007002447","volume":"6","author":"EC Brown","year":"2007","unstructured":"Brown EC, Ragsdale CT, Carter AE (2007) A grouping genetic algorithm for the multiple traveling salesperson problem. Int J Inf Technol Decis Mak 6:333\u2013347","journal-title":"Int J Inf Technol Decis Mak"},{"key":"1082_CR29","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s00500-008-0312-1","volume":"13","author":"A Singh","year":"2009","unstructured":"Singh A, Baghel AS (2009) A new grouping genetic algorithm approach to the multiple traveling salesperson problem. Soft Comput 13:95\u2013101","journal-title":"Soft Comput"},{"key":"1082_CR30","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.ejor.2013.01.043","volume":"228","author":"S Yuan","year":"2013","unstructured":"Yuan S, Skinner B, Huang S, Liu D (2013) A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms. Eur J Oper Res 228:72\u201382","journal-title":"Eur J Oper Res"},{"key":"1082_CR31","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1016\/j.asoc.2018.11.048","volume":"76","author":"L-C Lu","year":"2019","unstructured":"Lu L-C, Yue T-W (2019) Mission-oriented ant-team ACO for min\u2013max MTSP. Appl Soft Comput 76:436\u2013444","journal-title":"Appl Soft Comput"},{"key":"1082_CR32","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of ICNN\u201995-international conference on neural networks, vol 4. IEEE, pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"key":"1082_CR33","first-page":"1204","volume":"8","author":"W Zhao","year":"2021","unstructured":"Zhao W, Shi T, Wang L, Cao Q, Zhang H (2021) An adaptive hybrid atom search optimization with particle swarm optimization and its application to optimal no-load PID design of hydro-turbine governor. J Comput Des Eng 8:1204\u20131233","journal-title":"J Comput Des Eng"},{"key":"1082_CR34","first-page":"427","volume":"7","author":"A Pandey","year":"2020","unstructured":"Pandey A, Panwar VS, Hasan ME, Parhi DR (2020) V-rep-based navigation of automated wheeled robot between obstacles using PSO-tuned feedforward neural network. J Comput Des Eng 7:427\u2013434","journal-title":"J Comput Des Eng"},{"key":"1082_CR35","doi-asserted-by":"crossref","first-page":"101505","DOI":"10.1016\/j.jobe.2020.101505","volume":"32","author":"Z Yong","year":"2020","unstructured":"Yong Z, Li-Juan Y, Qian Z, Xiao-Yan S (2020) Multi-objective optimization of building energy performance using a particle swarm optimizer with less control parameters. J Build Eng 32:101505","journal-title":"J Build Eng"},{"key":"1082_CR36","first-page":"705","volume":"8","author":"MR Islam","year":"2021","unstructured":"Islam MR, Ali SM, Fathollahi-Fard AM, Kabir G (2021) A novel particle swarm optimization-based grey model for the prediction of warehouse performance. J Comput Des Eng 8:705\u2013727","journal-title":"J Comput Des Eng"},{"key":"1082_CR37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3340848","volume":"13","author":"Y Xue","year":"2019","unstructured":"Xue Y, Xue B, Zhang M (2019) Self-adaptive particle swarm optimization for large-scale feature selection in classification. ACM Trans Knowl Discov Data (TKDD) 13:1\u201327","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"key":"1082_CR38","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1109\/TEVC.2005.857610","volume":"10","author":"JJ Liang","year":"2006","unstructured":"Liang JJ, Qin AK, Suganthan PN, Baskar S (2006) Comprehensive learning particle swarm optimizer for global optimization of multimodal functions. IEEE Trans Evol Comput 10:281\u2013295","journal-title":"IEEE Trans Evol Comput"},{"key":"1082_CR39","doi-asserted-by":"crossref","first-page":"107132","DOI":"10.1016\/j.asoc.2021.107132","volume":"103","author":"X Zhang","year":"2021","unstructured":"Zhang X, Sun W, Xue M, Lin A (2021) Probability-optimal leader comprehensive learning particle swarm optimization with Bayesian iteration. Appl Soft Comput 103:107132","journal-title":"Appl Soft Comput"},{"key":"1082_CR40","doi-asserted-by":"crossref","first-page":"121597","DOI":"10.1016\/j.eswa.2023.121597","volume":"237","author":"D Zhu","year":"2024","unstructured":"Zhu D, Wang S, Zhou C, Yan S, Xue J (2024) Human memory optimization algorithm: a memory-inspired optimizer for global optimization problems. Expert Syst Appl 237:121597","journal-title":"Expert Syst Appl"},{"key":"1082_CR41","doi-asserted-by":"crossref","first-page":"119140","DOI":"10.1016\/j.ins.2023.119140","volume":"642","author":"C Liu","year":"2023","unstructured":"Liu C, Ge S, Zhang Y (2023) Identifying the cardinality-constrained critical nodes with a hybrid evolutionary algorithm. Inf Sci 642:119140","journal-title":"Inf Sci"},{"key":"1082_CR42","doi-asserted-by":"crossref","first-page":"7077","DOI":"10.1109\/TNNLS.2024.3386717","volume":"36","author":"C Liu","year":"2025","unstructured":"Liu C, Cong J, Liu G, Jiang G, Xu X, Zhu E (2025) Boosting reinforcement learning via hierarchical game playing with state relay. IEEE Trans Neural Netw Learn Syst 36:7077\u20137089","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"1082_CR43","doi-asserted-by":"crossref","first-page":"101274","DOI":"10.1016\/j.swevo.2023.101274","volume":"78","author":"W Li","year":"2023","unstructured":"Li W, Liang P, Sun B, Sun Y, Huang Y (2023) Reinforcement learning-based particle swarm optimization with neighborhood differential mutation strategy. Swarm Evol Comput 78:101274","journal-title":"Swarm Evol Comput"},{"key":"1082_CR44","doi-asserted-by":"crossref","first-page":"11753","DOI":"10.1109\/TITS.2024.3381344","volume":"25","author":"P-F Sun","year":"2024","unstructured":"Sun P-F, Li J-Y, Li M-Y, Gao Z-Y, Jin H, Jeon S-W, Zhang J (2024) Tour multi-route planning with matrix-based differential evolution. IEEE Trans Intell Transp Syst 25:11753\u201311767","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"1082_CR45","doi-asserted-by":"crossref","first-page":"108731","DOI":"10.1016\/j.asoc.2022.108731","volume":"121","author":"T Li","year":"2022","unstructured":"Li T, Shi J, Deng W, Hu Z (2022) Pyramid particle swarm optimization with novel strategies of competition and cooperation. Appl Soft Comput 121:108731","journal-title":"Appl Soft Comput"},{"key":"1082_CR46","doi-asserted-by":"crossref","first-page":"127195","DOI":"10.1016\/j.neucom.2023.127195","volume":"572","author":"E Zhu","year":"2024","unstructured":"Zhu E, Wang H, Zhang Y, Zhang K, Liu C (2024) PHEE: identifying influential nodes in social networks with a phased evaluation-enhanced search. Neurocomputing 572:127195","journal-title":"Neurocomputing"},{"key":"1082_CR47","doi-asserted-by":"crossref","unstructured":"Jackson EA (1989) Perspectives of nonlinear dynamics: volume 1, vol 1. CUP Archive","DOI":"10.1017\/CBO9780511623974"},{"key":"1082_CR48","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.physd.2016.02.004","volume":"326","author":"E Braverman","year":"2016","unstructured":"Braverman E, Kelly C, Rodkina A (2016) Stabilisation of difference equations with noisy prediction-based control. Physica D 326:21\u201331","journal-title":"Physica D"},{"key":"1082_CR49","doi-asserted-by":"crossref","first-page":"105789","DOI":"10.1016\/j.knosys.2020.105789","volume":"196","author":"Y Zhang","year":"2020","unstructured":"Zhang Y, Liu X, Bao F, Chi J, Zhang C, Liu P (2020) Particle swarm optimization with adaptive learning strategy. Knowl-Based Syst 196:105789","journal-title":"Knowl-Based Syst"},{"key":"1082_CR50","doi-asserted-by":"crossref","first-page":"3210","DOI":"10.3390\/math11143210","volume":"11","author":"HM Nayyef","year":"2023","unstructured":"Nayyef HM, Ibrahim AA, Mohd Zainuri MAA, Zulkifley MA, Shareef H (2023) A novel hybrid algorithm based on jellyfish search and particle swarm optimization. Mathematics 11:3210","journal-title":"Mathematics"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-025-01082-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12065-025-01082-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-025-01082-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T12:18:00Z","timestamp":1761394680000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12065-025-01082-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,22]]},"references-count":50,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["1082"],"URL":"https:\/\/doi.org\/10.1007\/s12065-025-01082-2","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"type":"print","value":"1864-5909"},{"type":"electronic","value":"1864-5917"}],"subject":[],"published":{"date-parts":[[2025,9,22]]},"assertion":[{"value":"24 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 June 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 September 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical and informed consent for data used"}}],"article-number":"107"}}