{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T20:24:54Z","timestamp":1771705494619,"version":"3.50.1"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T00:00:00Z","timestamp":1648425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T00:00:00Z","timestamp":1648425600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["2020JBW004"],"award-info":[{"award-number":["2020JBW004"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71801013"],"award-info":[{"award-number":["71801013"]}],"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":["72111530098"],"award-info":[{"award-number":["72111530098"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100009625","name":"Beijing Social Science Fund","doi-asserted-by":"publisher","award":["18GLC078"],"award-info":[{"award-number":["18GLC078"]}],"id":[{"id":"10.13039\/501100009625","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Wireless Com Network"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Motivated by the practical supply chain management of the automobile industry, we study the car sequencing problem (CSP) that minimizes the conflicts occur when sequentially manufacturing cars on an assembly line. The CSP is a well-established problem, subject to the paint batching constraints to decrease the energy consumption for color changeovers and production rate constraints in the assembly shop to ensure a smooth usage of car options. However, the existing solution algorithms to this problem do not take into account the block batches, which desires a consecutive production batch of cars requiring a certain option. This requirement often occurs when specialized labor time window is short in the customized car production scenario, and renders additional complexities to the traditional car sequencing problem. In this paper, we present a novel model to deal with these constraints and simultaneously generate the sequencing and replenishment decisions. Besides, we develop two math-heuristic algorithms to solve the proposed large-scale CSP. The presented heuristics are on the basis of relax-and-fix procedures, fix-and-optimize procedures and adaptive variable neighborhood search. To solve the large-sized instances (commercial solvers, i.e., Cplex, cannot obtain a feasible result within 1\u00a0h), we design and implement a reinforced parameter tuning mechanism to dynamically select the parameter values, so as to speed up the search process. The proposed models and heuristics are tested on representative instances generated from the benchmark in the literature (CSPLib), as well as large-sized instances generated from real-world cases. We report on extensive computational experiments and provide basic managerial insights into the planning process.<\/jats:p>","DOI":"10.1186\/s13638-022-02113-7","type":"journal-article","created":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T01:03:50Z","timestamp":1648515830000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Heuristic approaches for the car sequencing problems with block batches"],"prefix":"10.1186","volume":"2022","author":[{"given":"Yingjie","family":"Yu","sequence":"first","affiliation":[]},{"given":"Xiaochun","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Tao","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Minjiao","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"Lin","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Wenchao","family":"Wei","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,28]]},"reference":[{"issue":"3","key":"2113_CR1","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1287\/mnsc.47.3.480.9777","volume":"47","author":"D Andreas","year":"2001","unstructured":"D. Andreas, K. Alf, Sequencing JIT mixed-model assembly lines under station-load and part-usage constraints. Manag. Sci. 47(3), 480\u2013491 (2001)","journal-title":"Manag. Sci."},{"key":"2113_CR2","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s10479-007-0278-x","volume":"159","author":"J Bautista","year":"2008","unstructured":"J. Bautista, J. Pereira, B. Adenso-D\u00edaz, A beam search approach for the optimization version of the car sequencing problem. Annu. Oper. Res. 159, 233\u2013244 (2008)","journal-title":"Annu. Oper. Res."},{"key":"2113_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10951-007-0046-4","volume":"11","author":"J Bautista","year":"2008","unstructured":"J. Bautista, J. Pereira, B. Adenso-D\u00edaz, A GRASP approach for the extended car sequencing problem. J. Schedul. 11, 3\u201316 (2008)","journal-title":"J. Schedul."},{"key":"2113_CR4","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/3-540-45153-6_9","volume-title":"Advances in Artificial Intelligence","author":"ME Bergen","year":"2001","unstructured":"M.E. Bergen, P. van Beek, T. Carchrae, Constraint-based vehicle assembly line sequencing, in Advances in Artificial Intelligence. ed. by E. Stroulia, S. Matwin (Springer, Berlin, 2001), pp. 88\u201399"},{"key":"2113_CR5","doi-asserted-by":"publisher","first-page":"105546","DOI":"10.1016\/j.cie.2018.11.056","volume":"139","author":"S Bysko","year":"2020","unstructured":"S. Bysko, J. Krystek, S. Bysko, Automotive Paint Shop 4.0. Comput. Ind. Eng. 139, 105546 (2020)","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"2113_CR6","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1016\/j.ejor.2007.04.048","volume":"191","author":"J-F Cordeau","year":"2008","unstructured":"J.-F. Cordeau, G. Laporte, F. Pasin, Iterated Tabu search for the car sequencing problem. Eur. J. Oper. Res. 191(3), 945\u2013956 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"2113_CR7","unstructured":"M. Dincbas, H. Simonis, P.\u00a0Van Hentenryck, Solving the car sequencing problem in constraint logic programming, in European Conference on Artificial Intelligence (ECAI-88 (1988)"},{"issue":"3","key":"2113_CR8","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1287\/mnsc.47.3.480.9777","volume":"47","author":"A Drexl","year":"2001","unstructured":"A. Drexl, A. Kimms, Sequencing jit mixed-model assembly lines under station load and part-usage constraints. Manag. Sci. 47(3), 480\u2013491 (2001)","journal-title":"Manag. Sci."},{"key":"2113_CR9","first-page":"140","volume":"88","author":"LF Escudero","year":"2005","unstructured":"L.F. Escudero, J. Salmeron, On a fix-and-relax framework for a class of project scheduling problems. Ann. Oper. Res. 88, 140\u2013163 (2005)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"2113_CR10","doi-asserted-by":"publisher","first-page":"928","DOI":"10.1016\/j.ejor.2007.04.043","volume":"191","author":"B Estellon","year":"2008","unstructured":"B. Estellon, F. Gardi, K. Nouioua, Two local search approaches for solving real-life car sequencing problems. Eur. J. Oper. Res. 191(3), 928\u2013944 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"2113_CR11","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1016\/j.ejor.2007.04.051","volume":"191","author":"H Gavranovi\u0107","year":"2008","unstructured":"H. Gavranovi\u0107, Local search and suffix tree for car-sequencing problem with colors. Eur. J. Oper. Res. 191(3), 972\u2013980 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"2113_CR12","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1108\/01443570010304242","volume":"20","author":"CA Geffen","year":"2000","unstructured":"C.A. Geffen, S. Rothenberg, Suppliers and environmental innovation the automotive paint process. Int. J. Oper. Prod. Manag. 20(2), 166\u2013186 (2000)","journal-title":"Int. J. Oper. Prod. Manag."},{"key":"2113_CR13","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-540-48085-3_36","volume-title":"Principles and Practice of Constraint Programming\u2014CP\u201999","author":"IP Gent","year":"1999","unstructured":"I.P. Gent, T. Walsh, CSPlib: a benchmark library for constraints, in Principles and Practice of Constraint Programming\u2014CP\u201999. ed. by J. Jaffar (Springer, Berlin, 1999), pp. 480\u2013481"},{"key":"2113_CR14","first-page":"66","volume":"100","author":"U Golle","year":"2011","unstructured":"U. Golle, Fitness landscape analysis and design of metaheuristics for car sequencing. Car Sequenc. Probl. Anal. Solut. Methods 100, 66 (2011)","journal-title":"Car Sequenc. Probl. Anal. Solut. Methods"},{"key":"2113_CR15","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10479-014-1733-0","volume":"226","author":"U Golle","year":"2015","unstructured":"U. Golle, F. Rothlauf, N. Boysen, Iterative beam search for car sequencing. Ann. Oper. Res. 226, 239\u2013254 (2015)","journal-title":"Ann. Oper. Res."},{"key":"2113_CR16","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/3-540-36605-9_23","volume-title":"Applications of Evolutionary Computing","author":"J Gottlieb","year":"2003","unstructured":"J. Gottlieb, M. Puchta, C. Solnon, A study of greedy, local search, and ant colony optimization approaches for car sequencing problems, in Applications of Evolutionary Computing. ed. by S. Cagnoni, C.G. Johnson, J.J.R. Cardalda, E. Marchiori, D.W. Corne, J.-A. Meyer, J. Gottlieb, M. Middendorf, A. Guillot, G.R. Raidl, E. Hart (Springer, Berlin, 2003), pp. 246\u2013257"},{"key":"2113_CR17","doi-asserted-by":"publisher","first-page":"1287","DOI":"10.1057\/palgrave.jors.2601955","volume":"56","author":"M Gravel","year":"2005","unstructured":"M. Gravel, C. Gagne, W.L. Price, Review and comparison of three methods for the solution of the car sequencing problem. J. Oper. Res. Soc. 56, 1287\u20131295 (2005)","journal-title":"J. Oper. Res. Soc."},{"issue":"4","key":"2113_CR18","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1287\/opre.51.4.566.16106","volume":"51","author":"NG Hall","year":"2003","unstructured":"N.G. Hall, C.N. Potts, Supply chain scheduling: batching and delivery. Oper. Res. 51(4), 566\u2013584 (2003)","journal-title":"Oper. Res."},{"issue":"2","key":"2113_CR19","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.ijpe.2009.08.022","volume":"123","author":"S Helber","year":"2010","unstructured":"S. Helber, F. Sahling, A fix-and-optimize approach for the multi-level capacitated lot sizing problem. Int. J. Prod. Econ. 123(2), 247\u2013256 (2010)","journal-title":"Int. J. Prod. Econ."},{"issue":"1","key":"2113_CR20","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0360-8352(94)90038-8","volume":"26","author":"KS Hindi","year":"1994","unstructured":"K.S. Hindi, G. Ploszajski, Formulation and solution of a selection and sequencing problem in car manufacture. Comput. Ind. Eng. 26(1), 203\u2013211 (1994)","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"2113_CR21","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1016\/j.ejor.2020.10.004","volume":"291","author":"A Hottenrott","year":"2021","unstructured":"A. Hottenrott, L. Waidner, M. Grunow, Robust car sequencing for automotive assembly. Eur. J. Oper. Res. 291(3), 983\u2013994 (2021)","journal-title":"Eur. J. Oper. Res."},{"key":"2113_CR22","doi-asserted-by":"publisher","first-page":"1816","DOI":"10.1016\/j.cor.2011.02.005","volume":"38","author":"RJW James","year":"2011","unstructured":"R.J.W. James, B. Almada-Lobo, Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics. Comput. Oper. Res. 38, 1816\u20131825 (2011)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"2113_CR23","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.cie.2007.12.014","volume":"55","author":"A Joly","year":"2008","unstructured":"A. Joly, Y. Frein, Heuristics for an industrial car sequencing problem considering paint and assembly shop objectives. Comput. Ind. Eng. 55(2), 295\u2013310 (2008)","journal-title":"Comput. Ind. Eng."},{"issue":"4","key":"2113_CR24","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.orl.2003.09.003","volume":"32","author":"T Kis","year":"2004","unstructured":"T. Kis, On the complexity of the car sequencing problem. Oper. Res. Lett. 32(4), 331\u2013335 (2004)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"2113_CR25","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10479-007-0290-1","volume":"161","author":"UV Manoj","year":"2008","unstructured":"U.V. Manoj, J.N.D. Gupta, S.K. Gupta, C. Sriskandarajah, Supply chain scheduling: just-in-time environment. Ann. Oper. Res. 161(1), 53\u201386 (2008)","journal-title":"Ann. Oper. Res."},{"key":"2113_CR26","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/j.cie.2016.12.010","volume":"104","author":"S Moons","year":"2017","unstructured":"S. Moons, K. Ramaekers, A. Caris, Y. Arda, Integrating production scheduling and vehicle routing decisions at the operational decision level: a review and discussion. Comput. Ind. Eng. 104, 224\u2013245 (2017)","journal-title":"Comput. Ind. Eng."},{"key":"2113_CR27","doi-asserted-by":"publisher","first-page":"106048","DOI":"10.1016\/j.cie.2019.106048","volume":"137","author":"I Moya","year":"2019","unstructured":"I. Moya, M. Chica, J. Bautista, Constructive metaheuristics for solving the car sequencing problem under uncertain partial demand. Comput. Ind. Eng. 137, 106048 (2019)","journal-title":"Comput. Ind. Eng."},{"key":"2113_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00246021","volume":"2","author":"BD Parrello","year":"1986","unstructured":"B.D. Parrello, W.C. Kabat, L. Wos, Job-shop scheduling using automated reasoning: a case study of the car-sequencing problem. J. Autom. Reason. 2, 1\u201342 (1986)","journal-title":"J. Autom. Reason."},{"key":"2113_CR29","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/978-3-540-30201-8_35","volume-title":"Principles and Practice of Constraint Programming\u2014CP 2004","author":"L Perron","year":"2004","unstructured":"L. Perron, P. Shaw, V. Furnon, Propagation guided large neighborhood search, in Principles and Practice of Constraint Programming\u2014CP 2004. ed. by M. Wallace (Springer, Berlin, 2004), pp. 468\u2013481"},{"key":"2113_CR30","volume-title":"Production Planning by Mixed Integer Programming","author":"Y Pochet","year":"2006","unstructured":"Y. Pochet, L.A. Wolsey, Production Planning by Mixed Integer Programming (Springer, Heidelberg, 2006)"},{"issue":"3","key":"2113_CR31","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1016\/j.ejor.2007.04.044","volume":"191","author":"M Prandtstetter","year":"2008","unstructured":"M. Prandtstetter, G.R. Raidl, An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem. Eur. J. Oper. Res. 191(3), 1004\u20131022 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"2113_CR32","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/3-540-46004-7_14","volume-title":"Applications of Evolutionary Computing","author":"M Puchta","year":"2002","unstructured":"M. Puchta, J. Gottlieb, Solving car sequencing problems by local optimization, in Applications of Evolutionary Computing. ed. by S. Cagnoni, J. Gottlieb, E. Hart, M. Middendorf, G.R. Raidl (Springer, Berlin, 2002), pp. 132\u2013142"},{"issue":"3","key":"2113_CR33","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1016\/j.ejor.2007.02.003","volume":"191","author":"CC Ribeiro","year":"2008","unstructured":"C.C. Ribeiro, D. Aloise, T.F. Noronha, C. Rocha, S. Urrutia, An efficient implementation of a VNS\/ILS heuristic for a real-life car sequencing problem. Eur. J. Oper. Res. 191(3), 596\u2013611 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"2113_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2020.102286","volume":"102","author":"NA Schmid","year":"2021","unstructured":"N.A. Schmid, V. Lim\u00e8re, B. Raa, Mixed model assembly line feeding with discrete location assignments and variable station space. Omega 102, 102286 (2021)","journal-title":"Omega"},{"key":"2113_CR35","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.engappai.2014.10.009","volume":"38","author":"M Siala","year":"2015","unstructured":"M. Siala, E. Hebrard, M.J. Huguet, A study of constraint programming heuristics for the car-sequencing problem. Eng. Appl. Artif. Intell. 38, 34\u201344 (2015)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"2113_CR36","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.ssci.2021.105561","volume":"146","author":"M Simonetto","year":"2022","unstructured":"M. Simonetto, S. Arena, M. Peron, A methodological framework to integrate motion capture system and virtual reality for assembly system 4.0 workplace design. Saf. Sci. 146, 105\u2013561 (2022)","journal-title":"Saf. Sci."},{"key":"2113_CR37","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1016\/j.ejor.2007.04.033","volume":"191","author":"C Solnon","year":"2008","unstructured":"C. Solnon, V.D. Cung, A. Nguyen, C. Artigues, The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF\u20192005 challenge problem. Eur. J. Oper. Res. 191, 912\u2013927 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"2113_CR38","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.omega.2017.11.006","volume":"78","author":"F Taube","year":"2018","unstructured":"F. Taube, S. Minner, Resequencing mixed-model assembly lines with restoration to customer orders. Omega 78, 99\u2013111 (2018)","journal-title":"Omega"},{"issue":"9","key":"2113_CR39","doi-asserted-by":"publisher","first-page":"2696","DOI":"10.1080\/00207543.2019.1630765","volume":"58","author":"D Thiruvady","year":"2020","unstructured":"D. Thiruvady, K. Morgan, A. Amir, A.T. Ernst, Large neighbourhood search based on mixed integer programming and ant colony optimisation for car sequencing. Int. J. Prod. Res. 58(9), 2696\u20132711 (2020)","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"2113_CR40","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.ejor.2012.11.049","volume":"227","author":"CA Ullrich","year":"2013","unstructured":"C.A. Ullrich, Integrated machine scheduling and vehicle routing with time windows. Eur. J. Oper. Res. 227(1), 152\u2013165 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"2113_CR41","first-page":"94","volume":"19","author":"D-Y Wang","year":"2015","unstructured":"D.-Y. Wang, O. Grunder, A. El Moudni, Integrated scheduling of production and distribution operations: a review. Int. J. Ind. Syst. Eng. 19, 94\u2013122 (2015)","journal-title":"Int. J. Ind. Syst. Eng."},{"key":"2113_CR42","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1162\/evco.1995.3.3.267","volume":"3","author":"T Warwick","year":"1995","unstructured":"T. Warwick, E.P. Tsang, Tackling car sequencing problems using a generic genetic algorithm. Evol. Comput. 3, 267\u2013298 (1995)","journal-title":"Evol. Comput."},{"key":"2113_CR43","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.omega.2016.04.004","volume":"67","author":"W Wei","year":"2017","unstructured":"W. Wei, L. Guimar\u00e3es, P. Amorim, B. Almada-Lobo, Tactical production and distribution planning with dependency issues on the production process. Omega 67, 99\u2013114 (2017)","journal-title":"Omega"},{"key":"2113_CR44","unstructured":"N. Zufferey, M. Studer, E.A. Silver, Tabu search for a car sequencing problem, in Proceedings of the 19th International Florida Artificial Intelligence Research Society Conference (2006). pp. 457\u2013462"}],"updated-by":[{"DOI":"10.1186\/s13638-022-02194-4","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2022,11,17]],"date-time":"2022-11-17T00:00:00Z","timestamp":1668643200000}}],"container-title":["EURASIP Journal on Wireless Communications and Networking"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-022-02113-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13638-022-02113-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-022-02113-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,19]],"date-time":"2022-11-19T08:21:52Z","timestamp":1668846112000},"score":1,"resource":{"primary":{"URL":"https:\/\/jwcn-eurasipjournals.springeropen.com\/articles\/10.1186\/s13638-022-02113-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,28]]},"references-count":44,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2022,12]]}},"alternative-id":["2113"],"URL":"https:\/\/doi.org\/10.1186\/s13638-022-02113-7","relation":{"correction":[{"id-type":"doi","id":"10.1186\/s13638-022-02194-4","asserted-by":"object"}]},"ISSN":["1687-1499"],"issn-type":[{"value":"1687-1499","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,28]]},"assertion":[{"value":"2 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 March 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 2022","order":4,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1186\/s13638-022-02194-4","URL":"https:\/\/doi.org\/10.1186\/s13638-022-02194-4","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"26"}}