{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:23:26Z","timestamp":1761402206565,"version":"3.37.3"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T00:00:00Z","timestamp":1649376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T00:00:00Z","timestamp":1649376000000},"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":["61673258","61075115"],"award-info":[{"award-number":["61673258","61075115"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007219","name":"natural science foundation of shanghai","doi-asserted-by":"publisher","award":["19ZR1421600)"],"award-info":[{"award-number":["19ZR1421600)"]}],"id":[{"id":"10.13039\/100007219","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2022,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Ant Colony Optimization easily falls into premature stagnation when solving large-scale Travelling Salesmen Problems. To address this problem, a multi-colony ant optimization with dynamic collaborative mechanism and cooperative game is proposed. Firstly, <jats:italic>Ant Colony System<\/jats:italic> and <jats:italic>Max\u2013Min Ant System<\/jats:italic> form heterogeneous colonies. Secondly, to diversify the solutions of the algorithm, the Shapley value in the cooperative game is applied to share the information by distributing the pheromone payoff of the sub-colonies. In addition, the dynamic collaborative mechanism that contains two methods is designed to enhance the co-evolution of the heterogeneous populations. One, called public path recommendation strategy, is proposed to improve the astringency of <jats:italic>Max\u2013Min Ant System<\/jats:italic>. The other is the pheromone fusion mechanism to regulate the pheromone distribution of <jats:italic>Ant Colony System<\/jats:italic> when the algorithm falls into stagnation, which can help the algorithm jump out of the local extremum effectively. Finally, the results demonstrate that the proposed methodology can improve the accuracy of solution effectively in solving large-scale TSP instances and has strong competitiveness with other swarm intelligent algorithms.<\/jats:p>","DOI":"10.1007\/s40747-022-00716-7","type":"journal-article","created":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:02:32Z","timestamp":1649440952000},"page":"4679-4696","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Multi-colony ant optimization with dynamic collaborative mechanism and cooperative game"],"prefix":"10.1007","volume":"8","author":[{"given":"Yadong","family":"Mo","sequence":"first","affiliation":[]},{"given":"Xiaoming","family":"You","sequence":"additional","affiliation":[]},{"given":"Sheng","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,8]]},"reference":[{"key":"716_CR1","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.future.2020.07.008","volume":"114","author":"X Dong","year":"2021","unstructured":"Dong X, Zhang H, Xu M, Shen F (2021) Hybrid genetic algorithm with variable neighborhood search for multi-scale multiple bottleneck traveling salesmen problem. Futur Gener Comput Syst 114:229\u2013242. https:\/\/doi.org\/10.1016\/j.future.2020.07.008","journal-title":"Futur Gener Comput Syst"},{"key":"716_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113612","volume":"158","author":"H Chen","year":"2020","unstructured":"Chen H, Li W, Yang X (2020) A whale optimization algorithm with chaos mechanism based on quasi-opposition for global optimization problems. Expert Syst Appl 158:113612. https:\/\/doi.org\/10.1016\/j.eswa.2020.113612","journal-title":"Expert Syst Appl"},{"key":"716_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107298","volume":"105","author":"K Panwar","year":"2021","unstructured":"Panwar K, Deep K (2021) Discrete Grey Wolf Optimizer for symmetric travelling salesman problem. Appl Soft Comput 105:107298. https:\/\/doi.org\/10.1016\/j.asoc.2021.107298","journal-title":"Appl Soft Comput"},{"key":"716_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107439","volume":"107","author":"Y Wang","year":"2021","unstructured":"Wang Y, Han Z (2021) Ant colony optimization for traveling salesman problem based on parameters optimization. Appl Soft Comput 107:107439. https:\/\/doi.org\/10.1016\/j.asoc.2021.107439","journal-title":"Appl Soft Comput"},{"key":"716_CR5","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man, Cybern Part B 26:29\u201341. https:\/\/doi.org\/10.1109\/3477.484436","journal-title":"IEEE Trans Syst Man, Cybern Part B"},{"key":"716_CR6","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1:53\u201366. https:\/\/doi.org\/10.1109\/4235.585892","journal-title":"IEEE Trans Evol Comput"},{"key":"716_CR7","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T St\u00fctzle","year":"2000","unstructured":"St\u00fctzle T, Hoos HH (2000) MAX\u2013MIN Ant System. Futur Gener Comput Syst 16:889\u2013914. https:\/\/doi.org\/10.1016\/S0167-739X(00)00043-1","journal-title":"Futur Gener Comput Syst"},{"key":"716_CR8","doi-asserted-by":"publisher","first-page":"4749","DOI":"10.1007\/s00500-020-05483-6","volume":"25","author":"V Sangeetha","year":"2021","unstructured":"Sangeetha V, Krishankumar R, Ravichandran KS, Kar S (2021) Energy-efficient green ant colony optimization for path planning in dynamic 3D environments. Soft Comput 25:4749\u20134769. https:\/\/doi.org\/10.1007\/s00500-020-05483-6","journal-title":"Soft Comput"},{"key":"716_CR9","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.ins.2017.04.016","volume":"406\u2013407","author":"K Ye","year":"2017","unstructured":"Ye K, Zhang C, Ning J, Liu X (2017) Ant-colony algorithm with a strengthened negative-feedback mechanism for constraint-satisfaction problems. Inf Sci (Ny) 406\u2013407:29\u201341. https:\/\/doi.org\/10.1016\/j.ins.2017.04.016","journal-title":"Inf Sci (Ny)"},{"key":"716_CR10","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.ins.2017.12.047","volume":"433\u2013434","author":"J Ning","year":"2018","unstructured":"Ning J, Zhang Q, Zhang C, Zhang B (2018) A best-path-updating information-guided ant colony optimization algorithm. Inf Sci (Ny) 433\u2013434:142\u2013162. https:\/\/doi.org\/10.1016\/j.ins.2017.12.047","journal-title":"Inf Sci (Ny)"},{"key":"716_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.114021","volume":"164","author":"B Guan","year":"2021","unstructured":"Guan B, Zhao Y, Li Y (2021) An improved ant colony optimization with an automatic updating mechanism for constraint satisfaction problems. Expert Syst Appl 164:114021. https:\/\/doi.org\/10.1016\/j.eswa.2020.114021","journal-title":"Expert Syst Appl"},{"key":"716_CR12","doi-asserted-by":"crossref","unstructured":"Liu G, He D (2013) An improved ant colony algorithm based on dynamic weight of pheromone updating. In: 2013 ninth international conference on natural computation (ICNC), pp 496\u2013500","DOI":"10.1109\/ICNC.2013.6818027"},{"key":"716_CR13","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1016\/j.asoc.2015.01.068","volume":"30","author":"M Mahi","year":"2015","unstructured":"Mahi M, Baykan \u00d6K, Kodaz H (2015) A new hybrid method based on Particle Swarm Optimization, Ant Colony Optimization and 3-Opt algorithms for Traveling Salesman Problem. Appl Soft Comput J 30:484\u2013490. https:\/\/doi.org\/10.1016\/j.asoc.2015.01.068","journal-title":"Appl Soft Comput J"},{"key":"716_CR14","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.asoc.2016.12.015","volume":"53","author":"F Olivas","year":"2017","unstructured":"Olivas F, Valdez F, Castillo O et al (2017) Ant colony optimization with dynamic parameter adaptation based on interval type-2 fuzzy logic systems. Appl Soft Comput J 53:74\u201387. https:\/\/doi.org\/10.1016\/j.asoc.2016.12.015","journal-title":"Appl Soft Comput J"},{"key":"716_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106720","volume":"97","author":"AF Tuani","year":"2020","unstructured":"Tuani AF, Keedwell E, Collett M (2020) Heterogenous adaptive ant colony optimization with 3-opt local search for the travelling salesman problem. Appl Soft Comput 97:106720. https:\/\/doi.org\/10.1016\/j.asoc.2020.106720","journal-title":"Appl Soft Comput"},{"key":"716_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100675","author":"Y Wang","year":"2020","unstructured":"Wang Y, Wang L, Chen G et al (2020) An improved ant colony optimization algorithm to the periodic vehicle routing problem with time window and service choice. Swarm Evol Comput. https:\/\/doi.org\/10.1016\/j.swevo.2020.100675","journal-title":"Swarm Evol Comput"},{"key":"716_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.112994","author":"E Martin","year":"2020","unstructured":"Martin E, Cervantes A, Saez Y, Isasi P (2020) IACS-HCSP: Improved ant colony optimization for large-scale home care scheduling problems. Expert Syst Appl. https:\/\/doi.org\/10.1016\/j.eswa.2019.112994","journal-title":"Expert Syst Appl"},{"key":"716_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107230","volume":"156","author":"C Miao","year":"2021","unstructured":"Miao C, Chen G, Yan C, Wu Y (2021) Path planning optimization of indoor mobile robot based on adaptive ant colony algorithm. Comput Ind Eng 156:107230. https:\/\/doi.org\/10.1016\/j.cie.2021.107230","journal-title":"Comput Ind Eng"},{"key":"716_CR19","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.enganabound.2021.03.012","volume":"127","author":"Y Yang","year":"2021","unstructured":"Yang Y, Wu W, Zhang J et al (2021) Determination of critical slip surface and safety factor of slope using the vector sum numerical manifold method and MAX-MIN ant colony optimization algorithm. Eng Anal Bound Elem 127:64\u201374. https:\/\/doi.org\/10.1016\/j.enganabound.2021.03.012","journal-title":"Eng Anal Bound Elem"},{"key":"716_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107401","volume":"107","author":"M Shokouhifar","year":"2021","unstructured":"Shokouhifar M (2021) FH-ACO: Fuzzy heuristic-based ant colony optimization for joint virtual network function placement and routing. Appl Soft Comput 107:107401. https:\/\/doi.org\/10.1016\/j.asoc.2021.107401","journal-title":"Appl Soft Comput"},{"key":"716_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.106510","volume":"216","author":"D Zhao","year":"2021","unstructured":"Zhao D, Liu L, Yu F et al (2021) Chaotic random spare ant colony optimization for multi-threshold image segmentation of 2D Kapur entropy. Knowl-Based Syst 216:106510. https:\/\/doi.org\/10.1016\/j.knosys.2020.106510","journal-title":"Knowl-Based Syst"},{"key":"716_CR22","first-page":"5","volume":"1999","author":"LM Gambardella","year":"1999","unstructured":"Gambardella LM (1999) MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows. New Ideas Optim 1999:5","journal-title":"New Ideas Optim"},{"key":"716_CR23","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.ins.2003.10.013","volume":"167","author":"S-C Chu","year":"2004","unstructured":"Chu S-C, Roddick JF, Pan J-S (2004) Ant colony system with communication strategies. Inf Sci (NY) 167:63\u201376. https:\/\/doi.org\/10.1016\/j.ins.2003.10.013","journal-title":"Inf Sci (NY)"},{"key":"716_CR24","doi-asserted-by":"publisher","first-page":"2390","DOI":"10.1016\/j.ins.2010.02.017","volume":"180","author":"C Twomey","year":"2010","unstructured":"Twomey C, St\u00fctzle T, Dorigo M et al (2010) An analysis of communication policies for homogeneous multi-colony ACO algorithms. Inf Sci (NY) 180:2390\u20132404. https:\/\/doi.org\/10.1016\/j.ins.2010.02.017","journal-title":"Inf Sci (NY)"},{"key":"716_CR25","doi-asserted-by":"publisher","first-page":"5006","DOI":"10.1016\/j.eswa.2011.10.012","volume":"39","author":"G Dong","year":"2012","unstructured":"Dong G, Guo WW, Tickle K (2012) Solving the traveling salesman problem using cooperative genetic ant systems. Expert Syst Appl 39:5006\u20135011. https:\/\/doi.org\/10.1016\/j.eswa.2011.10.012","journal-title":"Expert Syst Appl"},{"key":"716_CR26","doi-asserted-by":"publisher","first-page":"157303","DOI":"10.1109\/ACCESS.2019.2949860","volume":"7","author":"D Zhang","year":"2019","unstructured":"Zhang D, You X, Liu S, Yang K (2019) Multi-Colony Ant Colony Optimization Based on Generalized Jaccard Similarity Recommendation Strategy. IEEE Access 7:157303\u2013157317. https:\/\/doi.org\/10.1109\/ACCESS.2019.2949860","journal-title":"IEEE Access"},{"key":"716_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2019.100563","volume":"50","author":"Y Wang","year":"2019","unstructured":"Wang Y, Wang L, Peng Z et al (2019) A multi ant system based hybrid heuristic algorithm for vehicle routing problem with service time customization. Swarm Evol Comput 50:100563. https:\/\/doi.org\/10.1016\/j.swevo.2019.100563","journal-title":"Swarm Evol Comput"},{"key":"716_CR28","doi-asserted-by":"publisher","first-page":"4529","DOI":"10.1007\/s10489-020-01799-w","volume":"50","author":"K Yang","year":"2020","unstructured":"Yang K, You X, Liu S, Pan H (2020) A novel ant colony optimization based on game for traveling salesman problem. Appl Intell 50:4529\u20134542. https:\/\/doi.org\/10.1007\/s10489-020-01799-w","journal-title":"Appl Intell"},{"key":"716_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-020-02099-z","author":"S Li","year":"2021","unstructured":"Li S, You X, Liu S (2021) Multiple ant colony optimization using both novel LSTM network and adaptive Tanimoto communication strategy. Appl Intell. https:\/\/doi.org\/10.1007\/s10489-020-02099-z","journal-title":"Appl Intell"},{"key":"716_CR30","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"CE Shannon","year":"1948","unstructured":"Shannon CE (1948) A mathematical theory of communication. Bell Syst Tech J 27:379\u2013423. https:\/\/doi.org\/10.1002\/j.1538-7305.1948.tb01338.x","journal-title":"Bell Syst Tech J"},{"key":"716_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2020.107517","volume":"107","author":"J Zhao","year":"2020","unstructured":"Zhao J, Liang JM, Dong ZN et al (2020) Accelerating information entropy-based feature selection using rough set theory with classified nested equivalence classes. Pattern Recognit 107:107517. https:\/\/doi.org\/10.1016\/j.patcog.2020.107517","journal-title":"Pattern Recognit"},{"key":"716_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.comptc.2020.112933","volume":"1187","author":"Sh. Sabirov D,","year":"2020","unstructured":"Sh. Sabirov D, (2020) Information entropy of mixing molecules and its application to molecular ensembles and chemical reactions. Comput Theor Chem 1187:112933. https:\/\/doi.org\/10.1016\/j.comptc.2020.112933","journal-title":"Comput Theor Chem"},{"key":"716_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2020.103619","volume":"132","author":"H Zhu","year":"2020","unstructured":"Zhu H, Wang Y, Du C et al (2020) A novel odor source localization system based on particle filtering and information entropy. Rob Auton Syst 132:103619. https:\/\/doi.org\/10.1016\/j.robot.2020.103619","journal-title":"Rob Auton Syst"},{"key":"716_CR34","doi-asserted-by":"crossref","unstructured":"Shapley LS (1952) A Value for n-Person Games","DOI":"10.1515\/9781400881970-018"},{"key":"716_CR35","doi-asserted-by":"publisher","first-page":"1669","DOI":"10.1007\/s00500-016-2432-3","volume":"22","author":"\u015e G\u00fclc\u00fc","year":"2018","unstructured":"G\u00fclc\u00fc \u015e, Mahi M, Baykan \u00d6K, Kodaz H (2018) A parallel cooperative hybrid method based on ant colony optimization and 3-Opt algorithm for solving traveling salesman problem. Soft Comput 22:1669\u20131685. https:\/\/doi.org\/10.1007\/s00500-016-2432-3","journal-title":"Soft Comput"},{"key":"716_CR36","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/s00500-014-1279-8","volume":"19","author":"W Yong","year":"2015","unstructured":"Yong W (2015) Hybrid Max-Min ant system with four vertices and three lines inequality for traveling salesman problem. Soft Comput 19:585\u2013596. https:\/\/doi.org\/10.1007\/s00500-014-1279-8","journal-title":"Soft Comput"},{"key":"716_CR37","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1007\/s10489-020-01841-x","volume":"51","author":"H Pan","year":"2021","unstructured":"Pan H, You X, Liu S, Zhang D (2021) Pearson correlation coefficient-based pheromone refactoring mechanism for multi-colony ant colony optimization. Appl Intell 51:752\u2013774. https:\/\/doi.org\/10.1007\/s10489-020-01841-x","journal-title":"Appl Intell"},{"key":"716_CR38","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.asoc.2018.03.048","volume":"68","author":"S Hore","year":"2018","unstructured":"Hore S, Chatterjee A, Dewanji A (2018) Improving variable neighborhood search to solve the traveling salesman problem. Appl Soft Comput J 68:83\u201391. https:\/\/doi.org\/10.1016\/j.asoc.2018.03.048","journal-title":"Appl Soft Comput J"},{"key":"716_CR39","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.114639","volume":"172","author":"Y Saji","year":"2021","unstructured":"Saji Y, Barkatou M (2021) A discrete bat algorithm based on L\u00e9vy flights for Euclidean traveling salesman problem. Expert Syst Appl 172:114639. https:\/\/doi.org\/10.1016\/j.eswa.2021.114639","journal-title":"Expert Syst Appl"},{"key":"716_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105887","volume":"86","author":"MAH Akhand","year":"2020","unstructured":"Akhand MAH, Ayon SI, Shahriyar SA et al (2020) Discrete Spider monkey optimization for travelling salesman problem. Appl Soft Comput J 86:105887. https:\/\/doi.org\/10.1016\/j.asoc.2019.105887","journal-title":"Appl Soft Comput J"},{"key":"716_CR41","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.eswa.2017.06.007","volume":"87","author":"AES Ezugwu","year":"2017","unstructured":"Ezugwu AES, Adewumi AO (2017) Discrete symbiotic organisms search algorithm for travelling salesman problem. Expert Syst Appl 87:70\u201378. https:\/\/doi.org\/10.1016\/j.eswa.2017.06.007","journal-title":"Expert Syst Appl"},{"key":"716_CR42","doi-asserted-by":"publisher","first-page":"14439","DOI":"10.1016\/j.eswa.2011.04.163","volume":"38","author":"SM Chen","year":"2011","unstructured":"Chen SM, Chien CY (2011) Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques. Expert Syst Appl 38:14439\u201314450. https:\/\/doi.org\/10.1016\/j.eswa.2011.04.163","journal-title":"Expert Syst Appl"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00716-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-022-00716-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00716-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,27]],"date-time":"2022-10-27T13:22:53Z","timestamp":1666876973000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-022-00716-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,8]]},"references-count":42,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["716"],"URL":"https:\/\/doi.org\/10.1007\/s40747-022-00716-7","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"type":"print","value":"2199-4536"},{"type":"electronic","value":"2198-6053"}],"subject":[],"published":{"date-parts":[[2022,4,8]]},"assertion":[{"value":"8 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 April 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":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}