{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T14:48:24Z","timestamp":1782485304911,"version":"3.54.5"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T00:00:00Z","timestamp":1782432000000},"content-version":"vor","delay-in-days":25,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100006382","name":"Universidad de Oviedo","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100006382","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2026,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>This study focuses on an industrial facility\u2019s time-slot allotment (TSA) problem, where loading and unloading docks are assigned to the incoming lorries, reducing the number of them waiting for service. Several constraints apply to the different dock stations, including disparate timetables and task duration, various capacities of simultaneous services, etc. Evolutionary algorithms cope with the enormous variability of the combinatorial problem, maximizing the number of accepted lorries while decreasing the queue at the entrance. Interestingly, the problem\u2019s structure led to unconventional operator probabilities, which also analyzes the evolutionary techniques and operators included in this study. Comparative analysis with state-of-the-art methods highlights the algorithm\u2019s effectiveness, though computational demands rise with population size.<\/jats:p>","DOI":"10.1007\/s10489-026-07334-7","type":"journal-article","created":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T14:07:26Z","timestamp":1782482846000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimizing time slot allocation in complex multi-dock truck loading and unloading operations using evolutionary algorithms"],"prefix":"10.1007","volume":"56","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7125-9421","authenticated-orcid":false,"given":"Enol","family":"Garc\u00eda Gonz\u00e1lez","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jos\u00e9 R.","family":"Villar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Javier","family":"Sedano","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Camelia","family":"Chira","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,26]]},"reference":[{"key":"7334_CR1","doi-asserted-by":"crossref","unstructured":"Ghoniem A, Farhadi F, Reihaneh M (2015) An accelerated branch-and-price algorithm for multiple-runway aircraft sequencing problems. Eur J Oper Res 246:34\u201343. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221715003124","DOI":"10.1016\/j.ejor.2015.04.019"},{"key":"7334_CR2","doi-asserted-by":"crossref","unstructured":"Friswell R, Williamson A (2019) Management of heavy truck driver queuing and waiting for loading and unloading at road transport customers\u2019 depots. Saf Sci 120:194\u2013205. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0925753518320708","DOI":"10.1016\/j.ssci.2019.06.039"},{"key":"7334_CR3","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1109\/TSC.2016.2518187","volume":"11","author":"X Li","year":"2018","unstructured":"Li X, Qian L, Ruiz R (2018) Cloud workflow scheduling with deadlines and time slot availability. IEEE Trans Serv Comput 11:329\u2013340","journal-title":"IEEE Trans Serv Comput"},{"key":"7334_CR4","doi-asserted-by":"crossref","unstructured":"Zaidi I, Oulamara A, Idoumghar L, Basset M, Zarges C, Verel S (eds) (2021) Hybrid heuristic and metaheuristic for solving electric vehicle charging scheduling problem. In: Zarges C, Verel S (eds) Evolutionary computation in combinatorial optimization. Springer International Publishing, Cham, pp 219\u2013235","DOI":"10.1007\/978-3-030-72904-2_14"},{"key":"7334_CR5","doi-asserted-by":"crossref","unstructured":"Witteman M, Deng Q, Santos BF (2021) A bin packing approach to solve the aircraft maintenance task allocation problem. Eur J Oper Res 294:365\u2013376. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221721000576","DOI":"10.1016\/j.ejor.2021.01.027"},{"key":"7334_CR6","doi-asserted-by":"crossref","unstructured":"Katsigiannis,FA Zografos KG (2022) Incorporating slot valuation in making airport slot scheduling decisions. European Journal of Operational Research. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221722008657","DOI":"10.1016\/j.ejor.2022.11.008"},{"key":"7334_CR7","doi-asserted-by":"crossref","unstructured":"Hagspihl T, Kolisch R, Ruf C, Schiffels S (2022) Dynamic gate configurations at airports: A network optimization approach. Eur J Oper Res 301:1133\u20131148. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S037722172101033X","DOI":"10.1016\/j.ejor.2021.12.016"},{"key":"7334_CR8","doi-asserted-by":"crossref","unstructured":"Klanke C, Engell S (2022) Scheduling and batching with evolutionary algorithms in simulation-optimization of an industrial formulation plant. Comput Ind Eng 174:108760. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0360835222007483","DOI":"10.1016\/j.cie.2022.108760"},{"key":"7334_CR9","doi-asserted-by":"crossref","unstructured":"Lee LH, Chew EP, Teng S, Chen Y (2008) Multi-objective simulation-based evolutionary algorithm for an aircraft spare parts allocation problem. Eur J Oper Res 189:476\u2013491. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221707005139","DOI":"10.1016\/j.ejor.2007.05.036"},{"key":"7334_CR10","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1016\/j.asoc.2018.01.010","volume":"65","author":"J Garc\u00eda-\u00c1lvarez","year":"2018","unstructured":"Garc\u00eda-\u00c1lvarez J, Gonz\u00e1lez MA, Vela CR (2018) Metaheuristics for solving a real-world electric vehicle charging scheduling problem. Appl Soft Comput 65:292\u2013306","journal-title":"Appl Soft Comput"},{"key":"7334_CR11","doi-asserted-by":"crossref","unstructured":"Bazgosha A, Ranjbar M, Jamili N (2017) Scheduling of loading and unloading operations in a multi stations transshipment terminal with release date and inventory constraints. Comput Ind Eng 106:20\u201331. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0360835217300426","DOI":"10.1016\/j.cie.2017.01.023"},{"key":"7334_CR12","doi-asserted-by":"publisher","first-page":"1738","DOI":"10.1016\/j.engappai.2011.12.003","volume":"25","author":"S Adhau","year":"2012","unstructured":"Adhau S, Mittal M, Mittal A (2012) A multi-agent system for distributed multi-project scheduling: An auction-based negotiation approach. Eng Appl Artif Intell 25:1738\u20131751","journal-title":"Eng Appl Artif Intell"},{"key":"7334_CR13","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.comcom.2019.09.021","volume":"149","author":"V Hassija","year":"2020","unstructured":"Hassija V, Saxena V, Chamola V (2020) Scheduling drone charging for multi-drone network based on consensus time-stamp and game theory. Comput Commun 149:51\u201361","journal-title":"Comput Commun"},{"key":"7334_CR14","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1016\/j.jss.2005.06.040","volume":"79","author":"P Jalote","year":"2006","unstructured":"Jalote P, Jain G (2006) Assigning tasks in a 24-h software development model. J Syst Softw 79:904\u2013911","journal-title":"J Syst Softw"},{"key":"7334_CR15","doi-asserted-by":"crossref","unstructured":"Melchiori L, Nasini G, Montagna JM, Corsano G (2022) A mathematical modeling for simultaneous routing and scheduling of logging trucks in the forest supply chain. Forest Policy Econ 136:102693. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1389934122000053","DOI":"10.1016\/j.forpol.2022.102693"},{"key":"7334_CR16","doi-asserted-by":"crossref","unstructured":"Rigas ES, Ramchurn SD, Bassiliades N, Koutitas G, IEEE (ed) (2013) Congestion management for urban ev charging systems. In: 2013 IEEE International Conference on Smart Grid Communications, IEEE (SmartGridComm), pp 121\u2013126","DOI":"10.1109\/SmartGridComm.2013.6687944"},{"key":"7334_CR17","first-page":"357","volume":"30","author":"P Danzinger","year":"2020","unstructured":"Danzinger P, Geibinger T, Mischek F, Musliu N (2020) Solving the test laboratory scheduling problem with variable task grouping. Proc Int Conf Autom Plann Schedul 30:357\u2013365","journal-title":"Proc Int Conf Autom Plann Schedul"},{"issue":"9","key":"7334_CR18","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1049\/iet-its.2011.0179","volume":"6","author":"P Pellegrini","year":"2012","unstructured":"Pellegrini P, Castelli L, Pesenti R (2012) Metaheuristic algorithms for the simultaneous slot allocation problem. IET Intel Transport Syst 6(9):453\u2013462","journal-title":"IET Intel Transport Syst"},{"key":"7334_CR19","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1049\/iet-smc.2019.0076","volume":"2","author":"B Vaidya","year":"2020","unstructured":"Vaidya B, Mouftah HT (2020) Smart electric vehicle charging management for smart cities. IET Smart Cities 2:4\u201313","journal-title":"IET Smart Cities"},{"key":"7334_CR20","doi-asserted-by":"publisher","first-page":"1079","DOI":"10.1109\/JAS.2021.1003982","volume":"8","author":"Y Wang","year":"2021","unstructured":"Wang Y, Zuo X (2021) An effective cloud workflow scheduling approach combining pso and idle time slot-aware rules. IEEE\/CAA J Automatica Sinica 8:1079\u20131094","journal-title":"IEEE\/CAA J Automatica Sinica"},{"key":"7334_CR21","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1007\/s42835-020-00634-z","volume":"16","author":"M Ahmadi","year":"2021","unstructured":"Ahmadi M, Hosseini SH, Farsadi M (2021) Optimal allocation of electric vehicles parking lots and optimal charging and discharging scheduling using hybrid metaheuristic algorithms. J Electr Eng Technol 16:759\u2013770","journal-title":"J Electr Eng Technol"},{"key":"7334_CR22","doi-asserted-by":"publisher","first-page":"15","DOI":"10.3390\/computers10020015","volume":"10","author":"ST Ngo","year":"2021","unstructured":"Ngo ST, Jaafar J, Aziz IA, Anh BN (2021) A compromise programming for multi-objective task assignment problem. Computers 10:15","journal-title":"Computers"},{"key":"7334_CR23","doi-asserted-by":"crossref","unstructured":"Tamssaouet K, Dauz\u00e8re-P\u00e9r\u00e8s S, Yugma C (2018) Metaheuristics for the job-shop scheduling problem with machine availability constraints. Comput Ind Eng 125:1\u20138. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0360835218303802","DOI":"10.1016\/j.cie.2018.08.008"},{"key":"7334_CR24","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1007\/s10489-016-0786-y","volume":"45","author":"H Nouri","year":"2016","unstructured":"Nouri H, Driss O, Gh\u00e9dira K (2016) Hybrid metaheuristics for scheduling of machines and transport robots in job shop environment. Appl Intell 45:808\u2013828","journal-title":"Appl Intell"},{"key":"7334_CR25","doi-asserted-by":"crossref","unstructured":"Chen N, Xie N, Wang Y (2022) An elite genetic algorithm for flexible job shop scheduling problem with extracted grey processing time. Appl Soft Comput 131:109783. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1568494622008328","DOI":"10.1016\/j.asoc.2022.109783"},{"key":"7334_CR26","doi-asserted-by":"publisher","first-page":"644","DOI":"10.2507\/IJSIMM16(4)7.400","volume":"16","author":"H Zhang","year":"2017","unstructured":"Zhang H, Liu S, Moraca S, Ojstersek R (2017) An effective use of hybrid metaheuristics algorithm for job shop scheduling problem. Int J Simul Model 16:644\u2013657","journal-title":"Int J Simul Model"},{"key":"7334_CR27","doi-asserted-by":"crossref","unstructured":"Naderi B, Ghomi SF, Aminnayeri M (2010) A high performing metaheuristic for job shop scheduling with sequence-dependent setup times. Appl Soft Comput 10:703\u2013710. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1568494609001598","DOI":"10.1016\/j.asoc.2009.08.039"},{"key":"7334_CR28","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/s10732-014-9279-5","volume":"22","author":"M Pranzo","year":"2015","unstructured":"Pranzo M, Pacciarelli D (2015) An iterated greedy metaheuristic for the blocking job shop scheduling problem. J Heuristics 22:587\u2013611","journal-title":"J Heuristics"},{"key":"7334_CR29","doi-asserted-by":"crossref","unstructured":"Liu Y-J, Ma S, IEEE (ed) (2008) Flight delay and delay propagation analysis based on bayesian network. In: 2008 International symposium on knowledge acquisition and modeling. IEEE, pp 318\u2013322","DOI":"10.1109\/KAM.2008.70"},{"key":"7334_CR30","doi-asserted-by":"crossref","unstructured":"Sahadevan D, Ponnusamy P, Nelli M, Gopi V (2021) Predictability improvement of scheduled flights departure time variation using supervised machine learning. International Journal of Aviation, Aeronautics, and Aerospace","DOI":"10.15394\/ijaaa.2021.1586"},{"key":"7334_CR31","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1186\/s40537-021-00438-6","volume":"8","author":"M Yousefzadeh Aghdam","year":"2021","unstructured":"Yousefzadeh Aghdam M, Kamel Tabbakh SR, Mahdavi Chabok SJ, Kheyrabadi M (2021) Optimization of air traffic management efficiency based on deep learning enriched by the long short-term memory (lstm) and extreme learning machine (elm). J Big Data 8:54","journal-title":"J Big Data"},{"key":"7334_CR32","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1287\/trsc.1060.0163","volume":"41","author":"JAD Atkin","year":"2007","unstructured":"Atkin JAD, Burke EK, Greenwood JS, Reeson D (2007) Hybrid metaheuristics to aid runway scheduling at london heathrow airport. Transp Sci 41:90\u2013106","journal-title":"Transp Sci"},{"key":"7334_CR33","doi-asserted-by":"crossref","unstructured":"Kommadath R, Maharana D, Kotecha P (2022) Efficient scheduling of jobs on dissimilar parallel machines using heuristic assisted metaheuristic techniques. Chem Eng Res Des 188:916\u2013934. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0263876222005779","DOI":"10.1016\/j.cherd.2022.10.011"},{"key":"7334_CR34","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1007\/s10951-020-00650-x","volume":"23","author":"F Karami","year":"2020","unstructured":"Karami F, Vancroonenburg W, Vanden Berghe G (2020) A periodic optimization approach to dynamic pickup and delivery problems with time windows. J Sched 23:711\u2013731","journal-title":"J Sched"},{"key":"7334_CR35","first-page":"131","volume":"14","author":"C-M Papar\u0103","year":"2024","unstructured":"Papar\u0103 C-M, Schirliu S-H (2024) Logistics optimization for resource allocation and scheduling using time slots. Int J Adv Stat IT&C Econ Life Sci 14:131\u2013146","journal-title":"Int J Adv Stat IT&C Econ Life Sci"},{"key":"7334_CR36","doi-asserted-by":"crossref","unstructured":"Abdolhamidi D, Lurkin V (2025)A tactical time slot management problem under mixed logit demand. arXiv:2407.02308","DOI":"10.1007\/s00291-025-00838-7"},{"key":"7334_CR37","doi-asserted-by":"crossref","unstructured":"Soofastaei A (2025) Intelligent scheduling: How ai and advanced analytics are revolutionizing time optimization. In: Soofastaei A (ed) Mastering time - innovative solutions to complex scheduling problems Ch.\u00a02 IntechOpen, London","DOI":"10.5772\/intechopen.1008531"},{"key":"7334_CR38","doi-asserted-by":"crossref","unstructured":"Mohammed AS et\u00a0al, IEEE (ed) (2024) Optimizing real-time task scheduling in cloud-based ai systems using genetic algorithms. In: 2024 7th International Conference on Contemporary Computing and Informatics (IC3I). IEEE, pp 1649\u20131653","DOI":"10.1109\/IC3I61595.2024.10829055"},{"key":"7334_CR39","doi-asserted-by":"crossref","unstructured":"Simi\u0107 D, Garc\u00eda\u00a0Bringas P et\u00a0al (eds) (2023) An approach of optimisation in last mile delivery","DOI":"10.1007\/978-3-031-42536-3_30"},{"key":"7334_CR40","doi-asserted-by":"crossref","unstructured":"Yamane Y, Seo M, Nishikawa I, Liu Y, Wang L, Zhao L, Yu Z (eds) (2020) Diversity preservation in genetic algorithm by lifespan control. In: Liu Y, Wang L, Zhao L, Yu Z (eds) Advances in natural computation, fuzzy systems and knowledge discovery. Springer International Publishing, Cham, pp 627\u2013635","DOI":"10.1007\/978-3-030-32456-8_69"},{"key":"7334_CR41","doi-asserted-by":"crossref","unstructured":"Reddy S, Dulikravich GS (2022) A self-adapting algorithm for many-objective optimization. Appl Soft Comput 129:109484. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S156849462200583X","DOI":"10.1016\/j.asoc.2022.109484"},{"key":"7334_CR42","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1109\/TEVC.2003.810761","volume":"7","author":"P Bosman","year":"2003","unstructured":"Bosman P, Thierens D (2003) The balance between proximity and diversity in multiobjective evolutionary algorithms. IEEE Trans Evol Comput 7:174\u2013188","journal-title":"IEEE Trans Evol Comput"},{"key":"7334_CR43","doi-asserted-by":"crossref","unstructured":"Xu Y, Zhang M, Wang D, Yang M, Liang C (2025) Hybrid gaussian quantum particle swarm optimization and adaptive genetic algorithm for flexible job-shop scheduling problem. Eng Appl Artif Intell 154:110882. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0952197625008826","DOI":"10.1016\/j.engappai.2025.110882"},{"key":"7334_CR44","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.ins.2014.06.009","volume":"289","author":"J Derrac","year":"2014","unstructured":"Derrac J, Garc\u00eda S, Hui S, Suganthan PN, Herrera F (2014) Analyzing convergence performance of evolutionary algorithms: a statistical approach. Inf Sci 289:41\u201358","journal-title":"Inf Sci"},{"key":"7334_CR45","doi-asserted-by":"crossref","unstructured":"Tang J, Ren M, Yuan Z, Cai J, Liang Y (2025) System-wide optimization of free-floating bike-sharing for urban rail stations: A demand prediction and scheduling approach. Comput Ind Eng 204:111121. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0360835225002670","DOI":"10.1016\/j.cie.2025.111121"},{"key":"7334_CR46","doi-asserted-by":"crossref","unstructured":"Tang J, Ren M, Yuan Z, Cai J, Liang Y (2025) System-wide optimization of free-floating bike-sharing for urban rail stations: A demand prediction and scheduling approach. Comput Ind Eng 204:111121. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0360835225002670","DOI":"10.1016\/j.cie.2025.111121"},{"key":"7334_CR47","doi-asserted-by":"crossref","unstructured":"Li W, Peng R, Luo Q, Mo Y (2024) First train schedule optimization for metro systems considering minimum adjustment cost for special event scenarios. International Journal of Transportation Science and Technology. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S2046043024001345","DOI":"10.1016\/j.ijtst.2024.11.002"},{"key":"7334_CR48","doi-asserted-by":"crossref","unstructured":"Liu Q, Gao Z, Li J, Li S, Zhu L (2023) Research on optimization of dual-resource batch scheduling in flexible job shop. Comput Mater Contin 76:2503\u20132530. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1546221823001613","DOI":"10.32604\/cmc.2023.040505"},{"key":"7334_CR49","doi-asserted-by":"crossref","unstructured":"Liu T, Ji W, Gkiotsalitis K, Cats O (2023) Optimizing public transport transfers by integrating timetable coordination and vehicle scheduling. Comput Ind Eng 184:109577. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0360835223006010","DOI":"10.1016\/j.cie.2023.109577"},{"key":"7334_CR50","doi-asserted-by":"crossref","unstructured":"Varma PJ, Bendi SR (2024) Multiobjective hybrid al-biruni earth namib beetle optimization and deep learning based task scheduling in cloud computing. Sustain Comput Inf Syst 44:101053. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S2210537924000982","DOI":"10.1016\/j.suscom.2024.101053"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-026-07334-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-026-07334-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-026-07334-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T14:08:05Z","timestamp":1782482885000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-026-07334-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":50,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["7334"],"URL":"https:\/\/doi.org\/10.1007\/s10489-026-07334-7","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"26 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 June 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}},{"value":"Not applicable","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics Approval and Consent to Participate"}},{"value":"Not applicable","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}}],"article-number":"321"}}