{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T22:53:20Z","timestamp":1777330400132,"version":"3.51.4"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"14","license":[{"start":{"date-parts":[[2023,4,16]],"date-time":"2023-04-16T00:00:00Z","timestamp":1681603200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,4,16]],"date-time":"2023-04-16T00:00:00Z","timestamp":1681603200000},"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":["61803287"],"award-info":[{"award-number":["61803287"]}],"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":["51875421"],"award-info":[{"award-number":["51875421"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010031","name":"Postdoctoral Research Foundation of China","doi-asserted-by":"publisher","award":["2018M642928"],"award-info":[{"award-number":["2018M642928"]}],"id":[{"id":"10.13039\/501100010031","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2023,7]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>The collaborative robots (cobots) are increasingly being utilized in industries due to the advancement in the field of robotic technology and also due to the increase in labor costs. The cobots on the assembly line can be utilized to complete the tasks independently or assist the workers to complete the tasks. This study considers the U-shaped assembly line balancing problem with cobots, where several cobots with different purchasing costs are selected under the budget constraint. Three mixed-integer programming models are formulated to optimize the cycle time, and the built models are capable of solving the small-sized instances optimally. Two algorithms, artificial bee colony algorithm and migrating bird optimization algorithm, are developed and improved to tackle the large-sized instances, where new encoding scheme and decoding procedure are developed for this new problem. The computational tests demonstrate that the utilization of collaborative robots reduces the cycle time effectively in the assembly line. The comparative study on a set of instances shows that the proposed methodologies obtain competing performance in comparison with other 12 implemented algorithms.<\/jats:p>","DOI":"10.1007\/s00500-023-08130-y","type":"journal-article","created":{"date-parts":[[2023,4,16]],"date-time":"2023-04-16T02:02:10Z","timestamp":1681610530000},"page":"9639-9659","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["Models and algorithms for U-shaped assembly line balancing problem with collaborative robots"],"prefix":"10.1007","volume":"27","author":[{"given":"Zixiang","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8170-2738","authenticated-orcid":false,"given":"Mukund","family":"Janardhanan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiuhua","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zikai","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,16]]},"reference":[{"issue":"4","key":"8130_CR1","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1016\/j.cie.2013.01.001","volume":"64","author":"S Avikal","year":"2013","unstructured":"Avikal S, Jain R, Mishra PK, Yadav HC (2013) A heuristic approach for U-shaped assembly line balancing to improve labor productivity. Comput Ind Eng 64(4):895\u2013901. https:\/\/doi.org\/10.1016\/j.cie.2013.01.001","journal-title":"Comput Ind Eng"},{"issue":"2","key":"8130_CR2","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.ijpe.2012.10.020","volume":"142","author":"O Batta\u00efa","year":"2013","unstructured":"Batta\u00efa O, Dolgui A (2013) A taxonomy of line balancing problems and their solution approaches. Int J Prod Econ 142(2):259\u2013277","journal-title":"Int J Prod Econ"},{"issue":"1","key":"8130_CR3","first-page":"1","volume":"14","author":"A Baykasoglu","year":"2009","unstructured":"Baykasoglu A, Dereli T (2009) Simple and U-type assembly line balancing by using an ant colony based algorithm. Math Comput Appl 14(1):1\u201312","journal-title":"Math Comput Appl"},{"key":"8130_CR4","doi-asserted-by":"publisher","first-page":"106394","DOI":"10.1016\/j.asoc.2020.106394","volume":"93","author":"ZA \u00c7il","year":"2020","unstructured":"\u00c7il ZA, Li Z, Mete S, \u00d6zceylan E (2020) Mathematical model and bee algorithms for mixed-model assembly line balancing problem with physical human\u2013robot collaboration. Appl Soft Comput 93:106394. https:\/\/doi.org\/10.1016\/j.asoc.2020.106394","journal-title":"Appl Soft Comput"},{"issue":"1","key":"8130_CR5","first-page":"70","volume":"9","author":"ZA \u00c7il","year":"2018","unstructured":"\u00c7il ZA, Mete S, \u00d6zceylan E (2018) A mathematical model for semi-robotic assembly line balancing problem: a case study. Int J Lean Think 9(1):70\u201376","journal-title":"Int J Lean Think"},{"issue":"1","key":"8130_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cirp.2019.04.006","volume":"68","author":"M Dalle Mura","year":"2019","unstructured":"Dalle Mura M, Dini G (2019) Designing assembly lines with humans and collaborative robots: a genetic approach. CIRP Ann 68(1):1\u20134. https:\/\/doi.org\/10.1016\/j.cirp.2019.04.006","journal-title":"CIRP Ann"},{"key":"8130_CR7","doi-asserted-by":"publisher","first-page":"106182","DOI":"10.1016\/j.cie.2019.106182","volume":"139","author":"M Eghtesadifard","year":"2020","unstructured":"Eghtesadifard M, Khalifeh M, Khorram M (2020) A systematic review of research themes and hot topics in assembly line balancing through the web of science within 1990\u20132017. Computers Industr Eng 139:106182. https:\/\/doi.org\/10.1016\/j.cie.2019.106182","journal-title":"Computers Industr Eng"},{"issue":"13","key":"8130_CR8","doi-asserted-by":"publisher","first-page":"3003","DOI":"10.1080\/00207540110051905","volume":"39","author":"E Erel","year":"2001","unstructured":"Erel E, Sabuncuoglu I, Aksu BA (2001) Balancing of U-type assembly systems using simulated annealing. Int J Prod Res 39(13):3003\u20133015. https:\/\/doi.org\/10.1080\/00207540110051905","journal-title":"Int J Prod Res"},{"issue":"1","key":"8130_CR9","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/j.ejor.2014.10.036","volume":"242","author":"A Fattahi","year":"2015","unstructured":"Fattahi A, Turkay M (2015) On the MILP model for the U-shaped assembly line balancing problems. Eur J Oper Res 242(1):343\u2013346. https:\/\/doi.org\/10.1016\/j.ejor.2014.10.036","journal-title":"Eur J Oper Res"},{"key":"8130_CR10","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1016\/j.arcontrol.2020.04.009","volume":"49","author":"SE Hashemi-Petroodi","year":"2020","unstructured":"Hashemi-Petroodi SE, Thevenin S, Kovalev S, Dolgui A (2020) Operations management issues in design and control of hybrid human-robot collaborative manufacturing systems: a survey. Annu Rev Control 49:264\u2013276. https:\/\/doi.org\/10.1016\/j.arcontrol.2020.04.009","journal-title":"Annu Rev Control"},{"issue":"16","key":"8130_CR11","doi-asserted-by":"publisher","first-page":"4637","DOI":"10.1080\/00207540701247906","volume":"46","author":"RK Hwang","year":"2008","unstructured":"Hwang RK, Katayama H, Gen M (2008) U-shaped assembly line balancing problem with genetic algorithm. Int J Prod Res 46(16):4637\u20134649. https:\/\/doi.org\/10.1080\/00207540701247906","journal-title":"Int J Prod Res"},{"key":"8130_CR12","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.apm.2018.08.016","volume":"65","author":"MN Janardhanan","year":"2019","unstructured":"Janardhanan MN, Li Z, Bocewicz G, Banaszak Z, Nielsen P (2019) Metaheuristic algorithms for balancing robotic assembly lines with sequence-dependent robot setup times. Appl Math Model 65:256\u2013270. https:\/\/doi.org\/10.1016\/j.apm.2018.08.016","journal-title":"Appl Math Model"},{"key":"8130_CR13","doi-asserted-by":"publisher","first-page":"108292","DOI":"10.1016\/j.ijpe.2021.108292","volume":"242","author":"T Koltai","year":"2021","unstructured":"Koltai T, Dim\u00e9ny I, Gallina V, Gaal A, Sepe C (2021) An analysis of task assignment and cycle times when robots are added to human-operated assembly lines, using mathematical programming models. Int J Prod Econ 242:108292. https:\/\/doi.org\/10.1016\/j.ijpe.2021.108292","journal-title":"Int J Prod Econ"},{"issue":"2","key":"8130_CR14","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1016\/j.cirp.2009.09.009","volume":"58","author":"J Kr\u00fcger","year":"2009","unstructured":"Kr\u00fcger J, Lien TK, Verl A (2009) Cooperation of human and machines in assembly lines. CIRP Ann 58(2):628\u2013646. https:\/\/doi.org\/10.1016\/j.cirp.2009.09.009","journal-title":"CIRP Ann"},{"issue":"9","key":"8130_CR15","doi-asserted-by":"publisher","first-page":"2685","DOI":"10.1007\/s00521-017-2855-5","volume":"30","author":"Z Li","year":"2018","unstructured":"Li Z, Dey N, Ashour AS, Tang Q (2018a) Discrete cuckoo search algorithms for two-sided robotic assembly line balancing problem. Neural Comput Appl 30(9):2685\u20132696. https:\/\/doi.org\/10.1007\/s00521-017-2855-5","journal-title":"Neural Comput Appl"},{"issue":"12","key":"8130_CR16","doi-asserted-by":"publisher","first-page":"9095","DOI":"10.1007\/s00521-018-3957-4","volume":"31","author":"Z Li","year":"2019","unstructured":"Li Z, Janardhanan MN, Ashour AS, Dey N (2019) Mathematical models and migrating birds optimization for robotic U-shaped assembly line balancing problem. Neural Comput Appl 31(12):9095\u20139111. https:\/\/doi.org\/10.1007\/s00521-018-3957-4","journal-title":"Neural Comput Appl"},{"key":"8130_CR17","doi-asserted-by":"publisher","DOI":"10.1080\/0305215X.2020.1741569","author":"Z Li","year":"2020","unstructured":"Li Z, Janardhanan MN, Rahman HF (2020) Enhanced beam search heuristic for U-shaped assembly line balancing problems. Eng Optim. https:\/\/doi.org\/10.1080\/0305215X.2020.1741569","journal-title":"Eng Optim"},{"issue":"14","key":"8130_CR18","doi-asserted-by":"publisher","first-page":"8575","DOI":"10.1007\/s00521-020-05610-2","volume":"33","author":"Z Li","year":"2021","unstructured":"Li Z, Janardhanan MN, Tang Q (2021) Multi-objective migrating bird optimization algorithm for cost-oriented assembly line balancing problem with collaborative robots. Neural Comput Appl 33(14):8575\u20138596. https:\/\/doi.org\/10.1007\/s00521-020-05610-2","journal-title":"Neural Comput Appl"},{"key":"8130_CR19","doi-asserted-by":"publisher","first-page":"100567","DOI":"10.1016\/j.swevo.2019.100567","volume":"50","author":"Z Li","year":"2019","unstructured":"Li Z, Janardhanan MN, Tang Q, Ponnambalam SG (2019) Model and metaheuristics for robotic two-sided assembly line balancing problems with setup times. Swarm Evolutionary Comput 50:100567. https:\/\/doi.org\/10.1016\/j.swevo.2019.100567","journal-title":"Swarm Evolutionary Comput"},{"key":"8130_CR20","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.cie.2017.07.005","volume":"112","author":"Z Li","year":"2017","unstructured":"Li Z, Kucukkoc I, Tang Q (2017) New MILP model and station-oriented ant colony optimization algorithm for balancing U-type assembly lines. Comput Ind Eng 112:107\u2013121. https:\/\/doi.org\/10.1016\/j.cie.2017.07.005","journal-title":"Comput Ind Eng"},{"key":"8130_CR21","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.cie.2018.06.037","volume":"124","author":"Z Li","year":"2018","unstructured":"Li Z, Kucukkoc I, Zhang Z (2018b) Branch, bound and remember algorithm for U-shaped assembly line balancing problem. Comput Ind Eng 124:24\u201335. https:\/\/doi.org\/10.1016\/j.cie.2018.06.037","journal-title":"Comput Ind Eng"},{"issue":"10","key":"8130_CR22","doi-asserted-by":"publisher","first-page":"1378","DOI":"10.1287\/mnsc.40.10.1378","volume":"40","author":"GJ Miltenburg","year":"1994","unstructured":"Miltenburg GJ, Wijngaard J (1994) The U-line line balancing problem. Manage Sci 40(10):1378\u20131388","journal-title":"Manage Sci"},{"issue":"2","key":"8130_CR23","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1080\/0305215X.2014.998664","volume":"48","author":"JM Nilakantan","year":"2016","unstructured":"Nilakantan JM, Ponnambalam S (2016) Robotic U-shaped assembly line balancing using particle swarm optimization. Eng Optim 48(2):231\u2013252","journal-title":"Eng Optim"},{"key":"8130_CR24","doi-asserted-by":"publisher","first-page":"105674","DOI":"10.1016\/j.cor.2021.105674","volume":"140","author":"A Nourmohammadi","year":"2022","unstructured":"Nourmohammadi A, Fathi M, Ng AHC (2022) Balancing and scheduling assembly lines with human-robot collaboration tasks. Computers Op Res 140:105674. https:\/\/doi.org\/10.1016\/j.cor.2021.105674","journal-title":"Computers Op Res"},{"key":"8130_CR25","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.cie.2017.08.030","volume":"112","author":"MK Oksuz","year":"2017","unstructured":"Oksuz MK, Buyukozkan K, Satoglu SI (2017) U-shaped assembly line worker assignment and balancing problem: a mathematical model and two meta-heuristics. Comput Ind Eng 112:246\u2013263. https:\/\/doi.org\/10.1016\/j.cie.2017.08.030","journal-title":"Comput Ind Eng"},{"issue":"1","key":"8130_CR26","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10845-008-0108-2","volume":"20","author":"U \u00d6zcan","year":"2009","unstructured":"\u00d6zcan U, Toklu B (2009) A new hybrid improvement heuristic approach to simple straight and U-type assembly line balancing problems. J Intell Manuf 20(1):123\u2013136. https:\/\/doi.org\/10.1007\/s10845-008-0108-2","journal-title":"J Intell Manuf"},{"issue":"1","key":"8130_CR27","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10846-020-01177-1","volume":"100","author":"M Rabbani","year":"2020","unstructured":"Rabbani M, Behbahan SZB, Farrokhi-Asl H (2020) The collaboration of human-robot in mixed-model four-sided assembly line balancing problem. J Intell Rob Syst 100(1):71\u201381. https:\/\/doi.org\/10.1007\/s10846-020-01177-1","journal-title":"J Intell Rob Syst"},{"issue":"2","key":"8130_CR28","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/j.ijpe.2008.11.017","volume":"120","author":"I Sabuncuoglu","year":"2009","unstructured":"Sabuncuoglu I, Erel E, Alp A (2009) Ant colony optimization for the single model U-type assembly line balancing problem. Int J Prod Econ 120(2):287\u2013300. https:\/\/doi.org\/10.1016\/j.ijpe.2008.11.017","journal-title":"Int J Prod Econ"},{"key":"8130_CR29","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.apm.2019.02.019","volume":"72","author":"P Samouei","year":"2019","unstructured":"Samouei P, Ashayeri J (2019) Developing optimization and robust models for a mixed-model assembly line balancing problem with semi-automated operations. Appl Math Model 72:259\u2013275. https:\/\/doi.org\/10.1016\/j.apm.2019.02.019","journal-title":"Appl Math Model"},{"issue":"4","key":"8130_CR30","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1080\/002075499191481","volume":"37","author":"A Scholl","year":"1999","unstructured":"Scholl A, Klein R (1999) ULINO: Optimally balancing U-shaped JIT assembly lines. Int J Prod Res 37(4):721\u2013736. https:\/\/doi.org\/10.1080\/002075499191481","journal-title":"Int J Prod Res"},{"issue":"3","key":"8130_CR31","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1016\/j.ejor.2004.07.027","volume":"168","author":"TL Urban","year":"2006","unstructured":"Urban TL, Chiang W-C (2006) An optimal piecewise-linear program for the U-line balancing problem with stochastic task times. Eur J Op Res 168(3):771\u2013782. https:\/\/doi.org\/10.1016\/j.ejor.2004.07.027","journal-title":"Eur J Op Res"},{"key":"8130_CR32","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s40685-019-0101-y","volume":"13","author":"C Weckenborg","year":"2020","unstructured":"Weckenborg C, Kieckh\u00e4fer K, M\u00fcller C, Grunewald M, Spengler TS (2020) Balancing of assembly lines with collaborative robots. Bus Res 13:93\u2013132. https:\/\/doi.org\/10.1007\/s40685-019-0101-y","journal-title":"Bus Res"},{"issue":"13","key":"8130_CR33","doi-asserted-by":"publisher","first-page":"1860","DOI":"10.1016\/j.ifacol.2019.11.473","volume":"52","author":"C Weckenborg","year":"2019","unstructured":"Weckenborg C, Spengler TS (2019) Assembly line balancing with collaborative robots under consideration of ergonomics: a cost-oriented approach. IFAC-PapersOnLine 52(13):1860\u20131865. https:\/\/doi.org\/10.1016\/j.ifacol.2019.11.473","journal-title":"IFAC-PapersOnLine"},{"key":"8130_CR34","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1016\/j.jmsy.2022.02.005","volume":"62","author":"C Weckenborg","year":"2022","unstructured":"Weckenborg C, Thies C, Spengler TS (2022) Harmonizing ergonomics and economics of assembly lines using collaborative robots and exoskeletons. J Manuf Syst 62:681\u2013702. https:\/\/doi.org\/10.1016\/j.jmsy.2022.02.005","journal-title":"J Manuf Syst"},{"key":"8130_CR35","doi-asserted-by":"crossref","unstructured":"Yaphiar S, Nugraha C, and Ma\u2019ruf A (2020). Mixed Model Assembly Line Balancing for Human-Robot Shared Tasks. Paper presented at the International Manufacturing Engineering Conference and The Asia Pacific Conference on Manufacturing Systems 2019, Singapore.","DOI":"10.1007\/978-981-15-0950-6_38"},{"issue":"11","key":"8130_CR36","doi-asserted-by":"publisher","first-page":"7501","DOI":"10.1007\/s00521-018-3596-9","volume":"31","author":"Z Zhang","year":"2019","unstructured":"Zhang Z, Tang Q, Han D, Li Z (2019) Enhanced migrating birds optimization algorithm for U-shaped assembly line balancing problems with workers assignment. Neural Comput Appl 31(11):7501\u20137515. https:\/\/doi.org\/10.1007\/s00521-018-3596-9","journal-title":"Neural Comput Appl"},{"issue":"17","key":"8130_CR37","doi-asserted-by":"publisher","first-page":"5520","DOI":"10.1080\/00207543.2018.1530479","volume":"57","author":"Z Zhang","year":"2019","unstructured":"Zhang Z, Tang Q, Li Z, Zhang L (2019b) Modelling and optimisation of energy-efficient U-shaped robotic assembly line balancing problems. Int J Prod Res 57(17):5520\u20135537. https:\/\/doi.org\/10.1080\/00207543.2018.1530479","journal-title":"Int J Prod Res"},{"key":"8130_CR38","doi-asserted-by":"publisher","first-page":"104905","DOI":"10.1016\/j.cor.2020.104905","volume":"118","author":"Z Zhang","year":"2020","unstructured":"Zhang Z, Tang Q, Ruiz R, Zhang L (2020) Ergonomic risk and cycle time minimization for the U-shaped worker assignment assembly line balancing problem: a multi-objective approach. Computers Op Res 118:104905. https:\/\/doi.org\/10.1016\/j.cor.2020.104905","journal-title":"Computers Op Res"},{"key":"8130_CR39","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1016\/j.jclepro.2019.01.030","volume":"215","author":"Z Zhang","year":"2019","unstructured":"Zhang Z, Tang Q, Zhang L (2019c) Mathematical model and grey wolf optimization for low-carbon and low-noise U-shaped robotic assembly line balancing problem. J Clean Prod 215:744\u2013756. https:\/\/doi.org\/10.1016\/j.jclepro.2019.01.030","journal-title":"J Clean Prod"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-08130-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-023-08130-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-08130-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,6]],"date-time":"2023-06-06T13:41:03Z","timestamp":1686058863000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-023-08130-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,16]]},"references-count":39,"journal-issue":{"issue":"14","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["8130"],"URL":"https:\/\/doi.org\/10.1007\/s00500-023-08130-y","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-418816\/v1","asserted-by":"object"}]},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,16]]},"assertion":[{"value":"29 March 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2023","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":"The authors did not use any humans and animals in this research work.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human and animal rights"}}]}}