{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T04:56:41Z","timestamp":1770353801675,"version":"3.49.0"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T00:00:00Z","timestamp":1664496000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T00:00:00Z","timestamp":1664496000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s10115-022-01752-y","type":"journal-article","created":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T17:04:15Z","timestamp":1664557455000},"page":"281-339","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Multi-objective covering salesman problem: a decomposition approach using grey wolf optimization"],"prefix":"10.1007","volume":"65","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4052-551X","authenticated-orcid":false,"given":"Indadul","family":"Khan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krishnendu","family":"Basuli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manas Kumar","family":"Maiti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,30]]},"reference":[{"key":"1752_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.swevo.2015.02.003","volume":"23","author":"I Ariyasingha","year":"2015","unstructured":"Ariyasingha I, Fernando T (2015) Performance analysis of the multi-objective ant colony optimization algorithms for the traveling salesman problem. Swarm Evol Comput 23:11\u201326","journal-title":"Swarm Evol Comput"},{"issue":"3","key":"1752_CR2","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0166-218X(94)90008-6","volume":"55","author":"EM Arkin","year":"1994","unstructured":"Arkin EM, Hassin R (1994) Approximation algorithms for the geometric covering salesman problem. Discret Appl Math 55(3):197\u2013218","journal-title":"Discret Appl Math"},{"key":"1752_CR3","doi-asserted-by":"crossref","unstructured":"Audet C, Bigeon J, Cartier D, Le Digabel S, and Salomon L (2020) Performance indicators in multi-objective optimization. Eur J Oper Res","DOI":"10.1016\/j.ejor.2020.11.016"},{"issue":"2","key":"1752_CR4","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10710-005-6164-x","volume":"6","author":"CAC Coello","year":"2005","unstructured":"Coello CAC, Cortes NC (2005) Solving multiobjective optimization problems using an artificial immune system. Genet Program Evolvable Mach 6(2):163\u2013190","journal-title":"Genet Program Evolvable Mach"},{"issue":"3","key":"1752_CR5","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1287\/trsc.23.3.208","volume":"23","author":"JR Current","year":"1989","unstructured":"Current JR, Schilling DA (1989) The covering salesman problem. Transp Sci 23(3):208\u2013213","journal-title":"Transp Sci"},{"issue":"3","key":"1752_CR6","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1137\/S1052623496307510","volume":"8","author":"I Das","year":"1998","unstructured":"Das I, Dennis JE (1998) Normal-boundary intersection: a new method for generating the pareto surface in nonlinear multicriteria optimization problems. SIAM J Optim 8(3):631\u2013657","journal-title":"SIAM J Optim"},{"issue":"2\u20134","key":"1752_CR7","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0045-7825(99)00389-8","volume":"186","author":"K Deb","year":"2000","unstructured":"Deb K (2000) An efficient constraint handling method for genetic algorithms. Comput Methods Appl Mech Eng 186(2\u20134):311\u2013338","journal-title":"Comput Methods Appl Mech Eng"},{"key":"1752_CR8","volume-title":"Multi-objective optimization using evolutionary algorithms","author":"K Deb","year":"2001","unstructured":"Deb K (2001) Multi-objective optimization using evolutionary algorithms, vol 16. John Wiley & Sons, London"},{"issue":"2","key":"1752_CR9","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 (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"key":"1752_CR10","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1016\/j.procs.2015.09.006","volume":"65","author":"E Emary","year":"2015","unstructured":"Emary E, Yamany W, Hassanien AE, Snasel V (2015) Multi-objective gray-wolf optimization for attribute reduction. Procedia Comput Sci 65:623\u2013632","journal-title":"Procedia Comput Sci"},{"key":"1752_CR11","unstructured":"Fonseca CM, Fleming PJ (1993) Genetic algorithms for multiobjective optimization: Formulationdiscussion and generalization. In: Icga, vol 93, pp 416\u2013423"},{"issue":"4","key":"1752_CR12","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.45.4.568","volume":"45","author":"M Gendreau","year":"1997","unstructured":"Gendreau M, Laporte G, Semet F (1997) The covering tour problem. Oper Res 45(4):568\u2013576","journal-title":"Oper Res"},{"issue":"4","key":"1752_CR13","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1287\/ijoc.1110.0480","volume":"24","author":"B Golden","year":"2012","unstructured":"Golden B, Naji-Azimi Z, Raghavan S, Salari M, Toth P (2012) The generalized covering salesman problem. INFORMS J Comput 24(4):534\u2013553","journal-title":"INFORMS J Comput"},{"key":"1752_CR14","unstructured":"Gottlieb J, Raidl GR (2006) Evolutionary computation in combinatorial optimization: 6th European conference, EvoCOP 2006, Budapest, Hungary, April 10\u201312, 2006, proceedings, vol 3906. Springer, Berlin"},{"key":"1752_CR15","doi-asserted-by":"crossref","unstructured":"Gulczynski DJ, Heath JW, Price CC (2006) The close enough traveling salesman problem: a discussion of several heuristics. In: Perspectives in operations research, pp 271\u2013283","DOI":"10.1007\/978-0-387-39934-8_16"},{"issue":"1","key":"1752_CR16","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0305-0548(99)00006-4","volume":"27","author":"M Hachicha","year":"2000","unstructured":"Hachicha M, Hodgson MJ, Laporte G, Semet F (2000) Heuristics for the multi-vehicle covering tour problem. Comput Oper Res 27(1):29\u201342","journal-title":"Comput Oper Res"},{"key":"1752_CR17","unstructured":"Helsgaun K (2006) An effective implementation of K-opt moves for the Lin-Kernighan TSP. In: Roskilde University, 2007. Case"},{"key":"1752_CR18","doi-asserted-by":"crossref","unstructured":"Horn J, Nafpliotis N, Goldberg DE (1994) A niched pareto genetic algorithm for multiobjective optimization. In:Proceedings of the first IEEE conference on evolutionary computation. IEEE world congress on computational intelligence. IEEE, pp 82\u20137","DOI":"10.1109\/ICEC.1994.350037"},{"key":"1752_CR19","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1288\/1\/012057","volume":"1288","author":"W Huang","year":"2019","unstructured":"Huang W, Zhang Y, Li L (2019) Survey on multi-objective evolutionary algorithms. J Phys Conf Ser 1288:012057","journal-title":"J Phys Conf Ser"},{"key":"1752_CR20","volume-title":"Nonlinear multiobjective optimization","author":"M Kaisa","year":"1999","unstructured":"Kaisa M (1999) Nonlinear multiobjective optimization, vol 12. Springer US"},{"key":"1752_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109011","volume":"124","author":"RK Khadanga","year":"2022","unstructured":"Khadanga RK, Kumar A, Panda S (2022) A modified grey wolf optimization with cuckoo search algorithm for load frequency controller design of hybrid power system. Appl Soft Comput 124:109011","journal-title":"Appl Soft Comput"},{"issue":"1","key":"1752_CR22","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s40595-017-0099-z","volume":"5","author":"I Khan","year":"2018","unstructured":"Khan I, Maiti MK (2018) A novel hybrid algorithm for generalized traveling salesman problems in different environments. Vietnam J Comput Sci 5(1):27\u201343","journal-title":"Vietnam J Comput Sci"},{"key":"1752_CR23","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1016\/j.swevo.2018.05.006","volume":"44","author":"I Khan","year":"2019","unstructured":"Khan I, Maiti MK (2019) A swap sequence based artificial bee colony algorithm for traveling salesman problem. Swarm Evol Comput 44:428\u2013438","journal-title":"Swarm Evol Comput"},{"key":"1752_CR24","doi-asserted-by":"crossref","unstructured":"Khan I, Maiti MK, Maiti M (2017) Coordinating particle swarm optimization, ant colony optimization and K-opt algorithm for traveling salesman problem. In: International conference on mathematics and computing. Springer, Berlin, pp 103\u2013119","DOI":"10.1007\/978-981-10-4642-1_10"},{"key":"1752_CR25","doi-asserted-by":"crossref","unstructured":"Khan I, Pal S, Maiti MK (2018) A modified particle swarm optimization algorithm for solving traveling salesman problem with imprecise cost matrix. In: 2018 4th International conference on recent advances in information technology (RAIT). IEEE, pp 1\u20138","DOI":"10.1109\/RAIT.2018.8389060"},{"issue":"05","key":"1752_CR26","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1142\/S0218488519500314","volume":"27","author":"I Khan","year":"2019","unstructured":"Khan I, Pal S, Maiti MK (2019) A hybrid PSO-GA algorithm for traveling salesman problems in different environments. Int J Uncertain Fuzziness Knowl Based Syst 27(05):693\u2013717","journal-title":"Int J Uncertain Fuzziness Knowl Based Syst"},{"key":"1752_CR27","doi-asserted-by":"crossref","unstructured":"Khan I, Maiti MK, Basuli K (2020) Multi-objective traveling salesman problem: an ABC approach. Appl Intell","DOI":"10.1007\/s10489-020-01713-4"},{"key":"1752_CR28","doi-asserted-by":"crossref","unstructured":"Khan I, Maiti MK, Basuli K (2022) Multi-objective generalized traveling salesman problem: a decomposition approach. Appl Intell","DOI":"10.1007\/s10115-022-01752-y"},{"key":"1752_CR29","doi-asserted-by":"crossref","unstructured":"Knowles J, Corne D (1999) The pareto archived evolution strategy: a new baseline algorithm for pareto multiobjective optimisation. In: Proceedings of the 1999 congress on evolutionary computation-CEC99 (Cat. No. 99TH8406), vol 1. IEEE, pp 98\u2013105","DOI":"10.1109\/CEC.1999.781913"},{"issue":"2","key":"1752_CR30","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1162\/106365600568167","volume":"8","author":"JD Knowles","year":"2000","unstructured":"Knowles JD, Corne DW (2000) Approximating the nondominated front using the pareto archived evolution strategy. Evol Comput 8(2):149\u2013172","journal-title":"Evol Comput"},{"issue":"3","key":"1752_CR31","first-page":"177","volume":"43","author":"M Labb","year":"2004","unstructured":"Labb M, Laporte G, Mart\u0131n IR, Gonzalez JJS (2004) The ring star problem: polyhedral analysis and exact algorithm. Netw Int J 43(3):177\u2013189","journal-title":"Netw Int J"},{"issue":"2","key":"1752_CR32","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.ejor.2003.07.010","volume":"160","author":"M Labb","year":"2005","unstructured":"Labb M, Laporte G, Mart\u0131n IR, Gonz\u00e1lez JJS (2005) Locating median cycles in networks. Eur J Oper Res 160(2):457\u2013470","journal-title":"Eur J Oper Res"},{"key":"1752_CR33","doi-asserted-by":"crossref","unstructured":"Lancia G, Dalpasso M (2019) Algorithmic strategies for a fast exploration of the TSP 4-opt neighborhood. In: Advances in optimization and decision science for society, services and enterprises. Springer, Berlin, pp 457\u2013470","DOI":"10.1007\/978-3-030-34960-8_40"},{"issue":"2","key":"1752_CR34","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling-salesman problem. Oper Res 21(2):498\u2013516","journal-title":"Oper Res"},{"key":"1752_CR35","doi-asserted-by":"crossref","unstructured":"Liu Q, Li X, Liu H, Guo Z (2020) Multi-objective metaheuristics for discrete optimization problems: a review of the state-of-the-art. Appl Soft Comput 106382","DOI":"10.1016\/j.asoc.2020.106382"},{"key":"1752_CR36","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.eswa.2015.10.019","volume":"46","author":"S Maity","year":"2016","unstructured":"Maity S, Roy A, Maiti M (2016) An imprecise multi-objective genetic algorithm for uncertain constrained multi-objective solid travelling salesman problem. Expert Syst Appl 46:196\u2013223","journal-title":"Expert Syst Appl"},{"key":"1752_CR37","volume-title":"Genetic algorithms+ data structures= evolution programs","author":"Z Michalewicz","year":"2013","unstructured":"Michalewicz Z (2013) Genetic algorithms+ data structures= evolution programs. Springer, Berlin"},{"key":"1752_CR38","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69:46\u201361","journal-title":"Adv Eng Softw"},{"key":"1752_CR39","doi-asserted-by":"publisher","first-page":"1670","DOI":"10.1016\/j.procs.2017.08.189","volume":"112","author":"M Mnif","year":"2017","unstructured":"Mnif M, Bouamama S (2017) Firework algorithm for multi-objective optimization of a multimodal transportation network problem. Procedia Comput Sci 112:1670\u20131682","journal-title":"Procedia Comput Sci"},{"key":"1752_CR40","doi-asserted-by":"crossref","unstructured":"Mohamed AAA, El-Gaafary AA, Mohamed YS, Hemeida AM (2016) Multi-objective modified grey wolf optimizer for optimal power flow. In: 2016 Eighteenth international middle east power systems conference (MEPCON). IEEE, pp 982\u2013990","DOI":"10.1109\/MEPCON.2016.7837016"},{"issue":"4","key":"1752_CR41","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt G (1991) TSPLIB\u2014a traveling salesman problem library. ORSA J Comput 3(4):376\u2013384","journal-title":"ORSA J Comput"},{"issue":"11","key":"1752_CR42","doi-asserted-by":"publisher","first-page":"2594","DOI":"10.1016\/j.cor.2012.01.004","volume":"39","author":"M Salari","year":"2012","unstructured":"Salari M, Naji-Azimi Z (2012) An integer programming-based local search for the covering salesman problem. Comput Oper Res 39(11):2594\u20132602","journal-title":"Comput Oper Res"},{"key":"1752_CR43","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/j.cie.2015.02.019","volume":"83","author":"M Salari","year":"2015","unstructured":"Salari M, Reihaneh M, Sabbagh MS (2015) Combining ant colony optimization algorithm and dynamic programming technique for solving the covering salesman problem. Comput Ind Eng 83:244\u2013251","journal-title":"Comput Ind Eng"},{"issue":"3","key":"1752_CR44","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/s101070050128","volume":"87","author":"S Say\u0131n","year":"2000","unstructured":"Say\u0131n S (2000) Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming. Math Program 87(3):543\u2013560","journal-title":"Math Program"},{"key":"1752_CR45","unstructured":"Schott JR (1995) Fault tolerant design using single and multicriteria genetic algorithm optimization. PhD thesis, Massachusetts Institute of Technology"},{"key":"1752_CR46","doi-asserted-by":"crossref","unstructured":"Shuttleworth R, Golden BL, Smith S, Wasil E (2008) Advances in meter reading: heuristic solution of the close enough traveling salesman problem over a street network. In: The vehicle routing problem: latest advances and new challenges. Springer, Berlin, pp 487\u2013501","DOI":"10.1007\/978-0-387-77778-8_22"},{"key":"1752_CR47","doi-asserted-by":"crossref","unstructured":"Sopto DS, Ayon SI, Akhand M, Siddique N (2018) Modified grey wolf optimization to solve traveling salesman problem. In: 2018 International conference on innovation in engineering and technology (ICIET). IEEE, pp 1\u20134","DOI":"10.1109\/CIET.2018.8660872"},{"issue":"3","key":"1752_CR48","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1162\/evco.1994.2.3.221","volume":"2","author":"N Srinivas","year":"1994","unstructured":"Srinivas N, Deb K (1994) Muiltiobjective optimization using nondominated sorting in genetic algorithms. Evol Comput 2(3):221\u2013248","journal-title":"Evol Comput"},{"key":"1752_CR49","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s11721-019-00170-1","volume":"14","author":"V Trivedi","year":"2020","unstructured":"Trivedi V, Varshney P, Ramteke M (2020) A simplified multi-objective particle swarm optimization algorithm. Swarm Intell 14:83\u2013116","journal-title":"Swarm Intell"},{"key":"1752_CR50","unstructured":"Van Veldhuizen DA (1999) Multiobjective evolutionary algorithms: classifications, analyses, and new innovations. Technical report, AIR FORCE INST OF TECH WRIGHT-PATTERSONAFB OH SCHOOL OF ENGINEERING"},{"key":"1752_CR51","doi-asserted-by":"crossref","unstructured":"Van Veldhuizen DA, Lamont GB (2000) On measuring multiobjective evolutionary algorithm performance. In: Proceedings of the 2000 congress on evolutionary computation. CEC00 (Cat. No. 00TH8512), vol 1. IEEE, pp 204\u2013211","DOI":"10.1109\/CEC.2000.870296"},{"key":"1752_CR52","doi-asserted-by":"publisher","first-page":"0360","DOI":"10.1016\/j.energy.2021.122120","volume":"239","author":"C Yang","year":"2022","unstructured":"Yang C, Liu K, Jiao X, Wang X, Chen Ruihu, You Sixiong (2022) An adaptive firework algorithm optimization-based intelligent energy management strategy for plug-in hybrid electric vehicles. Energy 239:0360\u20135442","journal-title":"Energy"},{"issue":"6","key":"1752_CR53","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 (2007) MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712\u2013731","journal-title":"IEEE Trans Evol Comput"},{"key":"1752_CR54","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108157","volume":"169","author":"Z Zhang","year":"2022","unstructured":"Zhang Z, Yang J (2022) A discrete cuckoo search algorithm for traveling salesman problem and its application in cutting path optimization. Comput Ind Eng 169:108157","journal-title":"Comput Ind Eng"},{"key":"1752_CR55","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106280","volume":"140","author":"Z Zhu","year":"2020","unstructured":"Zhu Z, Zhou X (2020) An efficient evolutionary grey wolf optimizer for multi-objective flexible job shop scheduling problem with hierarchical job precedence constraints. Comput Ind Eng 140:106280","journal-title":"Comput Ind Eng"},{"key":"1752_CR56","unstructured":"Zitzler E (1999) Evolutionary algorithms for multiobjective optimization: methods and applications, vol 63"},{"key":"1752_CR57","doi-asserted-by":"crossref","unstructured":"Zitzler E, Thiele L (1998) Multiobjective optimization using evolutionary algorithms-a comparative case study. In: International conference on parallel problem solving from nature. Springer, Berlin, pp 292\u2013301","DOI":"10.1007\/BFb0056872"},{"issue":"4","key":"1752_CR58","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans Evol Comput 3(4):257\u2013271","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-022-01752-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-022-01752-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-022-01752-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T02:06:45Z","timestamp":1673921205000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-022-01752-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,30]]},"references-count":58,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["1752"],"URL":"https:\/\/doi.org\/10.1007\/s10115-022-01752-y","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,30]]},"assertion":[{"value":"7 February 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 August 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 August 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 September 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}