{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T21:48:07Z","timestamp":1771019287668,"version":"3.50.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"20","license":[{"start":{"date-parts":[[2024,4,19]],"date-time":"2024-04-19T00:00:00Z","timestamp":1713484800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,4,19]],"date-time":"2024-04-19T00:00:00Z","timestamp":1713484800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Dokuz Eyl\u00fcl University"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput &amp; Applic"],"published-print":{"date-parts":[[2024,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The present paper introduces a modified flower pollination algorithm (FPA) enhanced by evolutionary operators to solve the uncapacitated facility location problem (UFLP), which is one of the well-known location science problems. The aim in UFLP is to select some locations to open facilities among a certain number of candidate locations so as to minimize the total cost, which is the sum of facility opening costs and transportation costs. Since UFLP is a binary optimization problem, FPA, which is introduced to solve real-valued optimization problems, is redesigned to be able to conduct search in binary domains. This constitutes one of the contributions of the present study. In this context, some evolutionary operators such as crossover and mutation are adopted by the proposed FPA. Next, the mutation operator is further enhanced by making use of an adaptive procedure that introduces greater level of diversity at earlier iterations and encourages intensification toward the end of search. Thus, while premature convergence and local optima problems at earlier iterations are avoided, a more intensified search around the found promising regions is performed. Secondarily, as demonstrated in this study, by making use of the reported evolutionary procedures, FPA is able to run in binary spaces without employing any additional auxiliary procedures such as transfer functions. All available benchmarking instances are solved by the proposed approach. As demonstrated by the comprehensive experimental study that includes statistically verified results, the developed approach is found as a promising algorithm that can be extended to numerous binary optimization problems.<\/jats:p>","DOI":"10.1007\/s00521-024-09684-0","type":"journal-article","created":{"date-parts":[[2024,4,19]],"date-time":"2024-04-19T20:33:51Z","timestamp":1713558831000},"page":"12117-12130","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Evolution inspired binary flower pollination for the uncapacitated facility location problem"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6368-4425","authenticated-orcid":false,"given":"Fehmi Burcin","family":"Ozsoydan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali Erel","family":"Kas\u0131rga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,19]]},"reference":[{"key":"9684_CR1","doi-asserted-by":"publisher","unstructured":"Yang XS (2012) Flower pollination algorithm for global optimization. In: Durand-Lose J, Jonoska N (eds) Lecture notes in computer science, vol 7445, Springer, Berlin, Heidelberg, pp 240\u2013249 https:\/\/doi.org\/10.1007\/978-3-642-32894-7_27","DOI":"10.1007\/978-3-642-32894-7_27"},{"key":"9684_CR2","first-page":"119","volume":"1865","author":"G Cournuejols","year":"1990","unstructured":"Cournuejols G, Nemhauser GL, Wolsey LA (1990) The uncapacitated facility location problem, discrete location theory. Lect Note Artif Int 1865:119\u2013171","journal-title":"Lect Note Artif Int"},{"issue":"3","key":"9684_CR3","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1287\/mnsc.12.3.253","volume":"12","author":"ML Balinski","year":"1965","unstructured":"Balinski ML (1965) Integer programming: methods, uses, computations. Manage Sci 12(3):253\u2013313. https:\/\/doi.org\/10.1287\/mnsc.12.3.253","journal-title":"Manage Sci"},{"issue":"3","key":"9684_CR4","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1287\/opre.14.3.361","volume":"14","author":"M Efroymson","year":"1966","unstructured":"Efroymson M, Ray TL (1966) A branch-bound algorithm for plant location. Oper Res 14(3):361\u2013368. https:\/\/doi.org\/10.1287\/opre.14.3.361","journal-title":"Oper Res"},{"issue":"12","key":"9684_CR5","doi-asserted-by":"publisher","first-page":"B-718","DOI":"10.1287\/mnsc.18.12.B718","volume":"18","author":"BM Khumawala","year":"1972","unstructured":"Khumawala BM (1972) An efficient branch and bound algorithm for the warehouse location problem. Manage Sci 18(12):B-718. https:\/\/doi.org\/10.1287\/mnsc.18.12.B718","journal-title":"Manage Sci"},{"issue":"6","key":"9684_CR6","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1287\/opre.26.6.992","volume":"26","author":"D Erlenkotter","year":"1978","unstructured":"Erlenkotter D (1978) A dual-based procedure for uncapacitated facility location. Oper Res 26(6):992\u20131009. https:\/\/doi.org\/10.1287\/opre.26.6.992","journal-title":"Oper Res"},{"issue":"2","key":"9684_CR7","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0377-2217(89)90189-6","volume":"39","author":"M Korkel","year":"1989","unstructured":"Korkel M (1989) On the exact solution of large-scale simple plant location problems. Eur J Oper Res 39(2):157\u2013173. https:\/\/doi.org\/10.1016\/0377-2217(89)90189-6","journal-title":"Eur J Oper Res"},{"key":"9684_CR8","unstructured":"Johnson DS, Garey MR (1979) Computers and intractability: A guide to the theory of NP-completeness. WH Freeman."},{"key":"9684_CR9","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1023\/A:1018956213524","volume":"86","author":"KS Al-Sultan","year":"1999","unstructured":"Al-Sultan KS, Al-Fawzan MA (1999) A tabu search approach to the uncapacitated facility location problem. Ann Oper Res 86:91\u2013103. https:\/\/doi.org\/10.1023\/A:1018956213524","journal-title":"Ann Oper Res"},{"issue":"1","key":"9684_CR10","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/S0377-2217(02)00504-0","volume":"150","author":"D Ghosh","year":"2003","unstructured":"Ghosh D (2003) Neighborhood search heuristics for the uncapacitated facility location problem. Eur J Oper Res 150(1):150\u2013162. https:\/\/doi.org\/10.1016\/S0377-2217(02)00504-0","journal-title":"Eur J Oper Res"},{"key":"9684_CR11","doi-asserted-by":"publisher","unstructured":"Sevkli M, Guner AR (2006) A continuous particle swarm optimization algorithm for uncapacitated facility location problem. In\u00a0International workshop on ant colony optimization and swarm \u0131ntelligence, Springer, Berlin, Heidelberg, pp 316\u2013323. https:\/\/doi.org\/10.1007\/11839088_28","DOI":"10.1007\/11839088_28"},{"key":"9684_CR12","doi-asserted-by":"publisher","unstructured":"Wang D, Wu CH, Ip A, Wang D, Yan Y (2008) Parallel multi-population particle swarm optimization algorithm for the uncapacitated facility location problem using openMP. In\u00a02008 IEEE congress on evolutionary computation pp 1214\u20131218. https:\/\/doi.org\/10.1109\/CEC.2008.4630951","DOI":"10.1109\/CEC.2008.4630951"},{"key":"9684_CR13","doi-asserted-by":"publisher","DOI":"10.1155\/2008\/861512","author":"AR Guner","year":"2008","unstructured":"Guner AR, Sevkli M (2008) A discrete particle swarm optimization algorithm for uncapacitated facility location problem. J Artif Evolut Appl. https:\/\/doi.org\/10.1155\/2008\/861512","journal-title":"J Artif Evolut Appl"},{"key":"9684_CR14","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.asoc.2015.04.007","volume":"33","author":"MS Kiran","year":"2015","unstructured":"Kiran MS (2015) The continuous artificial bee colony algorithm for binary optimization. Appl Soft Comput 33:15\u201323. https:\/\/doi.org\/10.1016\/j.asoc.2015.04.007","journal-title":"Appl Soft Comput"},{"issue":"2","key":"9684_CR15","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1057\/jors.2010.134","volume":"62","author":"JR Montoya-Torres","year":"2011","unstructured":"Montoya-Torres JR, Aponte A, Rosas P (2011) Applying GRASP to solve the multi-item three-echelon uncapacitated facility location problem. J Oper ResSoc 62(2):397\u2013406","journal-title":"J Oper ResSoc"},{"issue":"4","key":"9684_CR16","doi-asserted-by":"publisher","first-page":"3201","DOI":"10.3233\/JIFS-169263","volume":"32","author":"K Tsuya","year":"2017","unstructured":"Tsuya K, Takaya M, Yamamura A (2017) Application of the firefly algorithm to the uncapacitated facility location problem. J Intell Fuzzy Syst 32(4):3201\u20133208. https:\/\/doi.org\/10.3233\/JIFS-169263","journal-title":"J Intell Fuzzy Syst"},{"issue":"10","key":"9684_CR17","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1057\/s41274-016-0155-6","volume":"68","author":"J de Armas","year":"2017","unstructured":"de Armas J, Juan AA, Marqu\u00e8s JM, Pedroso JP (2017) Solving the deterministic and stochastic uncapacitated facility location problem: from a heuristic to a simheuristic. J Oper Res Soc 68(10):1161\u20131176. https:\/\/doi.org\/10.1057\/s41274-016-0155-6","journal-title":"J Oper Res Soc"},{"key":"9684_CR18","doi-asserted-by":"publisher","unstructured":"Baykasoglu A, Ozsoydan FB, Senol ME (2018). Weighted superposition attraction algorithm for binary optimization problems.\u00a0Oper Res: 1\u201327. https:\/\/doi.org\/10.1007\/s12351-018-0427-9","DOI":"10.1007\/s12351-018-0427-9"},{"key":"9684_CR19","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.cie.2019.07.007","volume":"136","author":"FB Ozsoydan","year":"2019","unstructured":"Ozsoydan FB (2019) Artificial search agents with cognitive intelligence for binary optimization problems. Comput Ind Eng 136:18\u201330. https:\/\/doi.org\/10.1016\/j.cie.2019.07.007","journal-title":"Comput Ind Eng"},{"key":"9684_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105658","volume":"83","author":"FB Ozsoydan","year":"2019","unstructured":"Ozsoydan FB (2019) Effects of dominant wolves in grey wolf optimization algorithm. Appl Soft Comput 83:105658. https:\/\/doi.org\/10.1016\/j.asoc.2019.105658","journal-title":"Appl Soft Comput"},{"key":"9684_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.105586","volume":"194","author":"\u0130 Golcuk","year":"2020","unstructured":"Golcuk \u0130, Ozsoydan FB (2020) Evolutionary and adaptive inheritance enhanced grey wolf optimization algorithm for binary domains. Knowl-Based Syst 194:105586. https:\/\/doi.org\/10.1016\/j.knosys.2020.105586","journal-title":"Knowl-Based Syst"},{"issue":"21","key":"9684_CR22","doi-asserted-by":"publisher","first-page":"14669","DOI":"10.1007\/s00521-021-06107-2","volume":"33","author":"E Sonu\u00e7","year":"2021","unstructured":"Sonu\u00e7 E (2021) Binary crow search algorithm for the uncapacitated facility location problem. Neural Comput Appl 33(21):14669\u201314685. https:\/\/doi.org\/10.1007\/s00521-021-06107-2","journal-title":"Neural Comput Appl"},{"key":"9684_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.118978","volume":"213","author":"F Zhang","year":"2023","unstructured":"Zhang F, He Y, Ouyang H, Li W (2023) A fast and efficient discrete evolutionary algorithm for the uncapacitated facility location problem. Expert Syst Appl 213:118978. https:\/\/doi.org\/10.1016\/j.eswa.2022.118978","journal-title":"Expert Syst Appl"},{"issue":"10","key":"9684_CR24","doi-asserted-by":"publisher","first-page":"1619","DOI":"10.1016\/j.ifacol.2022.09.622","volume":"55","author":"B Alidaee","year":"2022","unstructured":"Alidaee B, Wang H (2022) Uncapacitated (Facility) location problem: a hybrid genetic-tabu search approach. IFAC-PapersOnLine 55(10):1619\u20131624. https:\/\/doi.org\/10.1016\/j.ifacol.2022.09.622","journal-title":"IFAC-PapersOnLine"},{"issue":"13","key":"9684_CR25","doi-asserted-by":"publisher","first-page":"11063","DOI":"10.1007\/s00521-022-07058-y","volume":"34","author":"E Kaya","year":"2022","unstructured":"Kaya E (2022) BinGSO: galactic swarm optimization powered by binary artificial algae algorithm for solving uncapacitated facility location problems. Neural Comput Appl 34(13):11063\u201311082. https:\/\/doi.org\/10.1007\/s00521-022-07058-y","journal-title":"Neural Comput Appl"},{"key":"9684_CR26","doi-asserted-by":"publisher","unstructured":"Zhou J, Wang X, Zhang L, Zhou X, Jing S, & Liang G (2022). An improved genetic algorithm for the uncapacitated facility location problem and applications in oil and gas fields. In Journal of physics: conference series (Vol. 2224, No. 1, p. 012134). IOP Publishing. https:\/\/doi.org\/10.1088\/1742-6596\/2224\/1\/012134","DOI":"10.1088\/1742-6596\/2224\/1\/012134"},{"issue":"1","key":"9684_CR27","first-page":"118","volume":"14","author":"A Soltanpour","year":"2023","unstructured":"Soltanpour A, Alizadeh B, Baroughi F (2023) Efficient algorithms for uncapacitated facility location problem on uncertain environments. Iran J Oper Res 14(1):118\u2013132","journal-title":"Iran J Oper Res"},{"issue":"5","key":"9684_CR28","doi-asserted-by":"publisher","first-page":"685","DOI":"10.4236\/ojapps.2023.135054","volume":"13","author":"N Jiang","year":"2023","unstructured":"Jiang N, Zhang H (2023) Improved adaptive differential evolution algorithm for the un-capacitated facility location problem. Open J Appl Sci 13(5):685\u2013695. https:\/\/doi.org\/10.4236\/ojapps.2023.135054","journal-title":"Open J Appl Sci"},{"issue":"8","key":"9684_CR29","doi-asserted-by":"publisher","first-page":"4151","DOI":"10.1007\/s00521-023-09261-x","volume":"36","author":"E Ba\u015f","year":"2024","unstructured":"Ba\u015f E, Yildizdan G (2024) A new binary arithmetic optimization algorithm for uncapacitated facility location problem. Neural Comput Appl 36(8):4151\u20134177. https:\/\/doi.org\/10.1007\/s00521-023-09261-x","journal-title":"Neural Comput Appl"},{"issue":"5","key":"9684_CR30","doi-asserted-by":"publisher","first-page":"2573","DOI":"10.1007\/s00521-023-09190-9","volume":"36","author":"M Aslan","year":"2024","unstructured":"Aslan M, Pavone M (2024) MBVS: a modified binary vortex search algorithm for solving uncapacitated facility location problem. Neural Comput Appl 36(5):2573\u20132595. https:\/\/doi.org\/10.1007\/s00521-023-09190-9","journal-title":"Neural Comput Appl"},{"issue":"5","key":"9684_CR31","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1007\/s12559-015-9324-1","volume":"7","author":"HM Dubey","year":"2015","unstructured":"Dubey HM, Pandit M, Panigrahi BK (2015) A biologically inspired modified flower pollination algorithm for solving economic dispatch problems in modern power systems. Cogn Comput 7(5):594\u2013608. https:\/\/doi.org\/10.1007\/s12559-015-9324-1","journal-title":"Cogn Comput"},{"key":"9684_CR32","doi-asserted-by":"publisher","unstructured":"Rodrigues D, Yang XS, de Souza AN, Papa JP (2015) Binary flower pollination algorithm and its application to feature selection. In: Yang XS (eds) Recent advances in swarm intelligence and evolutionary computation, Studies in computational intelligence, vol 585. Springer, Cham pp 85\u2013100. https:\/\/doi.org\/10.1007\/978-3-319-13826-8_5","DOI":"10.1007\/978-3-319-13826-8_5"},{"key":"9684_CR33","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.asoc.2016.05.051","volume":"47","author":"ZAEM Dahi","year":"2016","unstructured":"Dahi ZAEM, Mezioud C, Draa A (2016) On the efficiency of the binary flower pollination algorithm: application on the antenna positioning problem. Appl Soft Comput 47:395\u2013414. https:\/\/doi.org\/10.1016\/j.asoc.2016.05.051","journal-title":"Appl Soft Comput"},{"key":"9684_CR34","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.eswa.2016.03.047","volume":"57","author":"E Nabil","year":"2016","unstructured":"Nabil E (2016) A modified flower pollination algorithm for global optimization. Expert Syst Appl 57:192\u2013203. https:\/\/doi.org\/10.1016\/j.eswa.2016.03.047","journal-title":"Expert Syst Appl"},{"key":"9684_CR35","first-page":"27","volume":"4","author":"M Abdel-Baset","year":"2015","unstructured":"Abdel-Baset M, Hezam IM (2015) An effective hybrid flower pollination and genetic algorithm for constrained optimization problems. Adv Eng Technol Appl Int J 4:27\u201327","journal-title":"Adv Eng Technol Appl Int J"},{"key":"9684_CR36","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/j.asoc.2015.05.015","volume":"34","author":"A Draa","year":"2015","unstructured":"Draa A (2015) On the performances of the flower pollination algorithm-Qualitative and quantitative analyses. Appl Soft Comput 34:349\u2013371. https:\/\/doi.org\/10.1016\/j.asoc.2015.05.015","journal-title":"Appl Soft Comput"},{"issue":"7","key":"9684_CR37","doi-asserted-by":"publisher","first-page":"2155","DOI":"10.1007\/s00521-017-3176-4","volume":"31","author":"Y Zhou","year":"2019","unstructured":"Zhou Y, Wang R, Zhao C, Luo Q, Metwally MA (2019) Discrete greedy flower pollination algorithm for spherical traveling salesman problem. Neural Comput Appl 31(7):2155\u20132170. https:\/\/doi.org\/10.1007\/s00521-017-3176-4","journal-title":"Neural Comput Appl"},{"issue":"11","key":"9684_CR38","doi-asserted-by":"publisher","first-page":"7805","DOI":"10.1007\/s00521-018-3602-2","volume":"31","author":"FB Ozsoydan","year":"2019","unstructured":"Ozsoydan FB, Baykasoglu A (2019) Analysing the effects of various switching probability characteristics in flower pollination algorithm for solving unconstrained function minimization problems. Neural Comput Appl 31(11):7805\u20137819. https:\/\/doi.org\/10.1007\/s00521-018-3602-2","journal-title":"Neural Comput Appl"},{"key":"9684_CR39","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.121402","volume":"237","author":"H Song","year":"2024","unstructured":"Song H, Bei J, Zhang H, Wang J, Zhang P (2024) Hybrid algorithm of differential evolution and flower pollination for global optimization problems. Expert Syst Appl 237:121402. https:\/\/doi.org\/10.1016\/j.eswa.2023.121402","journal-title":"Expert Syst Appl"},{"issue":"4","key":"9684_CR40","doi-asserted-by":"publisher","first-page":"2161","DOI":"10.1007\/s00202-023-01801-x","volume":"105","author":"MA Mellal","year":"2023","unstructured":"Mellal MA, Khitous M, Zemmouri M (2023) Combined heat and power economic dispatch problem with binary method using flower pollination algorithm and differential evolution. Electrc Eng 105(4):2161\u20132168. https:\/\/doi.org\/10.1007\/s00202-023-01801-x","journal-title":"Electrc Eng"},{"key":"9684_CR41","doi-asserted-by":"publisher","DOI":"10.1007\/s42235-023-00478-z","author":"L Feng","year":"2024","unstructured":"Feng L, Zhou Y, Luo Q (2024) Binary hybrid artificial hummingbird with flower pollination algorithm for feature selection in parkinson\u2019s disease diagnosis. J Bionic Eng. https:\/\/doi.org\/10.1007\/s42235-023-00478-z","journal-title":"J Bionic Eng"},{"issue":"1","key":"9684_CR42","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac J, Garc\u00eda S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evolut Comput 1(1):3\u201318. https:\/\/doi.org\/10.1016\/j.swevo.2011.02.002","journal-title":"Swarm Evolut Comput"},{"key":"9684_CR43","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1016\/j.eswa.2018.07.022","volume":"113","author":"MA Al-Betar","year":"2018","unstructured":"Al-Betar MA, Awadallah MA, Faris H, Aljarah I, Hammouri AI (2018) Natural selection methods for grey wolf optimizer. Expert Syst Appl 113:481\u2013498. https:\/\/doi.org\/10.1016\/j.eswa.2018.07.022","journal-title":"Expert Syst Appl"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-024-09684-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-024-09684-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-024-09684-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T14:12:43Z","timestamp":1720447963000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-024-09684-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,19]]},"references-count":43,"journal-issue":{"issue":"20","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["9684"],"URL":"https:\/\/doi.org\/10.1007\/s00521-024-09684-0","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,19]]},"assertion":[{"value":"16 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2024","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 declare they have no financial interests. The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"None.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human participants and\/or animals"}},{"value":"None.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}