{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T14:31:52Z","timestamp":1784385112599,"version":"3.55.0"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T00:00:00Z","timestamp":1769212800000},"content-version":"vor","delay-in-days":23,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Technical University of Ostrava"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2026,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>The vehicle routing problem with time windows (VRPTW) has gained much attention recently due to its wide application in operations research and logistics. VRPTW has been proven to be an NP-hard problem whose optimal solution is computationally costly. Scholars have proposed many methods, such as exact algorithms, heuristics, and metaheuristics, to find near-optimal solutions for the VRPTW. Exact algorithms are limited to small-scale problems, while heuristic algorithms and metaheuristics often converge to locally optimal solutions, despite their applicability to larger-scale problems. This paper proposes a novel membrane-inspired evolutionary algorithm framework (MEAF) consisting of isolated evolutionary rules, communication output rules, communication input rules, fusion-exchange information operation, and membrane dissolution rules. By leveraging the advantages of multiple metaheuristics algorithms and avoiding the pitfalls of local optima, MEAF offers a promising solution to address complex problems. The effectiveness of the proposed MEAF is verified by applying three classical metaheuristics, namely Genetic Algorithm (GA), Ant Colony System (ACS), and Particle Swarm Algorithm (PSO), to solve the VRPTW problem. The experiments are run on 56 instances of Solomon with 100 client benchmarks. The evaluation of the experimental results combined with the mean and standard deviation values show that the algorithm performs better in 54 out of 56 instances, demonstrating the effectiveness and stability of the proposed algorithm.<\/jats:p>","DOI":"10.1007\/s10489-025-07068-y","type":"journal-article","created":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T01:58:04Z","timestamp":1769219884000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A novel membrane-inspired evolutionary algorithm framework for VRPTW"],"prefix":"10.1007","volume":"56","author":[{"given":"Zhonghai","family":"Bai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9600-8319","authenticated-orcid":false,"given":"V\u00e1clav","family":"Sn\u00e1\u0161el","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Seyedali","family":"Mirjalili","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bay","family":"Vo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lingping","family":"Kong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaopeng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,1,24]]},"reference":[{"issue":"1","key":"7068_CR1","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manage Sci 6(1):80\u201391","journal-title":"Manage Sci"},{"issue":"6","key":"7068_CR2","doi-asserted-by":"publisher","first-page":"4387","DOI":"10.1007\/s00521-021-06587-2","volume":"34","author":"MM Alipour","year":"2022","unstructured":"Alipour MM, Emami H, Abdolhosseinzadeh M (2022) A mas approach for vehicle routing problem. Neural Comput Appl 34(6):4387\u20134411","journal-title":"Neural Comput Appl"},{"key":"7068_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2024.104522","volume":"160","author":"J Lehmann","year":"2024","unstructured":"Lehmann J, Winkenbach M (2024) A matheuristic for the two-echelon multi-trip vehicle routing problem with mixed pickup and delivery demand and time windows. Transportation Research Part C Emerging Technologies 160:104522","journal-title":"Transportation Research Part C Emerging Technologies"},{"issue":"1","key":"7068_CR4","doi-asserted-by":"publisher","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(1):409\u2013432","journal-title":"Neural Comput Appl"},{"issue":"2","key":"7068_CR5","doi-asserted-by":"publisher","first-page":"1979","DOI":"10.1051\/ro\/2024069","volume":"58","author":"B Yue","year":"2024","unstructured":"Yue B, Yang J, Ma J, Shi J, Shangguan L (2024) An improved sequential insertion algorithm and tabu search to vehicle routing problem with time windows. RAIRO-Operations Research 58(2):1979\u20131999","journal-title":"RAIRO-Operations Research"},{"key":"7068_CR6","doi-asserted-by":"crossref","unstructured":"Zhang J, Li Y, Lu Z (2024) Multi-period vehicle routing problem with time windows for drug distribution in the epidemic situation. Trans Res Part C Emerg Technol 160:104484","DOI":"10.1016\/j.trc.2024.104484"},{"issue":"3","key":"7068_CR7","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.jksus.2010.03.002","volume":"22","author":"NA El-Sherbeny","year":"2010","unstructured":"El-Sherbeny NA (2010) Vehicle routing with time windows: An overview of exact, heuristic and metaheuristic methods. Journal of King Saud University-Science 22(3):123\u2013131","journal-title":"Journal of King Saud University-Science"},{"key":"7068_CR8","unstructured":"Mitchell M (1998) An Introduction to Genetic Algorithms. MIT press, Cambridge, MA"},{"key":"7068_CR9","doi-asserted-by":"crossref","unstructured":"Van Laarhoven PJ, Aarts EH, Laarhoven PJ, Aarts EH (1987) Simulated Annealing. Springer, Dordrecht","DOI":"10.1007\/978-94-015-7744-1_2"},{"key":"7068_CR10","doi-asserted-by":"crossref","unstructured":"Glover, F., Laguna, M.: Tabu Search, pp. 2093\u20132229. Springer, Boston, MA (1998)","DOI":"10.1007\/978-1-4613-0303-9_33"},{"key":"7068_CR11","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of ICNN\u201995-international conference on neural networks, IEEE, vol. 4, pp. 1942\u20131948 (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"4","key":"7068_CR12","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/MCI.2006.329691","volume":"1","author":"M Dorigo","year":"2006","unstructured":"Dorigo M, Birattari M, Stutzle T (2006) Ant colony optimization. IEEE Comput Intell Mag 1(4):28\u201339","journal-title":"IEEE Comput Intell Mag"},{"issue":"15","key":"7068_CR13","doi-asserted-by":"publisher","first-page":"10733","DOI":"10.1007\/s00521-023-08261-1","volume":"35","author":"HA Shehadeh","year":"2023","unstructured":"Shehadeh HA (2023) Chernobyl disaster optimizer (cdo): a novel meta-heuristic method for global optimization. Neural Comput Appl 35(15):10733\u201310749","journal-title":"Neural Comput Appl"},{"key":"7068_CR14","doi-asserted-by":"crossref","unstructured":"Bouaouda, A., Hashim, F.A., Sayouti, Y., Hussien, A.G.: Pied kingfisher optimizer: a new bio-inspired algorithm for solving numerical optimization and industrial engineering problems. Neural Comput Appl pp 1\u201359 (2024)","DOI":"10.1007\/s00521-024-09879-5"},{"key":"7068_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.110011","volume":"259","author":"M Dehghani","year":"2023","unstructured":"Dehghani M, Montazeri Z, Trojovsk\u00e1 E, Trojovsk\u1ef3 P (2023) Coati optimization algorithm: A new bio-inspired metaheuristic algorithm for solving optimization problems. Knowl-Based Syst 259:110011","journal-title":"Knowl-Based Syst"},{"key":"7068_CR16","doi-asserted-by":"crossref","unstructured":"Alsalibi B, Mirjalili S, Abualigah L, Yahya RI, Gandomi AH (2022) A comprehensive survey on the recent variants and applications of membrane-inspired evolutionary algorithms. Arch Comput Method Eng pp 1\u201317","DOI":"10.1007\/s11831-021-09693-5"},{"key":"7068_CR17","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1016\/j.ins.2014.04.007","volume":"279","author":"G Zhang","year":"2014","unstructured":"Zhang G, Gheorghe M, Pan L, P\u00e9rez-Jim\u00e9nez MJ (2014) Evolutionary membrane computing: a comprehensive survey and new results. Inf Sci 279:528\u2013551","journal-title":"Inf Sci"},{"issue":"4","key":"7068_CR18","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1002\/net.3230140406","volume":"14","author":"J Desrosiers","year":"1984","unstructured":"Desrosiers J, Soumis F, Desrochers M (1984) Routing with time windows by column generation. Networks 14(4):545\u2013565","journal-title":"Networks"},{"issue":"2","key":"7068_CR19","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1287\/opre.40.2.342","volume":"40","author":"M Desrochers","year":"1992","unstructured":"Desrochers M, Desrosiers J, Solomon M (1992) A new optimization algorithm for the vehicle routing problem with time windows. Oper Res 40(2):342\u2013354","journal-title":"Oper Res"},{"issue":"3","key":"7068_CR20","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1287\/opre.45.3.488","volume":"45","author":"ML Fisher","year":"1997","unstructured":"Fisher ML, J\u00f6rnsten KO, Madsen OB (1997) Vehicle routing with time windows: Two optimization algorithms. Oper Res 45(3):488\u2013492","journal-title":"Oper Res"},{"issue":"1","key":"7068_CR21","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/trsc.33.1.101","volume":"33","author":"N Kohl","year":"1999","unstructured":"Kohl N, Desrosiers J, Madsen OB, Solomon MM, Soumis F (1999) 2-path cuts for the vehicle routing problem with time windows. Transp Sci 33(1):101\u2013116","journal-title":"Transp Sci"},{"key":"7068_CR22","doi-asserted-by":"crossref","unstructured":"Balas E, Guignard M (1979) Report of the session on: Branch and bound\/implicit enumeration. In: Annals of discrete mathematics vol 5, pp 185\u2013191. Elsevier, Amsterdam","DOI":"10.1016\/S0167-5060(08)70348-0"},{"issue":"3\u20134","key":"7068_CR23","first-page":"261","volume":"6","author":"EK Baker","year":"1986","unstructured":"Baker EK, Schaffer JR (1986) Solution improvement heuristics for the vehicle routing and scheduling problem with time window constraints. Am J Math Manag Sci 6(3\u20134):261\u2013300","journal-title":"Am J Math Manag Sci"},{"issue":"2","key":"7068_CR24","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0377-2217(88)90428-6","volume":"36","author":"H Van Landeghem","year":"1988","unstructured":"Van Landeghem H (1988) A bi-criteria heuristic for the vehicle routing problem with time windows. Eur J Oper Res 36(2):217\u2013226","journal-title":"Eur J Oper Res"},{"issue":"3","key":"7068_CR25","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/0377-2217(93)90221-8","volume":"66","author":"J-Y Potvin","year":"1993","unstructured":"Potvin J-Y, Rousseau J-M (1993) A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. Eur J Oper Res 66(3):331\u2013340","journal-title":"Eur J Oper Res"},{"issue":"12","key":"7068_CR26","doi-asserted-by":"publisher","first-page":"1433","DOI":"10.1057\/jors.1995.204","volume":"46","author":"J-Y Potvin","year":"1995","unstructured":"Potvin J-Y, Rousseau J-M (1995) An exchange heuristic for routeing problems with time windows. J Oper Res Soc 46(12):1433\u20131446","journal-title":"J Oper Res Soc"},{"issue":"1","key":"7068_CR27","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1(1):53\u201366","journal-title":"IEEE Trans Evol Comput"},{"key":"7068_CR28","doi-asserted-by":"crossref","unstructured":"Mirjalili S, Lewis A (2016) The whale optimization algorithm. Adv Eng Softw 95:51\u201367","DOI":"10.1016\/j.advengsoft.2016.01.008"},{"key":"7068_CR29","doi-asserted-by":"crossref","unstructured":"Wang Y, Chen X, Shuang Z, Zhan Y, Chen K, Xu C (2024) Self-competition particle swarm optimization algorithm for the vehicle routing problem with time window. IEEE Access","DOI":"10.1109\/ACCESS.2024.3401487"},{"key":"7068_CR30","doi-asserted-by":"crossref","unstructured":"Maroof A, Ayvaz B, Naeem K (2024) Logistics optimization using hybrid genetic algorithm (hga): a solution to the vehicle routing problem with time windows (vrptw). IEEE Access","DOI":"10.1109\/ACCESS.2024.3373699"},{"issue":"4","key":"7068_CR31","doi-asserted-by":"publisher","first-page":"1642","DOI":"10.28991\/ESJ-2024-08-04-023","volume":"8","author":"JA Widians","year":"2024","unstructured":"Widians JA, Wardoyo R, Hartati S (2024) A hybrid ant colony and grey wolf optimization algorithm for exploitation-exploration balance. Emerg Sci J 8(4):1642\u20131654","journal-title":"Emerg Sci J"},{"issue":"2","key":"7068_CR32","doi-asserted-by":"publisher","first-page":"231","DOI":"10.28991\/HIJ-2024-05-02-02","volume":"5","author":"I Farda","year":"2024","unstructured":"Farda I, Thammano A (2024) An adaptive differential evolution with multiple crossover strategies for optimization problems. HighTech Innov J 5(2):231\u201358","journal-title":"HighTech Innov J"},{"key":"7068_CR33","doi-asserted-by":"crossref","unstructured":"Arif MS, Abodayeh K, Nawaz Y (2024) A third-order two-stage numerical scheme and neural network simulations for seir epidemic model: A numerical study. Emerg Sci J 8(1)","DOI":"10.28991\/ESJ-2024-08-01-023"},{"key":"7068_CR34","doi-asserted-by":"publisher","first-page":"1126450","DOI":"10.3389\/fmech.2022.1126450","volume":"8","author":"M Dehghani","year":"2023","unstructured":"Dehghani M, Trojovsk\u1ef3 P (2023) Osprey optimization algorithm: A new bio-inspired metaheuristic algorithm for solving engineering optimization problems. Front Mech Eng 8:1126450","journal-title":"Front Mech Eng"},{"issue":"3","key":"7068_CR35","doi-asserted-by":"publisher","first-page":"855","DOI":"10.3390\/s22030855","volume":"22","author":"P Trojovsk\u1ef3","year":"2022","unstructured":"Trojovsk\u1ef3 P, Dehghani M (2022) Pelican optimization algorithm: A novel nature-inspired algorithm for engineering applications. Sensors 22(3):855","journal-title":"Sensors"},{"issue":"3","key":"7068_CR36","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0954-1810(01)00005-X","volume":"15","author":"KC Tan","year":"2001","unstructured":"Tan KC, Lee LH, Zhu Q, Ou K (2001) Heuristic methods for vehicle routing problem with time windows. Artif Intell Eng 15(3):281\u2013295","journal-title":"Artif Intell Eng"},{"issue":"1","key":"7068_CR37","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1006\/jcss.1999.1693","volume":"61","author":"G P\u0103un","year":"2000","unstructured":"P\u0103un G (2000) Computing with membranes. J Comput Syst Sci 61(1):108\u2013143","journal-title":"J Comput Syst Sci"},{"key":"7068_CR38","doi-asserted-by":"crossref","unstructured":"Ciobanu G, P\u0103un G, P\u00e9rez-Jim\u00e9nez MJ (2006) Applications of Membrane Computing, vol 17. Springer, Berlin","DOI":"10.1007\/3-540-29937-8"},{"key":"7068_CR39","unstructured":"Colorni A, Dorigo M, Maniezzo V et al (1991) Distributed optimization by ant colonies. In: Proceedings of the first european conference on artificial life, Paris, France, vol 142, pp 134\u2013142"},{"issue":"2","key":"7068_CR40","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1177\/105971239700500203","volume":"5","author":"R Schoonderwoerd","year":"1997","unstructured":"Schoonderwoerd R, Holland OE, Bruten JL, Rothkrantz LJ (1997) Ant-based load balancing in telecommunications networks. Adapt Behav 5(2):169\u2013207","journal-title":"Adapt Behav"},{"key":"7068_CR41","doi-asserted-by":"crossref","unstructured":"Goldberg DE, Deb K (1991) A comparative analysis of selection schemes used in genetic algorithms. In: Foundations of genetic algorithms, Elsevier, Amsterdam, vol 1, pp 69\u201393","DOI":"10.1016\/B978-0-08-050684-5.50008-2"},{"key":"7068_CR42","doi-asserted-by":"crossref","unstructured":"Umbarkar AJ, Sheth PD (2015) Crossover operators in genetic algorithms: a review. ICTACT J Soft Comput 6(1)","DOI":"10.21917\/ijsc.2015.0150"},{"key":"7068_CR43","unstructured":"Goldberg DE, Lingle R (2014) Alleles, loci, and the traveling salesman problem. In: Proceedings of the first international conference on genetic algorithms and their applications, Psychology Press, pp 154\u2013159"},{"key":"7068_CR44","unstructured":"Davis L et al (1985) Applying adaptive algorithms to epistatic domains. In: IJCAI, Citeseer, 85:162\u2013164"},{"key":"7068_CR45","unstructured":"Abdoun O, Abouchabaka J, Tajani C (2012) Analyzing the performance of mutation operators to solve the travelling salesman problem. arXiv preprint arXiv:1203.3099"},{"key":"7068_CR46","doi-asserted-by":"crossref","unstructured":"Onwubolu GC, Babu B, Clerc M (2004) Discrete particle swarm optimization, illustrated by the traveling salesman problem. New Optim Techn Eng pp 219\u2013239","DOI":"10.1007\/978-3-540-39930-8_8"},{"key":"7068_CR47","doi-asserted-by":"crossref","unstructured":"Hendtlass T (2003) Preserving diversity in particle swarm optimisation. In: Developments in applied artificial intelligence: 16th international conference on industrial and engineering applications of artificial intelligence and expert systems, IEA\/AIE 2003 Loughborough, UK, June 23\u201326, 2003 Proceedings, Springer, 16:31\u201340","DOI":"10.1007\/3-540-45034-3_4"},{"key":"7068_CR48","unstructured":"Wang K-P, Huang L, Zhou C-G, Pang W (2003) Particle swarm optimization for traveling salesman problem. In: Proceedings of the 2003 international conference on machine learning and cybernetics (IEEE Cat. No. 03ex693), IEEE, 3:1583\u20131585"},{"key":"7068_CR49","doi-asserted-by":"crossref","unstructured":"Tsai C-W, Tseng S-P, Chiang M-C, Yang C-S, Hong T-P (2014) A high-performance genetic algorithm: using traveling salesman problem as a case. Sci World J 2014","DOI":"10.1155\/2014\/178621"},{"key":"7068_CR50","unstructured":"Sohail MS, Saeed MOB, Rizvi SZ, Shoaib M, Sheikh AUH (2014) Low-complexity particle swarm optimization for time-critical applications. arXiv preprint arXiv:1401.0546"},{"issue":"6","key":"7068_CR51","doi-asserted-by":"publisher","first-page":"1300","DOI":"10.1109\/JSEE.2015.00142","volume":"26","author":"M Li","year":"2015","unstructured":"Li M (2015) Efficiency improvement of ant colony optimization in solving the moderate ltsp. J Syst Eng Electron 26(6):1300\u20131308","journal-title":"J Syst Eng Electron"},{"issue":"2","key":"7068_CR52","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35(2):254\u2013265","journal-title":"Oper Res"},{"issue":"200","key":"7068_CR53","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1080\/01621459.1937.10503522","volume":"32","author":"M Friedman","year":"1937","unstructured":"Friedman M (1937) The use of ranks to avoid the assumption of normality implicit in the analysis of variance. J Am Stat Assoc 32(200):675\u2013701","journal-title":"J Am Stat Assoc"},{"issue":"6","key":"7068_CR54","doi-asserted-by":"publisher","first-page":"80","DOI":"10.2307\/3001968","volume":"1","author":"F Wilcoxon","year":"1945","unstructured":"Wilcoxon F (1945) Individual comparisons by ranking methods. Biometrics bulletin 1(6):80\u201383","journal-title":"Biometrics bulletin"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-025-07068-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-025-07068-y","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-025-07068-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T10:16:22Z","timestamp":1774865782000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-025-07068-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1]]},"references-count":54,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["7068"],"URL":"https:\/\/doi.org\/10.1007\/s10489-025-07068-y","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1]]},"assertion":[{"value":"11 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 January 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 conflicts of interest to disclose that relate to the subject matter of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"57"}}