{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T19:48:44Z","timestamp":1775850524240,"version":"3.50.1"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Fundamental Research Funds for Central Universities-Civil Aviation University of China special funds","award":["2000530441"],"award-info":[{"award-number":["2000530441"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2023,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Increasing evaluation indexes have been involved in the network modeling, and some parameters cannot be described precisely. Fuzzy set theory becomes a promising mathematical method to characterize such uncertain parameters. This study investigates the fuzzy multi-objective path optimization problem (FMOPOP), in which each arc has multiple crisp and fuzzy weights simultaneously. Fuzzy weights are characterized by triangular fuzzy numbers or trapezoidal fuzzy numbers. We adopt two fuzzy number ranking methods based on their fuzzy graded mean values and distances from the fuzzy minimum number. Motivated by the ripple spreading patterns on the natural water surface, we propose a novel ripple-spreading algorithm (RSA) to solve the FMOPOP. Theoretical analyses prove that the RSA can find all Pareto optimal paths from the source node to all other nodes within a single run. Numerical examples and comparative experiments demonstrate the efficiency and robustness of the newly proposed RSA. Moreover, in the first numerical example, the processes of the RSA are illustrated using metaphor-based language and ripple spreading phenomena to be more comprehensible. To the best of our knowledge, the RSA is the first algorithm for the FMOPOP that can adopt various fuzzy numbers and ranking methods while maintaining optimality.<\/jats:p>","DOI":"10.1007\/s40747-022-00825-3","type":"journal-article","created":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T09:07:50Z","timestamp":1659344870000},"page":"753-765","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A deterministic and nature-inspired algorithm for the fuzzy multi-objective path optimization problem"],"prefix":"10.1007","volume":"9","author":[{"given":"Yi-Ming","family":"Ma","sequence":"first","affiliation":[]},{"given":"Xiao-Bing","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Hang","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,1]]},"reference":[{"issue":"11","key":"825_CR1","doi-asserted-by":"crossref","first-page":"3324","DOI":"10.1016\/j.cor.2005.03.027","volume":"33","author":"L Fu","year":"2006","unstructured":"Fu L, Sun D, Rilett LR (2006) Heuristic shortest path algorithms for transportation applications: state of the art. Comput Oper Res 33(11):3324\u20133343","journal-title":"Comput Oper Res"},{"key":"825_CR2","doi-asserted-by":"crossref","DOI":"10.1016\/j.rser.2019.109658","volume":"120","author":"L Nunes","year":"2020","unstructured":"Nunes L, Causer T, Ciolkosz D (2020) Biomass for energy: a review on supply chain management models. Renew Sustain Energy Rev 120:109658","journal-title":"Renew Sustain Energy Rev"},{"issue":"1","key":"825_CR3","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1109\/TNSM.2020.3044329","volume":"18","author":"M Sasabe","year":"2020","unstructured":"Sasabe M, Hara T (2020) Capacitated shortest path tour problem-based integer linear programming for service chaining and function placement in NFV networks. IEEE Trans Netwk Service Manag 18(1):104\u2013117","journal-title":"IEEE Trans Netwk Service Manag"},{"issue":"4","key":"825_CR4","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1016\/j.dt.2019.04.011","volume":"15","author":"B Patle","year":"2019","unstructured":"Patle B, Pandey A, Parhi D, Jagadeesh A (2019) A review: On path planning strategies for navigation of mobile robot. Defence Technol 15(4):582\u2013606","journal-title":"Defence Technol"},{"issue":"1","key":"825_CR5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numerische Mathematik 1(1):269\u2013271","journal-title":"Numerische Mathematik"},{"issue":"6","key":"825_CR6","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"RW Floyd","year":"1962","unstructured":"Floyd RW (1962) Algorithm 97: shortest path. Commun ACM 5(6):345","journal-title":"Commun ACM"},{"issue":"1","key":"825_CR7","doi-asserted-by":"crossref","first-page":"1502242","DOI":"10.1080\/23311916.2018.1502242","volume":"5","author":"N Gunantara","year":"2018","unstructured":"Gunantara N (2018) A review of multi-objective optimization: methods and its applications. Cogent Eng 5(1):1502242","journal-title":"Cogent Eng"},{"key":"825_CR8","doi-asserted-by":"crossref","unstructured":"Zhang T, Sun L, Yao L, Rong J (2017) Impact analysis of land use on traffic congestion using real-time traffic and POI. Journal of Advanced Transportation 2017","DOI":"10.1155\/2017\/7164790"},{"key":"825_CR9","doi-asserted-by":"crossref","unstructured":"Zadeh LA (1996) Fuzzy sets. Fuzzy Sets. Fuzzy Logic, and Fuzzy Systems: Selected Papers by Lotfi A Zadeh. World Scientific, USA, pp 394\u2013432","DOI":"10.1142\/9789814261302_0021"},{"key":"825_CR10","volume-title":"Fuzzy Set Theory-and Its Applications","author":"H-J Zimmermann","year":"2011","unstructured":"Zimmermann H-J (2011) Fuzzy Set Theory-and Its Applications. Springer, New York"},{"issue":"8","key":"825_CR11","doi-asserted-by":"crossref","first-page":"9854","DOI":"10.1016\/j.eswa.2011.02.017","volume":"38","author":"Y Deng","year":"2011","unstructured":"Deng Y, Chan FT (2011) A new fuzzy dempster MCDM method and its application in supplier selection. Expert Syst Appl 38(8):9854\u20139861","journal-title":"Expert Syst Appl"},{"issue":"1","key":"825_CR12","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1016\/j.eswa.2010.07.004","volume":"38","author":"Y Deng","year":"2011","unstructured":"Deng Y, Jiang W, Sadiq R (2011) Modeling contaminant intrusion in water distribution networks: a new similarity-based DST method. Expert Syst Appl 38(1):571\u2013578","journal-title":"Expert Syst Appl"},{"issue":"8","key":"825_CR13","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1016\/j.patrec.2004.01.019","volume":"25","author":"D Yong","year":"2004","unstructured":"Yong D, Wenkang S, Feng D, Qi L (2004) A new similarity measure of generalized fuzzy numbers and its application to pattern recognition. Pattern Recognit Lett 25(8):875\u2013883","journal-title":"Pattern Recognit Lett"},{"key":"825_CR14","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.jhazmat.2019.02.101","volume":"375","author":"L Zero","year":"2019","unstructured":"Zero L, Bersani C, Paolucci M, Sacile R (2019) Two new approaches for the bi-objective shortest path with a fuzzy objective applied to HAZMAT transportation. J Hazardous Materials 375:96\u2013106","journal-title":"J Hazardous Materials"},{"key":"825_CR15","unstructured":"Sawaragi Y, NAKAYAMA H, TANINO T (1985) Theory of Multiobjective Optimization. Elsevier, USA"},{"issue":"6","key":"825_CR16","doi-asserted-by":"crossref","first-page":"1084","DOI":"10.2514\/2.1071","volume":"38","author":"A Messac","year":"2000","unstructured":"Messac A, Sundararaj GJ, Tappeta RV, Renaud JE (2000) Ability of objective functions to generate points on nonconvex Pareto frontiers. AIAA J 38(6):1084\u20131091","journal-title":"AIAA J"},{"issue":"2","key":"825_CR17","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/s00158-002-0276-1","volume":"25","author":"A Messac","year":"2003","unstructured":"Messac A, Ismail-Yahaya A, Mattson CA (2003) The normalized normal constraint method for generating the Pareto frontier. Struct Multidisciplinary Opt 25(2):86\u201398","journal-title":"Struct Multidisciplinary Opt"},{"issue":"2","key":"825_CR18","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"issue":"6","key":"825_CR19","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang Q, Li H (2007) MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712\u2013731","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"825_CR20","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF01197559","volume":"14","author":"I Das","year":"1997","unstructured":"Das I, Dennis JE (1997) A closer look at drawbacks of minimizing weighted sums of objectives for Pareto set generation in multicriteria optimization problems. Struct Opt 14(1):63\u201369","journal-title":"Struct Opt"},{"issue":"16","key":"825_CR21","doi-asserted-by":"crossref","first-page":"12363","DOI":"10.1007\/s00521-020-04832-8","volume":"32","author":"A Slowik","year":"2020","unstructured":"Slowik A, Kwasnicka H (2020) Evolutionary algorithms and their applications to engineering problems. Neural Comput Appl 32(16):12363\u201312379","journal-title":"Neural Comput Appl"},{"issue":"2","key":"825_CR22","first-page":"149","volume":"20","author":"EL Ulungu","year":"1995","unstructured":"Ulungu EL, Teghem J (1995) The two phases method: an efficient procedure to solve bi-objective combinatorial optimization problems. Found Comput Decision Sci 20(2):149\u2013165","journal-title":"Found Comput Decision Sci"},{"issue":"3","key":"825_CR23","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1023\/A:1012602011914","volume":"111","author":"F Guerriero","year":"2001","unstructured":"Guerriero F, Musmanno R (2001) Label correcting methods to solve multicriteria shortest path problems. J Opt Theory Appl 111(3):589\u2013613","journal-title":"J Opt Theory Appl"},{"issue":"3","key":"825_CR24","doi-asserted-by":"crossref","first-page":"1088","DOI":"10.1109\/TSMCB.2012.2223756","volume":"43","author":"X-B Hu","year":"2013","unstructured":"Hu X-B, Wang M, Di Paolo E (2013) Calculating complete and exact Pareto front for multiobjective optimization: a new deterministic approach for discrete problems. IEEE Trans Cybernet 43(3):1088\u20131101","journal-title":"IEEE Trans Cybernet"},{"key":"825_CR25","volume-title":"Fuzzy sets and systems: theory and applications","author":"DJ Dubois","year":"1980","unstructured":"Dubois DJ (1980) Fuzzy sets and systems: theory and applications, vol 144. Academic press, USA"},{"issue":"4","key":"825_CR26","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s40747-019-0098-z","volume":"5","author":"S Broumi","year":"2019","unstructured":"Broumi S, Talea M, Bakali A, Smarandache F, Nagarajan D, Lathamaheswari M, Parimala M (2019) Shortest path problem in fuzzy, intuitionistic fuzzy and neutrosophic environment: an overview. Complex Intell Syst 5(4):371\u2013378","journal-title":"Complex Intell Syst"},{"issue":"2","key":"825_CR27","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/j.asoc.2008.07.002","volume":"9","author":"I Mahdavi","year":"2009","unstructured":"Mahdavi I, Nourifar R, Heidarzade A, Amiri NM (2009) A dynamic programming approach for finding shortest chains in a fuzzy network. Applied Soft Computing 9(2):503\u2013511","journal-title":"Applied Soft Computing"},{"issue":"3","key":"825_CR28","doi-asserted-by":"crossref","first-page":"1231","DOI":"10.1016\/j.asoc.2011.11.011","volume":"12","author":"Y Deng","year":"2012","unstructured":"Deng Y, Chen Y, Zhang Y, Mahadevan S (2012) Fuzzy Dijkstra algorithm for shortest path problem under uncertain environment. Appl Soft Comput 12(3):1231\u20131237","journal-title":"Appl Soft Comput"},{"issue":"5","key":"825_CR29","doi-asserted-by":"crossref","first-page":"2356","DOI":"10.1016\/j.asoc.2012.12.035","volume":"13","author":"Y Zhang","year":"2013","unstructured":"Zhang Y, Zhang Z, Deng Y, Mahadevan S (2013) A biologically inspired solution for fuzzy shortest path problems. Appl Soft Comput 13(5):2356\u20132363","journal-title":"Appl Soft Comput"},{"issue":"1","key":"825_CR30","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s40747-020-00195-8","volume":"7","author":"L Lin","year":"2021","unstructured":"Lin L, Wu C, Ma L (2021) A genetic algorithm for the fuzzy shortest path problem in a fuzzy network. Complex Intell Syst 7(1):225\u2013234","journal-title":"Complex Intell Syst"},{"key":"825_CR31","doi-asserted-by":"crossref","unstructured":"Kim Y-H, Kim J-H (2009) Multiobjective quantum-inspired evolutionary algorithm for fuzzy path planning of mobile robot. In: 2009 IEEE Congress on Evolutionary Computation, pp. 1185\u20131192 . IEEE","DOI":"10.1109\/CEC.2009.4983080"},{"issue":"1","key":"825_CR32","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S1000-9361(11)60361-0","volume":"25","author":"W Yanyang","year":"2012","unstructured":"Yanyang W, Tietao W, Xiangju Q (2012) Study of multi-objective fuzzy optimization for path planning. Chin J Aeronaut 25(1):51\u201356","journal-title":"Chin J Aeronaut"},{"key":"825_CR33","doi-asserted-by":"crossref","unstructured":"Adhikari D, Kim E, Reza H (2017) A fuzzy adaptive differential evolution for multi-objective 3D UAV path optimization. In: 2017 IEEE Congress on Evolutionary Computation (CEC), pp. 2258\u20132265 . IEEE","DOI":"10.1109\/CEC.2017.7969578"},{"issue":"4","key":"825_CR34","doi-asserted-by":"crossref","first-page":"4711","DOI":"10.3233\/JIFS-191413","volume":"38","author":"A Abbaszadeh Sori","year":"2020","unstructured":"Abbaszadeh Sori A, Ebrahimnejad A, Motameni H (2020) The fuzzy inference approach to solve multi-objective constrained shortest path problem. J Intell Fuzzy Syst 38(4):4711\u20134720","journal-title":"J Intell Fuzzy Syst"},{"issue":"2","key":"825_CR35","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1007\/s40747-020-00234-4","volume":"7","author":"M Bagheri","year":"2021","unstructured":"Bagheri M, Ebrahimnejad A, Razavyan S, Lotfi FH, Malekmohammadi N (2021) Solving fuzzy multi-objective shortest path problem based on data envelopment analysis approach. Complex Intell Syst 7(2):725\u2013740","journal-title":"Complex Intell Syst"},{"issue":"2","key":"825_CR36","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1162\/EVCO_a_00156","volume":"24","author":"X-B Hu","year":"2016","unstructured":"Hu X-B, Wang M, Leeson MS, Di Paolo EA, Liu H (2016) Deterministic agent-based path optimization by mimicking the spreading of ripples. Evol Comput 24(2):319\u2013346","journal-title":"Evol Comput"},{"key":"825_CR37","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/j.trb.2017.06.007","volume":"106","author":"X-B Hu","year":"2017","unstructured":"Hu X-B, Zhang M-K, Zhang Q, Liao J-Q (2017) Co-evolutionary path optimization by ripple-spreading algorithm. Trans Res Part B 106:411\u2013432","journal-title":"Trans Res Part B"},{"key":"825_CR38","volume":"87","author":"X-B Hu","year":"2020","unstructured":"Hu X-B, Zhang C, Zhang G-P, Zhang M-K, Li H, Leeson MS, Liao J-Q (2020) Finding the k shortest paths by ripple-spreading algorithms. Eng Appl Artificial Intell 87:103229","journal-title":"Eng Appl Artificial Intell"},{"key":"825_CR39","doi-asserted-by":"crossref","unstructured":"Hu X-B, Gu S-H, Zhang C, Zhang G-P, Zhang M-K, Leeson MS (2021) Finding all Pareto optimal paths by simulating ripple relay race in multi-objective networks. Swarm and Evolutionary Computation, 100908","DOI":"10.1016\/j.swevo.2021.100908"},{"issue":"5","key":"825_CR40","doi-asserted-by":"crossref","first-page":"6020","DOI":"10.1016\/j.eswa.2011.12.015","volume":"39","author":"M Barbati","year":"2012","unstructured":"Barbati M, Bruno G, Genovese A (2012) Applications of agent-based models for optimization problems: a literature review. Expert Syst Appl 39(5):6020\u20136028","journal-title":"Expert Syst Appl"},{"issue":"10\u201311","key":"825_CR41","doi-asserted-by":"crossref","first-page":"1601","DOI":"10.1016\/S0898-1221(03)00139-1","volume":"45","author":"C-C Chou","year":"2003","unstructured":"Chou C-C (2003) The canonical representation of multiplication operation on triangular fuzzy numbers. Comput Math Appl 45(10\u201311):1601\u20131610","journal-title":"Comput Math Appl"},{"issue":"1","key":"825_CR42","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/s10479-006-7390-1","volume":"143","author":"K Ganesan","year":"2006","unstructured":"Ganesan K, Veeramani P (2006) Fuzzy linear programs with trapezoidal fuzzy numbers. Ann Oper Res 143(1):305\u2013315","journal-title":"Ann Oper Res"},{"issue":"1\u20132","key":"825_CR43","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.mcm.2011.03.040","volume":"57","author":"R Hassanzadeh","year":"2013","unstructured":"Hassanzadeh R, Mahdavi I, Mahdavi-Amiri N, Tajdin A (2013) A genetic algorithm for solving fuzzy shortest path problems with mixed fuzzy arc lengths. Math Comput Modell 57(1\u20132):84\u201399","journal-title":"Math Comput Modell"},{"key":"825_CR44","first-page":"97","volume":"1","author":"B Sadeghpour Gildeh","year":"2001","unstructured":"Sadeghpour Gildeh B, Gien D (2001) La distance-dp, q et le cofficient de corr\u00e9lation entre deux variables al\u00e9atoires floues. Actes de LFA 1:97\u2013102","journal-title":"Actes de LFA"},{"issue":"6","key":"825_CR45","doi-asserted-by":"crossref","first-page":"1409","DOI":"10.1016\/j.cor.2003.11.011","volume":"32","author":"T-N Chuang","year":"2005","unstructured":"Chuang T-N, Kung J-Y (2005) The fuzzy shortest path length and the corresponding shortest path in a network. Comput Oper Res 32(6):1409\u20131428","journal-title":"Comput Oper Res"},{"issue":"11","key":"825_CR46","doi-asserted-by":"crossref","first-page":"2589","DOI":"10.1016\/j.apm.2006.10.018","volume":"31","author":"B Asady","year":"2007","unstructured":"Asady B, Zendehnam A (2007) Ranking fuzzy numbers by distance minimization. Appl Math Modell 31(11):2589\u20132598","journal-title":"Appl Math Modell"},{"issue":"1","key":"825_CR47","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1016\/j.eswa.2011.07.060","volume":"39","author":"R Ezzati","year":"2012","unstructured":"Ezzati R, Allahviranloo T, Khezerloo S, Khezerloo M (2012) An approach for ranking of fuzzy numbers. Expert Syst Appl 39(1):690\u2013695","journal-title":"Expert Syst Appl"},{"key":"825_CR48","volume-title":"Economics of the welfare state","author":"N Barr","year":"2020","unstructured":"Barr N (2020) Economics of the welfare state. Oxford University Press, USA"},{"key":"825_CR49","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/978-94-007-4722-7_46","volume":"61","author":"JM Paix\u00e3o","year":"2013","unstructured":"Paix\u00e3o JM, Santos JL (2013) Labeling methods for the general case of the multi-objective shortest path problem-a computational study. Comput Intell Decision Making 61:489\u2013502","journal-title":"Comput Intell Decision Making"},{"issue":"6","key":"825_CR50","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1109\/TEVC.2002.804323","volume":"6","author":"CW Ahn","year":"2002","unstructured":"Ahn CW, Ramakrishna RS (2002) A genetic algorithm for shortest path routing problem and the sizing of populations. IEEE Trans Evol Comput 6(6):566\u2013579","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00825-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-022-00825-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00825-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T18:59:14Z","timestamp":1677092354000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-022-00825-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,1]]},"references-count":50,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["825"],"URL":"https:\/\/doi.org\/10.1007\/s40747-022-00825-3","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,1]]},"assertion":[{"value":"24 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 August 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no conict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}