{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:35:16Z","timestamp":1758274516765,"version":"3.37.3"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,9,19]],"date-time":"2022-09-19T00:00:00Z","timestamp":1663545600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,19]],"date-time":"2022-09-19T00:00:00Z","timestamp":1663545600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"National Natural Science Foundation of China under Project Code","award":["61803301","61773314","62176146"],"award-info":[{"award-number":["61803301","61773314","62176146"]}]},{"name":"Natural Science Basic Research Program of Shaanxi","award":["2020JM-709"],"award-info":[{"award-number":["2020JM-709"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1007\/s10586-022-03736-7","type":"journal-article","created":{"date-parts":[[2022,9,19]],"date-time":"2022-09-19T13:02:36Z","timestamp":1663592556000},"page":"3319-3339","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A multiobjective decomposition evolutionary algorithm with optimal history-based neighborhood adaptation and a dual-indicator selection strategy"],"prefix":"10.1007","volume":"26","author":[{"given":"Wei","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2936-2924","authenticated-orcid":false,"given":"Junqing","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiaoyong","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qingzheng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,19]]},"reference":[{"key":"3736_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2021.100847","volume":"62","author":"F Han","year":"2021","unstructured":"Han, F., Chen, W., Ling, Q., Han, H.: Multi-objective particle swarm optimization with adaptive strategies for feature selection. Swarm Evol. Comput. 62, 1\u201315 (2021)","journal-title":"Swarm Evol. Comput."},{"key":"3736_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.knosys.2021.107378","volume":"230","author":"Y Niu","year":"2021","unstructured":"Niu, Y., Kong, D., Wen, R., Cao, Z., Xiao, J.: An improved learnable evolution model for solving multi-objective vehicle routing problem with stochastic demand. Knowl.-Based Syst. 230, 1\u201319 (2021)","journal-title":"Knowl.-Based Syst."},{"key":"3736_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.asoc.2021.107772","volume":"112","author":"S Jain","year":"2021","unstructured":"Jain, S., Ramesh, D., Bhattacharya, D.: A multi-objective algorithm for crop pattern optimization in agriculture. Appl. Soft Comput. 112, 1\u201313 (2021)","journal-title":"Appl. Soft Comput."},{"key":"3736_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.eswa.2021.115338","volume":"183","author":"MA Abido","year":"2021","unstructured":"Abido, M.A., Elazouni, A.: Modified multi-objective evolutionary programming algorithm for solving project scheduling problems. Expert Syst. Appl. 183, 1\u201310 (2021)","journal-title":"Expert Syst. Appl."},{"key":"3736_CR5","unstructured":"Kalyanmoy, D.: Multi-objective optimization using evolutionary algorithms. West Sussex, England(2001)"},{"issue":"3","key":"3736_CR6","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1162\/evco.1999.7.3.205","volume":"7","author":"K Deb","year":"1999","unstructured":"Deb, K.: Multi-objective genetic algorithms: Problem difficulties and construction of test problems. Evol. Comput. 7(3), 205\u2013230 (1999)","journal-title":"Evol. Comput."},{"issue":"1","key":"3736_CR7","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/TCYB.2015.2507366","volume":"47","author":"H Li","year":"2017","unstructured":"Li, H., Zhang, Q., Deng, J.: Biased Multi-objective Optimization and Decomposition Algorithm. IEEE Transactions on Cybernetics. 47(1), 52\u201366 (2017)","journal-title":"IEEE Transactions on Cybernetics."},{"key":"3736_CR8","doi-asserted-by":"publisher","first-page":"1995","DOI":"10.1007\/s00521-015-1923-y","volume":"31","author":"G Wang","year":"2019","unstructured":"Wang, G., Deb, S., Cui, Z.: Monarch butterfly optimization. Neural Comput & Applic. 31, 1995\u20132014 (2019)","journal-title":"Neural Comput & Applic."},{"key":"3736_CR9","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, A., Mirjalili, S.: Slime mould algorithm: A new method for stochastic optimization. Futur. Gener. Comput. Syst. 111, 300\u2013323 (2020)","journal-title":"Futur. Gener. Comput. Syst."},{"key":"3736_CR10","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s12293-016-0212-3","volume":"10","author":"G Wang","year":"2016","unstructured":"Wang, G.: Moth search algorithm: a bio-inspired metaheuristic algorithm for global optimization problems. Memetic Computing 10, 151\u2013164 (2016)","journal-title":"Memetic Computing"},{"key":"3736_CR11","first-page":"12","volume":"177","author":"Y Yang","year":"2021","unstructured":"Yang, Y., Chen, H., Heidari, A., Gandomi, A.H.: Hunger Games Search: visions, conception, implementation, deep analysis, perspectives, and towards performance shifts. Expert Syst. Applications. 177, 12 (2021)","journal-title":"Expert Syst. Applications."},{"key":"3736_CR12","first-page":"1150","volume":"181","author":"I Ahmadianfar","year":"2021","unstructured":"Ahmadianfar, I., Heidari, A., Gandomi, A.H., Chu, X., Chen, H.: RUN beyond the metaphor: An efficient optimization algorithm based on Runge Kutta method. Expert Syst. Applications. 181, 1150 (2021)","journal-title":"Expert Syst. Applications."},{"issue":"3","key":"3736_CR13","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1007\/s42235-021-0050-y","volume":"18","author":"J Tu","year":"2021","unstructured":"Tu, J., Chen, H., Wang, M., Gandomi, A.H.: The Colony Predation Algorithm. J. Bionic Eng. 18(3), 674\u2013710 (2021)","journal-title":"J. Bionic Eng."},{"key":"3736_CR14","doi-asserted-by":"publisher","first-page":"116516","DOI":"10.1016\/j.eswa.2022.116516","volume":"195","author":"I Ahmadianfar","year":"2022","unstructured":"Ahmadianfar, I., Heidari, A., Noshadian, S., Chen, H., Gandomi, A.H.: INFO: An efficient optimization algorithm based on weighted mean of vectors. Expert Syst. Applications. 195, 116516 (2022)","journal-title":"Expert Syst. Applications."},{"key":"3736_CR15","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1016\/j.future.2019.02.028","volume":"97","author":"A Heidari","year":"2019","unstructured":"Heidari, A., Mirjalili, S., Faris, H., Aljarah, I., Mafarja, M., Chen, H.: Harris hawks optimization: Algorithm and applications. Futur. Gener. Comput. Syst. 97, 849\u2013872 (2019)","journal-title":"Futur. Gener. Comput. Syst."},{"key":"3736_CR16","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.ins.2013.08.049","volume":"258","author":"R Wang","year":"2014","unstructured":"Wang, R., Fleming, P.J., Purshouse, R.C.: General framework for localised multi-objective evolutionary algorithms. Inf. Sci. 258, 29\u201353 (2014)","journal-title":"Inf. Sci."},{"issue":"2","key":"3736_CR17","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"3736_CR18","unstructured":"Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: improving the strength Pareto evolutionary algorithm for multi-objective optimization. in: Proceedings of the Evolutionary Methods for Design, Optimisation, and Control, Barcelona, CIMNE, Spain. 95\u2013100(2002)"},{"key":"3736_CR19","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1016\/j.ins.2021.09.052","volume":"581","author":"A Hashemi","year":"2021","unstructured":"Hashemi, A., Dowlatshahi, M.B., Nezamabadi-pour, H.: An efficient Pareto-based feature selection algorithm for multi-label classification. Inf. Sci. 581, 428\u2013447 (2021)","journal-title":"Inf. Sci."},{"key":"3736_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jclepro.2020.122927","volume":"276","author":"EB Tirkolaee","year":"2020","unstructured":"Tirkolaee, E.B., Goli, A., Faridnia, A., Soltani, M., Weber, G.: Multi-objective optimization for the reliable pollution-routing problem with cross-dock selection using Pareto-based algorithms. J. Clean. Prod. 276, 1\u201323 (2020)","journal-title":"J. Clean. Prod."},{"key":"3736_CR21","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.swevo.2019.06.001","volume":"49","author":"R Tanabe","year":"2019","unstructured":"Tanabe, R., Ishibuchi, H.: A niching indicator-based multi-modal many-objective optimizer. Swarm Evol. Comput. 49, 134\u2013146 (2019)","journal-title":"Swarm Evol. Comput."},{"key":"3736_CR22","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1016\/j.swevo.2018.05.004","volume":"44","author":"S Zapotecas-Mart\u00ednez","year":"2019","unstructured":"Zapotecas-Mart\u00ednez, S., L\u00f3pez-Jaimes, A., Garc\u00eda-N\u00e1jera, A.: LIBEA: a lebesgue indicator-based evolutionary algorithm for multi-objective optimization. Swarm Evol. Comput. 44, 404\u2013419 (2019)","journal-title":"Swarm Evol. Comput."},{"key":"3736_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2021.100983","volume":"67","author":"JLL Garc\u00eda","year":"2021","unstructured":"Garc\u00eda, J.L.L., Monroy, R., Hern\u00e1ndez, V.A.S., Coello, C.A.C.: COARSE-EMOA: An indicator-based evolutionary algorithm for solving equality constrained multi-objective optimization problems. Swarm Evol. Comput. 67, 1\u201315 (2021)","journal-title":"Swarm Evol. Comput."},{"issue":"4","key":"3736_CR24","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1109\/TEVC.2021.3061545","volume":"25","author":"JG Falc\u00f3n-Cardona","year":"2021","unstructured":"Falc\u00f3n-Cardona, J.G., Ishibuchi, H., Coello Coello, C.A., Emmerich, M.: on the effect of the cooperation of indicator-based multiobjective evolutionary algorithms. IEEE Trans. Evol. Comput. 25(4), 681\u2013695 (2021)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"3736_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30217-9_84","volume-title":"Indicator-based selection in multiobjective search","author":"E Zitzler","year":"2004","unstructured":"Zitzler, E., K\u00fcnzli, S.: Indicator-based selection in multiobjective search. Springer, Heidelberg, Germany (2004)"},{"issue":"6","key":"3736_CR26","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang, Q., Li, H.: MOEA\/D: A multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712\u2013731 (2007)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"6","key":"3736_CR27","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1109\/TEVC.2016.2521175","volume":"20","author":"R Wang","year":"2016","unstructured":"Wang, R., Zhang, Q., Zhang, T.: Decomposition-based algorithms using pareto adaptive scalarizing methods. IEEE Trans. Evol. Comput. 20(6), 821\u2013837 (2016)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"3736_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.knosys.2021.107099","volume":"225","author":"L Zhu","year":"2021","unstructured":"Zhu, L., Lin, J., Li, Y., Wang, Z.: A decomposition-based multi-objective genetic programming hyper-heuristic approach for the multi-skill resource constrained project scheduling problem. Knowl.-Based Syst. 225, 1\u201318 (2021)","journal-title":"Knowl.-Based Syst."},{"key":"3736_CR29","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1016\/j.neucom.2020.08.080","volume":"452","author":"F Zou","year":"2021","unstructured":"Zou, F., Chen, D., Xu, Q., Jiang, Z., Kang, J.: two-stage personalized recommendation based on multi-objective teaching\u2013learning-based optimization with decomposition. Neurocomputing 452, 716\u2013727 (2021)","journal-title":"Neurocomputing"},{"key":"3736_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2021.100842","volume":"62","author":"M Pal","year":"2021","unstructured":"Pal, M., Bandyopadhyay, S.: Decomposition in decision and objective space for multi-modal multi-objective optimization. Swarm Evol. Comput. 62, 1\u201315 (2021)","journal-title":"Swarm Evol. Comput."},{"key":"3736_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2020.100825","volume":"61","author":"X Zhou","year":"2021","unstructured":"Zhou, X., Wang, X., Gu, X.: A decomposition-based multiobjective evolutionary algorithm with weight vector adaptation. Swarm Evol. Comput. 61, 1\u201317 (2021)","journal-title":"Swarm Evol. Comput."},{"issue":"1","key":"3736_CR32","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1109\/TCYB.2016.2641986","volume":"48","author":"A Zhang","year":"2018","unstructured":"Zhang, A., Sun, G., Ren, J., Li, X., Wang, Z., Jia, X.: A dynamic neighborhood learning-based gravitational search algorithm. IEEE Transactions on Cybernetics. 48(1), 436\u2013447 (2018)","journal-title":"IEEE Transactions on Cybernetics."},{"key":"3736_CR33","doi-asserted-by":"crossref","unstructured":"Deb, K., Thiele, L., Laumanns, M., Zitzler, E (2002) Scalable Multi-Objective Optimization Test Problems. Proceedings of the 2002 Congress on Evolutionary Computation. 1, 825\u2013830","DOI":"10.1109\/CEC.2002.1007032"},{"issue":"5","key":"3736_CR34","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1109\/TEVC.2005.861417","volume":"10","author":"S Huband","year":"2006","unstructured":"Huband, S., Hingston, P., Barone, L., While, L.: A review of multiobjective test problems and a scalable test problem toolkit. IEEE Trans. Evol. Comput. 10(5), 477\u2013506 (2006)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"5","key":"3736_CR35","first-page":"477","volume":"10","author":"I Das","year":"1998","unstructured":"Das, I., Dennis, J.: Normal-boundary intersection: A new method for generating the pareto surface in nonlinear multicriteria optimization problems. SIAM Journal Optimization. 10(5), 477\u2013506 (1998)","journal-title":"SIAM Journal Optimization."},{"key":"3736_CR36","doi-asserted-by":"crossref","unstructured":"Wu, M., Kwong, S., Jia, Y ., Li, K., Zhang, Q.(2017) Adaptive weights generation for decomposition-based multi-objective optimization using gaussian process regression. Proceedings of the 2017 Genetic and Evolutionary Computation Conference. Berlin, German","DOI":"10.1145\/3071178.3071339"},{"key":"3736_CR37","doi-asserted-by":"crossref","unstructured":"Biswas, P. P., Suganthan, P. N.: Large Initial Population and Neighborhood Search incorporated in LSHADE to solve CEC2020 Benchmark Problems. 2020 IEEE Congress on Evolutionary Computation (CEC). Glasgow, UK (2020)","DOI":"10.1109\/CEC48606.2020.9185547"},{"key":"3736_CR38","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1016\/j.asoc.2018.06.023","volume":"70","author":"P Wang","year":"2018","unstructured":"Wang, P., Liao, B., Zhu, W., Cai, L., Ren, S., Chen, M., Li, Z., Li, K.: Adaptive region adjustment to improve the balance of convergence and diversity in MOEA\/D. Appl. Soft Comput. 70, 797\u2013813 (2018)","journal-title":"Appl. Soft Comput."},{"issue":"2","key":"3736_CR39","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1162\/EVCO_a_00109","volume":"22","author":"Y Qi","year":"2014","unstructured":"Qi, Y., Ma, X., Liu, F., Jiao, L., Sun, J., Wu, J.: MOEA\/D with adaptive weight adjustment. Evol. Comput. 22(2), 231\u2013264 (2014)","journal-title":"Evol. Comput."},{"issue":"3","key":"3736_CR40","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1109\/TEVC.2018.2865590","volume":"23","author":"X He","year":"2019","unstructured":"He, X., Zhou, Y., Chen, Z., Zhang, Q.: Evolutionary many-objective optimization based on dynamical decomposition. IEEE Trans. Evol. Comput. 23(3), 361\u2013375 (2019)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"3736_CR41","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/TEVC.2008.925798","volume":"13","author":"H Li","year":"2009","unstructured":"Li, H., Zhang, Q.: Multiobjective optimization problems with complicated pareto sets, MOEA\/D and NSGA-II. IEEE Trans. Evol. Comput. 13(2), 284\u2013302 (2009)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"3736_CR42","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1109\/TEVC.2013.2281533","volume":"18","author":"H Liu","year":"2014","unstructured":"Liu, H., Gu, F., Zhang, Q.: Decomposition of a multiobjective optimization problem into a number of simple multiobjective subproblems. IEEE Trans. Evol. Comput. 18(3), 450\u2013455 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"3736_CR43","doi-asserted-by":"crossref","unstructured":"Farias, L. R. C., Araujol, A. F. R.: Many-Objective Evolutionary Algorithm Based On Decomposition With Random And Adaptive Weights. 2019 IEEE International Conference on Systems, Man and Cybernetics (SMC). Bari, Italy, 3746\u20133751(2019)","DOI":"10.1109\/SMC.2019.8914005"},{"key":"3736_CR44","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.asoc.2018.10.028","volume":"74","author":"J Qiao","year":"2019","unstructured":"Qiao, J., Zhou, H., Yang, C., Yang, S.: A decomposition-based multiobjective evolutionary algorithm with angle-based adaptive penalty. Appl. Soft Comput. 74, 190\u2013205 (2019)","journal-title":"Appl. Soft Comput."},{"issue":"5","key":"3736_CR45","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1109\/TEVC.2014.2373386","volume":"19","author":"K Li","year":"2015","unstructured":"Li, K., Deb, K., Zhang, Q., Kwong, S.: An evolutionary many-objective optimization algorithm based on dominance and decomposition. IEEE Trans. Evol. Comput. 19(5), 694\u2013716 (2015)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"26","key":"3736_CR46","first-page":"194","volume":"6","author":"K Li","year":"2018","unstructured":"Li, K., Wang, R., Zhang, T., Ishibuchi, H.: Evolutionary many-objective optimization: a comparative study of the state-of-the-art. IEEE Access. 6(26), 194\u2013214 (2018)","journal-title":"IEEE Access."},{"issue":"105731","key":"3736_CR47","first-page":"1","volume":"84","author":"S Jiang","year":"2019","unstructured":"Jiang, S., He, X., Zhou, Y.: Many-objective evolutionary algorithm based on adaptive weighted decomposition. Appl. Soft Comput. 84(105731), 1\u201311 (2019)","journal-title":"Appl. Soft Comput."}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-022-03736-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10586-022-03736-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-022-03736-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,26]],"date-time":"2023-08-26T21:02:39Z","timestamp":1693083759000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10586-022-03736-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,19]]},"references-count":47,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["3736"],"URL":"https:\/\/doi.org\/10.1007\/s10586-022-03736-7","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"type":"print","value":"1386-7857"},{"type":"electronic","value":"1573-7543"}],"subject":[],"published":{"date-parts":[[2022,9,19]]},"assertion":[{"value":"9 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 August 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 September 2022","order":4,"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. The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}