{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T10:09:10Z","timestamp":1768817350967,"version":"3.49.0"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T00:00:00Z","timestamp":1680134400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T00:00:00Z","timestamp":1680134400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"DOI":"10.1007\/s42979-023-01743-y","type":"journal-article","created":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T14:07:34Z","timestamp":1680185254000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Modified Hybrid Moth Optimization Algorithm for PFSS Problem"],"prefix":"10.1007","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3496-6711","authenticated-orcid":false,"given":"Anmar","family":"Abuhamdah","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,30]]},"reference":[{"issue":"1","key":"1743_CR1","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson SM. Optimal two-and three-stage production schedules with setup times included. Nav Res Logist Q. 1954;1(1):61\u20138.","journal-title":"Nav Res Logist Q"},{"issue":"1","key":"1743_CR2","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M Nawaz","year":"1983","unstructured":"Nawaz M, Enscore EE, Ham I. A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. Omega. 1983;11(1):91\u20135.","journal-title":"Omega"},{"issue":"1","key":"1743_CR3","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/s10489-011-0317-9","volume":"37","author":"D Ayvaz","year":"2012","unstructured":"Ayvaz D, Topcuoglu H, Gurgen F. Performance evaluation of evolutionary heuristics in dynamic environments. Appl Intell. 2012;37(1):130\u201344. https:\/\/doi.org\/10.1007\/s10489-011-0317-9.","journal-title":"Appl Intell"},{"issue":"4","key":"1743_CR4","doi-asserted-by":"publisher","first-page":"675","DOI":"10.3844\/jcssp.2015.675.691","volume":"11","author":"A Abuhamdah","year":"2015","unstructured":"Abuhamdah A. Adaptive acceptance criterion (AAC) algorithm for optimization problems. J Comput Sci. 2015;11(4):675\u201391. https:\/\/doi.org\/10.3844\/jcssp.2015.675.691.","journal-title":"J Comput Sci"},{"key":"1743_CR5","doi-asserted-by":"publisher","DOI":"10.1504\/IJCAT.2021.10038917","author":"A Abuhamdah","year":"2021","unstructured":"Abuhamdah A, Alzaqebah M, Jawarneh S, Althunibat A, Banikhalaf M. Moth optimisation algorithm with local search for the permutation flow shop scheduling problem. Int J Comput Appl Technol. 2021. https:\/\/doi.org\/10.1504\/IJCAT.2021.10038917.","journal-title":"Int J Comput Appl Technol"},{"key":"1743_CR6","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.knosys.2015.07.006","volume":"89","author":"S Mirjalili","year":"2015","unstructured":"Mirjalili S. Moth-flame optimization algorithm: a novel nature-inspired heuristic paradigm. Knowl-Based Syst. 2015;89:228\u201349. https:\/\/doi.org\/10.1016\/j.knosys.2015.07.006.","journal-title":"Knowl-Based Syst"},{"issue":"3","key":"1743_CR7","doi-asserted-by":"publisher","first-page":"1461","DOI":"10.4249\/scholarpedia.1461","volume":"2","author":"M Dorigo","year":"2007","unstructured":"Dorigo M. Ant colony optimization. Scholarpedia. 2007;2(3):1461. https:\/\/doi.org\/10.4249\/scholarpedia.1461.","journal-title":"Scholarpedia"},{"key":"1743_CR8","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1016\/j.asoc.2015.02.006","volume":"30","author":"JY Ding","year":"2015","unstructured":"Ding JY, Song S, Gupta JN, Zhang R, Chiong R, Wu C. An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem. Appl Soft Comput. 2015;30:604\u201313. https:\/\/doi.org\/10.1016\/j.asoc.2015.02.006.","journal-title":"Appl Soft Comput"},{"key":"1743_CR9","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.cor.2016.07.002","volume":"77","author":"MF Tasgetiren","year":"2017","unstructured":"Tasgetiren MF, Kizilay D, Pan QK, Suganthan PN. Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion. Comput Oper Res. 2017;77:111\u201326. https:\/\/doi.org\/10.1016\/j.cor.2016.07.002.","journal-title":"Comput Oper Res"},{"key":"1743_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2017.09.028","author":"F Zhao","year":"2017","unstructured":"Zhao F, Liu H, Zhang Y, Ma W, Zhang C. A discrete water wave optimization algorithm for no-wait flow shop scheduling problem. Expert Syst Appl. 2017. https:\/\/doi.org\/10.1016\/j.eswa.2017.09.028.","journal-title":"Expert Syst Appl"},{"issue":"1","key":"1743_CR11","doi-asserted-by":"publisher","first-page":"47","DOI":"10.5755\/j01.itc.48.1.20909","volume":"48","author":"BJ Jeen Robert","year":"2019","unstructured":"Jeen Robert BJ, Rajkumar R. A hybrid algorithm for multi-objective optimization of minimizing makespan and total flow time in permutation flow shop scheduling problems. J Inf Technol Control. 2019;48(1):47\u201357. https:\/\/doi.org\/10.5755\/j01.itc.48.1.20909.","journal-title":"J Inf Technol Control"},{"key":"1743_CR12","doi-asserted-by":"publisher","first-page":"012009","DOI":"10.1088\/1757-899X\/857\/1\/012009","volume":"857","author":"A Syarid","year":"2020","unstructured":"Syarid A, Eamiliana A, Lumbanraja P. Study on genetic algorithm (GA) approaches for solving flow shopscheduling problem (FSSP). IOP Conf Ser Mater Sci Eng. 2020;857:012009. https:\/\/doi.org\/10.1088\/1757-899X\/857\/1\/012009.","journal-title":"IOP Conf Ser Mater Sci Eng"},{"issue":"2","key":"1743_CR13","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard E. Benchmarks for basic scheduling problems. Eur J Oper Res. 1993;64(2):278\u201385.","journal-title":"Eur J Oper Res"},{"key":"1743_CR14","doi-asserted-by":"crossref","unstructured":"Mehne SHH, Mirjalili S. Moth-flame optimization algorithm: theory, literature review, and application in optimal nonlinear feedback control design. In: Nature-inspired optimizers. Cham: Springer; 2020.","DOI":"10.1007\/978-3-030-12127-3_9"},{"key":"1743_CR15","doi-asserted-by":"crossref","unstructured":"Yang X, Luo Q, Zhang J, Wu X, Zhou Y. Moth swarm algorithm for clustering analysis. In: Intelligent computing methodologies, ICIC 2017. Cham: Springer; 2017.","DOI":"10.1007\/978-3-319-63315-2_44"},{"key":"1743_CR16","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1007\/s10462-018-09676-2","volume":"53","author":"F Fausto","year":"2019","unstructured":"Fausto F, Reyna-Orta A, Cuevas E, Andrade \u00c1G, Perez-Cisneros M. From ants to whales: metaheuristics for all tastes. Artif Intell Rev. 2019;53:753\u2013810. https:\/\/doi.org\/10.1007\/s10462-018-09676-2.","journal-title":"Artif Intell Rev"},{"issue":"5","key":"1743_CR17","doi-asserted-by":"publisher","first-page":"1699","DOI":"10.1007\/s00500-017-2894-y","volume":"23","author":"S Khalilpourazari","year":"2019","unstructured":"Khalilpourazari S, Khalilpourazary S. An efficient hybrid algorithm based on water cycle and Moth-flame optimization algorithms for solving numerical and constrained engineering optimization problems. Soft Comput. 2019;23(5):1699\u2013722. https:\/\/doi.org\/10.1007\/s00500-017-2894-y.","journal-title":"Soft Comput"},{"key":"1743_CR18","volume-title":"Genetic programming complex adaptive systems genetic programming on the programming of computers by means of natural selection","author":"JH Holland","year":"1992","unstructured":"Holland JH, Langton C, Wilson SW, Varela FJ, Bourgine P, Koza JR, Book AB. Genetic programming complex adaptive systems genetic programming on the programming of computers by means of natural selection. London: MIT Press; 1992."},{"issue":"6","key":"1743_CR19","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1109\/TEVC.2008.919004","volume":"12","author":"D Simon","year":"2008","unstructured":"Simon D. Biogeography-based optimization. IEEE Trans Evolut Comput. 2008;12(6):702\u201313. https:\/\/doi.org\/10.1109\/TEVC.2008.919004.","journal-title":"IEEE Trans Evolut Comput"},{"key":"1743_CR20","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili S, Mirjalili SM, Lewis A. Grey wolf optimizer. Adv Eng Softw. 2014;69:46\u201361. https:\/\/doi.org\/10.1016\/j.advengsoft.2013.12.007.","journal-title":"Adv Eng Softw"},{"key":"1743_CR21","doi-asserted-by":"publisher","first-page":"1286731","DOI":"10.1080\/23311916.2017.1286731","volume":"4","author":"H Buch","year":"2017","unstructured":"Buch H, Trivedi IN, Jangir P. Moth flame optimization to solve flow with non-parametric statistical evaluation validation. Cogent Eng. 2017;4:1286731. https:\/\/doi.org\/10.1080\/23311916.2017.1286731.","journal-title":"Cogent Eng"},{"key":"1743_CR22","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.future.2018.03.020","volume":"85","author":"M Abdel-Basset","year":"2018","unstructured":"Abdel-Basset M, Manogaran G, El-Shahat D, Mirjalili S. A hybrid whale optimization algorithm based on local search strategy for the permutation flow shop scheduling problem. Future Gener Comput Syst. 2018;85:129\u201345.","journal-title":"Future Gener Comput Syst"},{"issue":"3","key":"1743_CR23","doi-asserted-by":"publisher","first-page":"236","DOI":"10.18178\/ijmlc.2018.8.3.693","volume":"8","author":"M Alzaqebah","year":"2018","unstructured":"Alzaqebah M, Jawarneh S, Sarim HM, Abdullah S. Bees algorithm for vehicle routing problems with time windows. Int J Mach Learn Comput. 2018;8(3):236\u201340. https:\/\/doi.org\/10.18178\/ijmlc.2018.8.3.693.","journal-title":"Int J Mach Learn Comput"},{"issue":"5","key":"1743_CR24","doi-asserted-by":"publisher","first-page":"866","DOI":"10.3390\/app9050866","volume":"9","author":"T Zhang","year":"2019","unstructured":"Zhang T, Yang C, Zhao X. Using improved brainstorm optimization algorithm for hardware\/software partitioning. Appl Sci. 2019;9(5):866. https:\/\/doi.org\/10.3390\/app9050866.","journal-title":"Appl Sci"},{"issue":"3","key":"1743_CR25","doi-asserted-by":"publisher","first-page":"2848","DOI":"10.11591\/ijece.v10i3.pp2484-2502","volume":"10","author":"YK Qawqzeh","year":"2020","unstructured":"Qawqzeh YK, Jaradat G, Al-Yousef A, Abu-Hamdah A, Almarashdeh I, Alsmadi M, Tayfour M, Shaker K, Haddad F. Applying the big bang-big crunch metaheuristic to large-sized operational problems. Int J Electr Comput Eng (IJECE). 2020;10(3):2848\u20132502. https:\/\/doi.org\/10.11591\/ijece.v10i3.pp2484-2502.","journal-title":"Int J Electr Comput Eng (IJECE)"},{"issue":"6","key":"1743_CR26","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1016\/j.jksuci.2018.08.007","volume":"32","author":"A Abuhamdah","year":"2020","unstructured":"Abuhamdah A. Adaptive elitist-ant system for medical clustering problem. J King Saud Univ Comput Inf Sci. 2020;32(6):709\u201317. https:\/\/doi.org\/10.1016\/j.jksuci.2018.08.007.","journal-title":"J King Saud Univ Comput Inf Sci"},{"key":"1743_CR27","doi-asserted-by":"publisher","DOI":"10.1504\/IJMOR.2020.10032253","author":"A Abuhamdah","year":"2020","unstructured":"Abuhamdah A. Adaptive black widow optimization algorithm for data clustering. Int J Math Oper Res. 2020. https:\/\/doi.org\/10.1504\/IJMOR.2020.10032253.","journal-title":"Int J Math Oper Res"},{"issue":"1","key":"1743_CR28","doi-asserted-by":"publisher","first-page":"471","DOI":"10.11591\/ijece.v11i1.pp471-480","volume":"11","author":"A Abuhamdah","year":"2021","unstructured":"Abuhamdah A, Boulila W, Jaradat GM, Quteishat AM, Alsmadi MK, Almarashdeh IA. A novel population-based local search for nurse rostering problem. Int J Electr Comput Eng (IJECE). 2021;11(1):471\u201380. https:\/\/doi.org\/10.11591\/ijece.v11i1.pp471-480.","journal-title":"Int J Electr Comput Eng (IJECE)"},{"key":"1743_CR29","doi-asserted-by":"publisher","first-page":"107293","DOI":"10.1016\/j.asoc.2021.107293","volume":"105","author":"A Abuhamdah","year":"2021","unstructured":"Abuhamdah A. Adaptive elitist-ant system for solving combinatorial optimization problems. Appl Soft Comput. 2021;105:107293. https:\/\/doi.org\/10.1016\/j.asoc.2021.107293.","journal-title":"Appl Soft Comput"},{"issue":"7","key":"1743_CR30","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1007\/s00170-007-1120-y","volume":"38","author":"QK Pan","year":"2008","unstructured":"Pan QK, Wang L, Zhao BH. An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion. Int J Adv Manuf Technol. 2008;38(7):778\u201386. https:\/\/doi.org\/10.1007\/s00170-007-1120-y.","journal-title":"Int J Adv Manuf Technol"},{"issue":"1","key":"1743_CR31","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.ijpe.2010.06.006","volume":"128","author":"LY Tseng","year":"2010","unstructured":"Tseng LY, Lin YT. A hybrid genetic algorithm for no-wait flowshop scheduling problem. Int J Prod Econ. 2010;128(1):144\u201352.","journal-title":"Int J Prod Econ"},{"issue":"8","key":"1743_CR32","doi-asserted-by":"publisher","first-page":"2200","DOI":"10.1080\/00207543.2012.711968","volume":"51","author":"D Davendra","year":"2013","unstructured":"Davendra D, Bialic-Davendra M. Scheduling flow shops with blocking using a discrete self-organising migrating algorithm. Int J Prod Res. 2013;51(8):2200\u201318. https:\/\/doi.org\/10.1080\/00207543.2012.711968.","journal-title":"Int J Prod Res"},{"issue":"4","key":"1743_CR33","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1504\/IJCAT.2018.095947","volume":"58","author":"J Zhang","year":"2018","unstructured":"Zhang J, Chen J, Zhang H. Job-shop schedule modelling and parents-crossover evolutionary optimisation for integrated production schedules. Int J Comput Appl Technol. 2018;58(4):288\u201395. https:\/\/doi.org\/10.1504\/IJCAT.2018.095947.","journal-title":"Int J Comput Appl Technol"},{"key":"1743_CR34","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/s10489-013-0444-6","volume":"40","author":"A Abuhamdah","year":"2014","unstructured":"Abuhamdah A, Ayob M, Kendall G, Sabar NR. Population based local search for university course timetabling problems. Appl Intell. 2014;40:44\u201353. https:\/\/doi.org\/10.1007\/s10489-013-0444-6.","journal-title":"Appl Intell"},{"key":"1743_CR35","doi-asserted-by":"publisher","first-page":"3573","DOI":"10.1007\/s13369-017-2577-0","volume":"42","author":"TH Farag","year":"2017","unstructured":"Farag TH, Hassan WA, Ayad HA, AlBahussain AS, Badawi UA, Alsmadi MK. Extended absolute fuzzy connectedness segmentation algorithm utilizing region and boundary-based information. Arabian J Sci Eng. 2017;42:3573\u201383. https:\/\/doi.org\/10.1007\/s13369-017-2577-0.","journal-title":"Arabian J Sci Eng"},{"issue":"3","key":"1743_CR36","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1504\/IJMOR.2018.094850","volume":"13","author":"L Guezouli","year":"2018","unstructured":"Guezouli L, Abdelhamid S. Multi-objective optimisation using genetic algorithm based clustering for multi-depot heterogeneous fleet vehicle routing problem with time windows. Int J Math Oper Res. 2018;13(3):332\u201349. https:\/\/doi.org\/10.1504\/IJMOR.2018.094850.","journal-title":"Int J Math Oper Res"},{"issue":"2","key":"1743_CR37","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1504\/IJMOR.2019.101619","volume":"15","author":"S Rajak","year":"2019","unstructured":"Rajak S, Parthiban P, Dhanalakshmi R. A hybrid metaheuristics approach for a multi-depot vehicle routing problem with simultaneous deliveries and pickups. Int J Math Oper Res. 2019;15(2):197\u2013210. https:\/\/doi.org\/10.1504\/IJMOR.2019.101619.","journal-title":"Int J Math Oper Res"},{"issue":"3","key":"1743_CR38","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1504\/IJCAT.2019.100304","volume":"60","author":"M Hamid","year":"2019","unstructured":"Hamid M, Bastan M, Hamid M, Sheikhahmadi F. Solving a stochastic multi-objective and multi-period hub location problem considering economic aspects by meta-heuristics: application in public transportation. Int J Comput Appl Technol. 2019;60(3):183\u2013202. https:\/\/doi.org\/10.1504\/IJCAT.2019.100304.","journal-title":"Int J Comput Appl Technol"},{"issue":"1","key":"1743_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1504\/IJMOR.2019.096975","volume":"14","author":"F Keynia","year":"2019","unstructured":"Keynia F, Heydari A. A new short-term energy price forecasting method based on wavelet neural network. Int J Math Oper Res. 2019;14(1):1\u201314. https:\/\/doi.org\/10.1504\/IJMOR.2019.096975.","journal-title":"Int J Math Oper Res"},{"key":"1743_CR40","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-981-32-9990-0_8","volume-title":"Evolutionary machine learning techniques","author":"R Abu Khurma","year":"2020","unstructured":"Abu Khurma R, Aljarah I, Sharieh A, Mirjalili S. Evolopy-fs: an open-source nature-inspired optimization framework in python for feature selection. In: Evolutionary machine learning techniques. Singapore: Springer; 2020. p. 131\u201373."},{"issue":"1\/2","key":"1743_CR41","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1504\/IJCAT.2020.107910","volume":"63","author":"A Taha","year":"2020","unstructured":"Taha A, Darwish A, Hassanien AE, ElKholy A. Arabian horse identification based on whale optimised multi-class support vector machine. Int J Comput Appl Technol. 2020;63(1\/2):83\u201392. https:\/\/doi.org\/10.1504\/IJCAT.2020.107910.","journal-title":"Int J Comput Appl Technol"},{"issue":"2","key":"1743_CR42","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1504\/IJCAT.2020.104688","volume":"62","author":"B Prakash","year":"2020","unstructured":"Prakash B, Viswanathan V. A comparative study of meta-heuristic optimisation techniques for prioritisation of risks in agile software development selection. Int J Comput Appl Technol. 2020;62(2):175\u201388. https:\/\/doi.org\/10.1504\/IJCAT.2020.104688.","journal-title":"Int J Comput Appl Technol"},{"issue":"4","key":"1743_CR43","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1016\/j.cor.2008.01.007","volume":"36","author":"GI Zobolas","year":"2009","unstructured":"Zobolas GI, Tarantilis CD, Ioannou G. Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm. Comput Oper Res. 2009;36(4):1249\u201367. https:\/\/doi.org\/10.1016\/j.cor.2008.01.007.","journal-title":"Comput Oper Res"},{"key":"1743_CR44","doi-asserted-by":"publisher","DOI":"10.3390\/sym13071131.13,1131","author":"A Ag\u00e1rdi","year":"2021","unstructured":"Ag\u00e1rdi A, Neh\u00e9z K, Horny\u00e1k O, K\u00f3czy LT. A hybrid discrete bacterial memetic algorithm with simulated annealing for optimization of the flow shop scheduling problem. Symmetry. 2021. https:\/\/doi.org\/10.3390\/sym13071131.13,1131.","journal-title":"Symmetry"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-023-01743-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-023-01743-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-023-01743-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,30]],"date-time":"2023-04-30T10:22:51Z","timestamp":1682850171000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-023-01743-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,30]]},"references-count":44,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2023,5]]}},"alternative-id":["1743"],"URL":"https:\/\/doi.org\/10.1007\/s42979-023-01743-y","relation":{},"ISSN":["2661-8907"],"issn-type":[{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,30]]},"assertion":[{"value":"4 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 February 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 2023","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 author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by the author.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}],"article-number":"298"}}