{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T14:24:34Z","timestamp":1772202274409,"version":"3.50.1"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"19","license":[{"start":{"date-parts":[[2022,8,21]],"date-time":"2022-08-21T00:00:00Z","timestamp":1661040000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,8,21]],"date-time":"2022-08-21T00:00:00Z","timestamp":1661040000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["32060193"],"award-info":[{"award-number":["32060193"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62062047"],"award-info":[{"award-number":["62062047"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61962031"],"award-info":[{"award-number":["61962031"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["82172058"],"award-info":[{"award-number":["82172058"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007471","name":"Applied Basic Research Foundation of Yunnan Province","doi-asserted-by":"publisher","award":["202101AT070082"],"award-info":[{"award-number":["202101AT070082"]}],"id":[{"id":"10.13039\/100007471","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2022,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Beetle Antennae Search algorithm is a kind of intelligent optimization algorithms, which has the advantages of few parameters and simplicity. However, due to its inherent limitations, BAS has poor performance in complex optimization problems. The existing improvements of BAS are mainly based on the utilization of multiple beetles or combining BAS with other algorithms. The present study improves BAS from its origin and keeps the simplicity of the algorithm. First, an adaptive step size reduction method is used to increase the usability of the algorithm, which is based on an accurate factor and curvilinearly reduces the step size; second, the calculated information of fitness functions during each iteration are fully utilized with a contemporary optimal update strategy to promote the optimization processes; third, the theoretical analysis of the multi-directional sensing method is conducted and utilized to further improve the efficiency of the algorithm. Finally, the proposed Enhanced Beetle Antennae Search algorithm is compared with many other algorithms based on unbiased test functions. The test functions are unbiased when their solution space does not contain simple patterns, which may be used to facilitate the searching processes. As a result, EBAS outperformed BAS with at least 1 orders of magnitude difference. The performance of EBAS was even better than several state-of-the-art swarm-based algorithms, such as Slime Mold Algorithm and Grey Wolf Optimization, with similar running times. In addition, a WSN coverage optimization problem is tested to demonstrate the applicability of EBAS on real-world optimizations.<\/jats:p>","DOI":"10.1007\/s00500-022-07388-y","type":"journal-article","created":{"date-parts":[[2022,8,21]],"date-time":"2022-08-21T14:02:32Z","timestamp":1661090552000},"page":"10331-10369","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Enhanced beetle antennae search algorithm for complex and unbiased optimization"],"prefix":"10.1007","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1675-3547","authenticated-orcid":false,"given":"Qian","family":"Qian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Deng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiawen","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jibin","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunfa","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingna","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,21]]},"reference":[{"key":"7388_CR1","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s00500-008-0323-y","volume":"13","author":"J Alcal\u00e1-Fdez","year":"2009","unstructured":"Alcal\u00e1-Fdez J, S\u00e1nchez L, Garc\u00eda S et al (2009) KEEL: a software tool to assess evolutionary algorithms for data mining problems. Soft Comput 13:307\u2013318. https:\/\/doi.org\/10.1007\/s00500-008-0323-y","journal-title":"Soft Comput"},{"key":"7388_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-021-05948-2","author":"A Al-Shaikh","year":"2021","unstructured":"Al-Shaikh A, Mahafzah BA, Alshraideh M (2021) Hybrid harmony search algorithm for social network contact tracing of COVID-19. Soft Comput. https:\/\/doi.org\/10.1007\/s00500-021-05948-2","journal-title":"Soft Comput"},{"key":"7388_CR3","doi-asserted-by":"publisher","first-page":"11699","DOI":"10.1007\/s00500-018-03721-6","volume":"23","author":"BA Attea","year":"2019","unstructured":"Attea BA, Abbas MN, Al-Ani M, Suat OS (2019) Bio-inspired multi-objective algorithms for connected set K-covers problem in wireless sensor networks. Soft Comput 23:11699\u201311728. https:\/\/doi.org\/10.1007\/s00500-018-03721-6","journal-title":"Soft Comput"},{"key":"7388_CR4","volume-title":"Problem definitions and evaluation criteria for the CEC 2017 special session and competition on single objective real-parameter numerical optimization","author":"NH Awad","year":"2016","unstructured":"Awad NH, Ali MZ, Suganthan PN, Liang JJ, Qu BY (2016) Problem definitions and evaluation criteria for the CEC 2017 special session and competition on single objective real-parameter numerical optimization. Technical Report, Nanyang Technological University, Singapore"},{"key":"7388_CR5","volume-title":"Nonlinear programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas DP (1999) Nonlinear programming. Athena scientific, Belmont"},{"key":"7388_CR6","doi-asserted-by":"publisher","first-page":"1470","DOI":"10.1109\/CEC.1999.782657","volume":"2","author":"M Dorigo","year":"1999","unstructured":"Dorigo M, Di-Caro G (1999) Ant colony optimization: a new metaheuristic. Proc Congr Evol Comput-CEC 2:1470\u20131477. https:\/\/doi.org\/10.1109\/CEC.1999.782657","journal-title":"Proc Congr Evol Comput-CEC"},{"key":"7388_CR7","doi-asserted-by":"publisher","first-page":"14825","DOI":"10.1007\/s00500-020-04834-7","volume":"24","author":"Q Fan","year":"2020","unstructured":"Fan Q, Chen Z, Xia Z (2020) A novel quasi-reflected Harris hawks optimization algorithm for global optimization problems. Soft Comput 24:14825\u201314843. https:\/\/doi.org\/10.1007\/s00500-020-04834-7","journal-title":"Soft Comput"},{"key":"7388_CR8","doi-asserted-by":"publisher","first-page":"113882","DOI":"10.1016\/j.eswa.2020.113882","volume":"165","author":"Q Fan","year":"2021","unstructured":"Fan Q, Huang H, Li Y, Han Z, Hu Y, Huang D (2021) Beetle antenna strategy based grey wolf optimization. Expert Syst Appl 165:113882","journal-title":"Expert Syst Appl"},{"key":"7388_CR9","doi-asserted-by":"publisher","first-page":"9701","DOI":"10.1007\/s00500-018-3536-8","volume":"23","author":"M Ghasemi","year":"2019","unstructured":"Ghasemi M, Akbari E, Rahimnejad A et al (2019) Phasor particle swarm optimization: a simple and efficient variant of PSO. Soft Comput 23:9701\u20139718. https:\/\/doi.org\/10.1007\/s00500-018-3536-8","journal-title":"Soft Comput"},{"key":"7388_CR10","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1016\/j.future.2019.02.028","volume":"97","author":"AA Heidari","year":"2019","unstructured":"Heidari AA, Mirjalili S, Faris H, Aljarah I, Mafarja M, Chen H (2019) Harris hawks optimization: algorithm and applications. Futur Gener Comput Syst 97:849\u2013872. https:\/\/doi.org\/10.1016\/j.future.2019.02.028","journal-title":"Futur Gener Comput Syst"},{"issue":"1","key":"7388_CR11","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1038\/scientificamerican0792-66","volume":"267","author":"JH Holland","year":"1992","unstructured":"Holland JH (1992) Genetic algorithms. Sci Am 267(1):66\u201372","journal-title":"Sci Am"},{"key":"7388_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.5430\/ijrc.v1n1p1","volume":"1","author":"X Jiang","year":"2018","unstructured":"Jiang X, Li S (2018) BAS: beetle antennae search algorithm for optimization problems. Int J Robot Control 1:1. https:\/\/doi.org\/10.5430\/ijrc.v1n1p1","journal-title":"Int J Robot Control"},{"issue":"3","key":"7388_CR13","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","volume":"39","author":"D Karaboga","year":"2007","unstructured":"Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Global Optim 39(3):459\u2013471. https:\/\/doi.org\/10.1007\/s10898-007-9149-x","journal-title":"J Global Optim"},{"key":"7388_CR14","doi-asserted-by":"publisher","first-page":"1941","DOI":"10.1109\/ICNN.1995.488968","volume":"4","author":"J Kennedy","year":"1995","unstructured":"Kennedy J, Eberhart R (1995) PSO optimization. Proc IEEE Int Conf Neural Netw IEEE Serv Cent Piscataway NJ 4:1941\u20131948. https:\/\/doi.org\/10.1109\/ICNN.1995.488968","journal-title":"Proc IEEE Int Conf Neural Netw IEEE Serv Cent Piscataway NJ"},{"issue":"02","key":"7388_CR15","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1109\/JAS.2020.1003048","volume":"7","author":"AH Khan","year":"2020","unstructured":"Khan AH, Cao X, Li S, Katsikis VN, Liao L (2020) Bas-adam: an adam based approach to improve the performance of beetle antennae search optimizer. IEEE\/CAA J Autom Sin 7(02):150\u2013160. https:\/\/doi.org\/10.1109\/JAS.2020.1003048","journal-title":"IEEE\/CAA J Autom Sin"},{"key":"7388_CR16","first-page":"159","volume":"10","author":"H Khattab","year":"2019","unstructured":"Khattab H, Sharieh A, Mahafzah BA (2019) Most valuable player algorithm for solving minimum vertex cover problem. Int J Adv Comput Sci Appl 10:159\u2013167","journal-title":"Int J Adv Comput Sci Appl"},{"key":"7388_CR17","unstructured":"Kingma D, Ba J(2014) Adam: a method for stochastic optimization. arXiv: 1412.6980"},{"issue":"4","key":"7388_CR18","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1016\/j.jcde.2017.02.005","volume":"5","author":"M Kohli","year":"2018","unstructured":"Kohli M, Arora S (2018) Chaotic grey wolf optimization algorithm for constrained optimization problems - sciencedirect. J Comput Des Eng 5(4):458\u2013472. https:\/\/doi.org\/10.1016\/j.jcde.2017.02.005","journal-title":"J Comput Des Eng"},{"issue":"2","key":"7388_CR19","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1007\/s10846-008-9277-7","volume":"10","author":"J Langford","year":"2009","unstructured":"Langford J, Li L, Tong Z (2009) Sparse online learning via truncated gradient. J Mach Learn Res 10(2):777\u2013801. https:\/\/doi.org\/10.1007\/s10846-008-9277-7","journal-title":"J Mach Learn Res"},{"issue":"3","key":"7388_CR20","first-page":"745","volume":"38","author":"L Liao","year":"2021","unstructured":"Liao L, Ouyang Z (2021) Beetle antennae search based on quadratic interpolation. Appl Res Comput 38(3):745\u2013750","journal-title":"Appl Res Comput"},{"key":"7388_CR21","first-page":"396","volume":"1","author":"MJ Lin","year":"2018","unstructured":"Lin MJ, Li Q (2018) A hybrid optimization method of beetle antennae search algorithm and particle swarm optimization. Trans Eng Technol Res 1:396\u2013401","journal-title":"Trans Eng Technol Res"},{"key":"7388_CR22","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.future.2020.03.055","volume":"111","author":"S Li","year":"2020","unstructured":"Li S, Chen H, Wang M, Heidari AA, Mirjalili S (2020) Slime mould algorithm: a new method for stochastic optimization. Futur Gener Comput Syst 111:300\u2013323. https:\/\/doi.org\/10.1016\/j.future.2020.03.055","journal-title":"Futur Gener Comput Syst"},{"key":"7388_CR23","doi-asserted-by":"publisher","first-page":"2741","DOI":"10.1007\/s00500-020-05334-4","volume":"25","author":"BA Mahafzah","year":"2021","unstructured":"Mahafzah BA, Jabri R, Murad O (2021) Multithreaded scheduling for program segments based on chemical reaction optimizer. Soft Comput 25:2741\u20132766. https:\/\/doi.org\/10.1007\/s00500-020-05334-4","journal-title":"Soft Comput"},{"issue":"2","key":"7388_CR24","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1108\/IJWIS-11-2020-0071","volume":"17","author":"R Masadeh","year":"2021","unstructured":"Masadeh R, Alsharman N, Sharieh AA, Mahafzah BA, Abdulrahman A (2021) Task scheduling on cloud computing based on sea lion optimization algorithm. Int J Web Infor Syst 17(2):99\u2013116","journal-title":"Int J Web Infor Syst"},{"key":"7388_CR25","doi-asserted-by":"publisher","first-page":"14297","DOI":"10.1007\/s00500-021-06140-2","volume":"25","author":"MK Naik","year":"2021","unstructured":"Naik MK, Panda R, Abraham A (2021) Adaptive opposition slime mould algorithm. Soft Comput 25:14297\u201314313. https:\/\/doi.org\/10.1007\/s00500-021-06140-2","journal-title":"Soft Comput"},{"issue":"1","key":"7388_CR26","doi-asserted-by":"publisher","first-page":"1483565","DOI":"10.1080\/25742558.2018.1483565","volume":"5","author":"J Nasiri","year":"2018","unstructured":"Nasiri J, Khiyabani FM (2018) A whale optimization algorithm (WOA) approach for clustering. Cogent Math Stat 5(1):1483565. https:\/\/doi.org\/10.1080\/25742558.2018.1483565","journal-title":"Cogent Math Stat"},{"issue":"18","key":"7388_CR27","first-page":"188","volume":"54","author":"L Shao","year":"2018","unstructured":"Shao L, Han RD (2018) Beetle antenna search flower pollination algorithm. Comput Eng Appl 54(18):188\u2013194","journal-title":"Comput Eng Appl"},{"key":"7388_CR28","volume-title":"Handbook of parametric and nonparametric statistical procedures","author":"DJ Sheskin","year":"2004","unstructured":"Sheskin DJ (2004) Handbook of parametric and nonparametric statistical procedures. CRC Press, Francis"},{"key":"7388_CR29","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10107-007-0170-0","volume":"117","author":"P Tseng","year":"2009","unstructured":"Tseng P, Yun S (2009) A coordinate gradient descent method for nonsmooth separable minimization. Math Program 117:387\u2013423. https:\/\/doi.org\/10.1007\/s10107-007-0170-0","journal-title":"Math Program"},{"key":"7388_CR30","doi-asserted-by":"crossref","unstructured":"van Laarhoven PJM, Aarts EHL (1987) Annealing: theory and applications. In: Mathematics and its applications, Springer, Dordrecht, pp 15","DOI":"10.1007\/978-94-015-7744-1"},{"key":"7388_CR31","unstructured":"Wang J, Chen H (2018) BSAS:beetle swarm antennae search algorithm for optimization problems. arXiv:1807.10470"},{"key":"7388_CR32","unstructured":"Wang T,Yang L,Liu Q (2018) Beetle swarm optimization algorithm:theory and application. arXiv:1808.00206"},{"key":"7388_CR33","doi-asserted-by":"publisher","first-page":"2369","DOI":"10.1007\/s00500-019-04067-3","volume":"24","author":"Q Wu","year":"2020","unstructured":"Wu Q, Lin H, Jin Y et al (2020) A new fallback beetle antennae search algorithm for path planning of mobile robots with collision-free capability. Soft Comput 24:2369\u20132380. https:\/\/doi.org\/10.1007\/s00500-019-04067-3","journal-title":"Soft Comput"},{"key":"7388_CR34","doi-asserted-by":"publisher","first-page":"106542","DOI":"10.1016\/j.oceaneng.2019.106542","volume":"192","author":"S Xie","year":"2019","unstructured":"Xie S, Chu X, Zheng M, Liu C (2019) Ship predictive collision avoidance method based on an improved beetle antennae search algorithm. Ocean Eng 192:106542. https:\/\/doi.org\/10.1016\/j.oceaneng.2019.106542","journal-title":"Ocean Eng"},{"issue":"1","key":"7388_CR35","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1080\/21642583.2019.1708830","volume":"8","author":"J Xue","year":"2020","unstructured":"Xue J, Shen B (2020) A novel swarm intelligence optimization approach: sparrow search algorithm. Syst Sci Cont Eng 8(1):22\u201334. https:\/\/doi.org\/10.1080\/21642583.2019.1708830","journal-title":"Syst Sci Cont Eng"},{"issue":"1","key":"7388_CR36","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1080\/21642583.2019.1708829","volume":"8","author":"X Xu","year":"2020","unstructured":"Xu X, Deng K, Shen B (2020) A beetle antennae search algorithm based on l\u00e9vy flights and adaptive strategy. Syst Sci Cont Eng Open Access J 8(1):35\u201347. https:\/\/doi.org\/10.1080\/21642583.2019.1708829","journal-title":"Syst Sci Cont Eng Open Access J"},{"key":"7388_CR37","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-642-32894-7_27","volume-title":"Unconventional computation and natural computation lecture notes in computer science","author":"XS Yang","year":"2012","unstructured":"Yang XS (2012) Flower pollination algorithm for global optimization. In: Durand-Lose J, Jonoska N (eds) Unconventional computation and natural computation lecture notes in computer science, vol 7445. Springer, Berlin, Heidelberg, p 240"},{"key":"7388_CR38","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s12293-020-00301-w","volume":"12","author":"X Zhang","year":"2020","unstructured":"Zhang X, Yang Z, Cao F et al (2020b) Conditioning optimization of extreme learning machine by multitask beetle antennae swarm algorithm. Memet Comput 12:151\u2013164. https:\/\/doi.org\/10.1007\/s12293-020-00301-w","journal-title":"Memet Comput"},{"key":"7388_CR39","doi-asserted-by":"publisher","first-page":"128416","DOI":"10.1109\/ACCESS.2020.3008692","volume":"8","author":"H Zhang","year":"2020","unstructured":"Zhang H, Li Z, Jiang X, Ma X, Ma S (2020a) (2020) Beetle colony optimization algorithm and its application. IEEE Access 8:128416\u2013128425. https:\/\/doi.org\/10.1109\/ACCESS.2020.3008692","journal-title":"IEEE Access"},{"key":"7388_CR40","doi-asserted-by":"publisher","first-page":"10595","DOI":"10.1007\/s00500-021-05991-z","volume":"25","author":"Y Zhang","year":"2021","unstructured":"Zhang Y, Li S, Xu B (2021) Convergence analysis of beetle antennae search algorithm and its applications. Soft Comput 25:10595\u201310608. https:\/\/doi.org\/10.1007\/s00500-021-05991-z","journal-title":"Soft Comput"},{"issue":"11","key":"7388_CR41","first-page":"2582","volume":"51","author":"YQ Zhao","year":"2018","unstructured":"Zhao YQ, Qian Q (2018) Novel chaos beetle swarm searching algorithm with learning and competitive strategies. Commun Technol 51(11):2582\u20132588","journal-title":"Commun Technol"},{"issue":"7","key":"7388_CR42","first-page":"1438","volume":"41","author":"YQ Zhao","year":"2020","unstructured":"Zhao YQ, Qian Q, Zhou TJ, Fu YF (2020) Hybrid optimization algorithm based on Beetle antennae search and genetic evolution. J Chin Comput Syst 41(7):1438\u20131445","journal-title":"J Chin Comput Syst"},{"issue":"07","key":"7388_CR43","first-page":"1626","volume":"52","author":"TJ Zhou","year":"2019","unstructured":"Zhou TJ, Qian Q, Fu YF (2019) Fusion simulated annealing and adaptive beetle antennae search algorithm. Commun Technol 52(07):1626\u20131631","journal-title":"Commun Technol"},{"key":"7388_CR44","doi-asserted-by":"publisher","first-page":"5296","DOI":"10.1109\/ACCESS.2020.3047816","volume":"9","author":"L Zhou","year":"2021","unstructured":"Zhou L, Chen K, Dong H et al (2021) An improved beetle swarm optimization algorithm for the intelligent navigation control of autonomous sailing robots. IEEE Access 9:5296\u20135311. https:\/\/doi.org\/10.1109\/ACCESS.2020.3047816","journal-title":"IEEE Access"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-07388-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-022-07388-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-07388-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,12]],"date-time":"2022-09-12T15:26:57Z","timestamp":1662996417000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-022-07388-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,21]]},"references-count":44,"journal-issue":{"issue":"19","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["7388"],"URL":"https:\/\/doi.org\/10.1007\/s00500-022-07388-y","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,21]]},"assertion":[{"value":"29 June 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 August 2022","order":2,"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 that they have 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 any of the authors. The data of the manuscript can be requested, please contact the corresponding author.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human and animal rights"}}]}}