{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T06:53:08Z","timestamp":1772002388976,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,5,3]],"date-time":"2022-05-03T00:00:00Z","timestamp":1651536000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,5,3]],"date-time":"2022-05-03T00:00:00Z","timestamp":1651536000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100014718","name":"Innovative Research Group Project of the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61876123"],"award-info":[{"award-number":["61876123"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004480","name":"Natural Science Foundation of Shanxi Province","doi-asserted-by":"publisher","award":["201801D121131"],"award-info":[{"award-number":["201801D121131"]}],"id":[{"id":"10.13039\/501100004480","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004480","name":"Natural Science Foundation of Shanxi Province","doi-asserted-by":"publisher","award":["201901D111264"],"award-info":[{"award-number":["201901D111264"]}],"id":[{"id":"10.13039\/501100004480","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007219","name":"Natural Science Foundation of Shanghai","doi-asserted-by":"publisher","award":["201901D111262"],"award-info":[{"award-number":["201901D111262"]}],"id":[{"id":"10.13039\/100007219","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Fund Program for the Scientific Activities of Selected Returned Overseas Professionals in Shanxi Province"},{"name":"Shanxi Science and Technology Innovation project for Excellent Talents","award":["201805D211028"],"award-info":[{"award-number":["201805D211028"]}]},{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"crossref"}]}],"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>Many optimization problems are expensive in practical applications. The surrogate-assisted optimization methods have attracted extensive attention as they can get satisfyingly optimal solutions in a limited computing resource. In this paper, we propose a two-stage infill strategy and surrogate-ensemble assisted optimization algorithm for solving expensive many-objective optimization problems. In this method, the population is optimized by a surrogate ensemble. Then a two-stage infill strategy is proposed to select individuals for real evaluations. The infill strategy considers individuals with better convergence or greater uncertainty. To calculate the uncertainty, we consider two aspects. One is the approximate variance of the current surrogate ensemble and the other one is the approximate variance of the historical surrogate ensemble. Finally, the population is revised by the recently updated surrogate ensemble. In experiments, we testify our method on two sets of many-objective benchmark problems. The results demonstrate the superiority of our proposed algorithm compared with the state-of-the-art algorithms for solving computationally expensive many-objective optimization problems.<\/jats:p>","DOI":"10.1007\/s40747-022-00751-4","type":"journal-article","created":{"date-parts":[[2022,5,3]],"date-time":"2022-05-03T09:03:14Z","timestamp":1651568594000},"page":"5047-5063","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A two-stage infill strategy and surrogate-ensemble assisted expensive many-objective optimization"],"prefix":"10.1007","volume":"8","author":[{"given":"Yi","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Jian","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Jianchao","family":"Zeng","sequence":"additional","affiliation":[]},{"given":"Ying","family":"Tan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,3]]},"reference":[{"issue":"2","key":"751_CR1","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1109\/TEVC.2003.810761","volume":"7","author":"P Bosman","year":"2003","unstructured":"Bosman P, Thierens D (2003) The balance between proximity and diversity in multiobjective evolutionary algorithms. IEEE Trans Evol Comput 7(2):174\u2013188","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"751_CR2","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1109\/TEVC.2019.2919762","volume":"24","author":"X Cai","year":"2020","unstructured":"Cai X, Gao L, Li X (2020) Efficient generalized surrogate-assisted evolutionary algorithm for high-dimensional expensive problems. IEEE Trans Evol Comput 24(2):365\u2013379","journal-title":"IEEE Trans Evol Comput"},{"issue":"5","key":"751_CR3","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1109\/TEVC.2016.2519378","volume":"20","author":"R Cheng","year":"2016","unstructured":"Cheng R, Jin Y, Olhofer M, Sendhoff B (2016) A reference vector guided evolutionary algorithm for many-objective optimization. IEEE Trans Evol Comput 20(5):773\u2013791","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"751_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1109\/TETCI.2017.2669104","volume":"1","author":"R Cheng","year":"2017","unstructured":"Cheng R, Rodemann T, Fischer M, Olhofer M, Jin Y (2017) Evolutionary many-objective optimization of hybrid electric vehicle control: from general optimization to preference articulation. IEEE Trans Emerg Top Comput Intell 1(2):97\u2013111","journal-title":"IEEE Trans Emerg Top Comput Intell"},{"issue":"1","key":"751_CR5","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TEVC.2016.2622301","volume":"22","author":"T Chugh","year":"2018","unstructured":"Chugh T, Jin Y, Miettinen K, Hakanen J, Sindhya K (2018) A surrogate-assisted reference vector guided evolutionary algorithm for computationally expensive many-objective optimization. IEEE Trans Evol Comput 22(1):129\u2013142","journal-title":"IEEE Trans Evol Comput"},{"key":"751_CR6","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. Wiley, Chichester"},{"key":"751_CR7","first-page":"30","volume":"26","author":"K Deb","year":"1999","unstructured":"Deb K, Goyal M (1999) A combined genetic adaptive search (geneas) for engineering design. Comput Sci Inform 26:30\u201345","journal-title":"Comput Sci Inform"},{"issue":"2","key":"751_CR8","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"},{"issue":"4","key":"751_CR9","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1109\/TEVC.2005.859463","volume":"10","author":"M Emmerich","year":"2006","unstructured":"Emmerich M, Giannakoglou K, Naujoks B (2006) Single- and multiobjective evolutionary optimization assisted by gaussian random field metamodels. IEEE Trans Evol Comput 10(4):421\u2013439","journal-title":"IEEE Trans Evol Comput"},{"key":"751_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107703","volume":"111","author":"Q Gu","year":"2021","unstructured":"Gu Q, Zhou Y, Li X, Ruan S (2021) A surrogate-assisted radial space division evolutionary algorithm for expensive many-objective optimization problems. Appl Soft Comput 111:107703","journal-title":"Appl Soft Comput"},{"issue":"4","key":"751_CR11","doi-asserted-by":"publisher","first-page":"2084","DOI":"10.1109\/TSMC.2020.3044418","volume":"52","author":"D Guo","year":"2022","unstructured":"Guo D, Wang X, Gao K, Jin Y, Ding J, Chai T (2022) Evolutionary optimization of high-dimensional multiobjective and many-objective expensive problems assisted by a dropout neural network. IEEE Trans Syst Man Cybern Syst 52(4):2084\u20132097","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"issue":"1","key":"751_CR12","doi-asserted-by":"publisher","first-page":"77","DOI":"10.3233\/ICA-130452","volume":"21","author":"L Jia","year":"2014","unstructured":"Jia L, Wang Y, Fan L (2014) Multiobjective bilevel optimization for production-distribution planning problems using hybrid genetic algorithm. Integrat Comput Aided Eng 21(1):77\u201390","journal-title":"Integrat Comput Aided Eng"},{"issue":"2","key":"751_CR13","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.swevo.2011.05.001","volume":"1","author":"Y Jin","year":"2011","unstructured":"Jin Y (2011) Surrogate-assisted evolutionary computation: recent advances and future challenges. Swarm Evol Comput 1(2):61\u201370","journal-title":"Swarm Evol Comput"},{"issue":"3","key":"751_CR14","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1109\/TEVC.2018.2869001","volume":"23","author":"Y Jin","year":"2019","unstructured":"Jin Y, Wang H, Chugh T, Guo D, Miettinen K (2019) Data-driven evolutionary optimization: an overview and case studies. IEEE Trans Evol Comput 23(3):442\u2013458","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"751_CR15","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1109\/TEVC.2005.851274","volume":"10","author":"J Knowles","year":"2006","unstructured":"Knowles J (2006) ParEGO: a hybrid algorithm with on-line landscape approximation for expensive multiobjective optimization problems. IEEE Trans Evol Comput 10(1):50\u201366","journal-title":"IEEE Trans Evol Comput"},{"key":"751_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106303","volume":"92","author":"F Li","year":"2020","unstructured":"Li F, Shen W, Cai X, Gao L, Gary Wang G (2020) A fast surrogate-assisted particle swarm optimization algorithm for computationally expensive problems. Appl Soft Comput 92:106303","journal-title":"Appl Soft Comput"},{"key":"751_CR17","first-page":"1","volume":"20","author":"Q Lin","year":"2021","unstructured":"Lin Q, Wu X, Ma L, Li J, Gong M, Coello CAC (2021) An ensemble surrogate-based framework for expensive multiobjective evolutionary optimization. IEEE Trans Evol Comput 20:1","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"751_CR18","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1109\/TEVC.2013.2248012","volume":"18","author":"B Liu","year":"2014","unstructured":"Liu B, Zhang Q, Gielen GGE (2014) A gaussian process surrogate model assisted evolutionary algorithm for medium scale expensive optimization problems. IEEE Trans Evol Comput 18(2):180\u2013192","journal-title":"IEEE Trans Evol Comput"},{"key":"751_CR19","first-page":"1","volume":"20","author":"Y Liu","year":"2021","unstructured":"Liu Y, Liu J, Jin Y (2021) Surrogate-assisted multipopulation particle swarm optimizer for high-dimensional expensive optimization. IEEE Trans Syst Man Cybern Syst 20:1\u201314","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"issue":"2","key":"751_CR20","first-page":"239","volume":"21","author":"MD Mckay","year":"1979","unstructured":"Mckay MD, Beckman RJ, Conover WJ (1979) A comparison of three methods for selecting values of input variables in the analysis of output from a computer code. Technometrics 21(2):239\u2013245","journal-title":"Technometrics"},{"issue":"6","key":"751_CR21","doi-asserted-by":"publisher","first-page":"898","DOI":"10.1109\/TEVC.2017.2693320","volume":"21","author":"N Namura","year":"2017","unstructured":"Namura N, Shimoyama K, Obayashi S (2017) Expected improvement of penalty-based boundary intersection for expensive multiobjective optimization. IEEE Trans Evol Comput 21(6):898\u2013913","journal-title":"IEEE Trans Evol Comput"},{"key":"751_CR22","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1016\/j.ins.2020.11.056","volume":"561","author":"JS Pan","year":"2021","unstructured":"Pan JS, Liu N, Chu SC, Lai T (2021) An efficient surrogate-assisted hybrid optimization algorithm for expensive optimization problems. Inf Sci 561:304\u2013325","journal-title":"Inf Sci"},{"issue":"1","key":"751_CR23","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1109\/TEVC.2018.2802784","volume":"23","author":"L Pan","year":"2019","unstructured":"Pan L, He C, Tian Y, Wang H, Zhang X, Jin Y (2019) A classification-based surrogate-assisted evolutionary algorithm for expensive many-objective optimization. IEEE Trans Evol Comput 23(1):74\u201388","journal-title":"IEEE Trans Evol Comput"},{"key":"751_CR24","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-540-24653-4_23","volume-title":"Appl Evol Comput","author":"EJS Pires","year":"2004","unstructured":"Pires EJS, de Moura Oliveira PB, Machado JAT (2004) Multi-objective genetic manipulator trajectory planner. In: Raidl GR, Cagnoni S, Branke J, Corne DW, Drechsler R, Jin Y, Johnson CG, Machado P, Marchiori E, Rothlauf F, Smith GD, Squillero G (eds) Appl Evol Comput. Springer, Heidelberg, pp 219\u2013229"},{"key":"751_CR25","doi-asserted-by":"crossref","unstructured":"Ponweiser W, Wagner T, Vincze M (2008) Clustered multiple generalized expected improvement: A novel infill sampling criterion for surrogate models. In: 2008 IEEE congress on evolutionary computation (IEEE world congress on computational intelligence), pp 3515\u20133522","DOI":"10.1109\/CEC.2008.4631273"},{"issue":"6","key":"751_CR26","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1109\/TEVC.2021.3073648","volume":"25","author":"Z Song","year":"2021","unstructured":"Song Z, Wang H, He C, Jin Y (2021) A kriging-assisted two-archive evolutionary algorithm for expensive many-objective optimization. IEEE Trans Evol Comput 25(6):1013\u20131027","journal-title":"IEEE Trans Evol Comput"},{"issue":"6","key":"751_CR27","doi-asserted-by":"publisher","first-page":"1461","DOI":"10.1007\/s00500-014-1283-z","volume":"19","author":"C Sun","year":"2015","unstructured":"Sun C, Jin Y, Zeng JC, Yu Y (2015) A two-layer surrogate-assisted particle swarm optimization algorithm. Soft Comput 19(6):1461\u20131475","journal-title":"Soft Comput"},{"issue":"4","key":"751_CR28","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TEVC.2017.2675628","volume":"21","author":"C Sun","year":"2017","unstructured":"Sun C, Jin Y, Cheng R, Ding J, Zeng J (2017) Surrogate-assisted cooperative swarm optimization of high-dimensional expensive problems. IEEE Trans Evol Comput 21(4):644\u2013660","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"751_CR29","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1109\/TEVC.2018.2869247","volume":"23","author":"J Tian","year":"2019","unstructured":"Tian J, Tan Y, Zeng J, Sun C, Jin Y (2019) Multiobjective infill criterion driven gaussian process-assisted particle swarm optimization of high-dimensional expensive problems. IEEE Trans Evol Comput 23(3):459\u2013472","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"751_CR30","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1109\/TEVC.2017.2749619","volume":"22","author":"Y Tian","year":"2018","unstructured":"Tian Y, Cheng R, Zhang X, Cheng F, Jin Y (2018) An indicator-based multiobjective evolutionary algorithm with reference point adaptation for better versatility. IEEE Trans Evol Comput 22(4):609\u2013622","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"751_CR31","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1109\/TEVC.2018.2866854","volume":"23","author":"Y Tian","year":"2019","unstructured":"Tian Y, Cheng R, Zhang X, Su Y, Jin Y (2019) A strengthened dominance relation considering convergence and diversity for evolutionary many-objective optimization. IEEE Trans Evol Comput 23(2):331\u2013345","journal-title":"IEEE Trans Evol Comput"},{"issue":"9","key":"751_CR32","doi-asserted-by":"publisher","first-page":"2664","DOI":"10.1109\/TCYB.2017.2710978","volume":"47","author":"H Wang","year":"2017","unstructured":"Wang H, Jin Y, Doherty J (2017) Committee-based active learning for surrogate-assisted particle swarm optimization of expensive problems. IEEE Trans Cybern 47(9):2664\u20132677","journal-title":"IEEE Trans Cybern"},{"issue":"2","key":"751_CR33","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1109\/TEVC.2018.2834881","volume":"23","author":"H Wang","year":"2019","unstructured":"Wang H, Jin Y, Sun C, Doherty J (2019) Offline data-driven evolutionary optimization using selective surrogate ensembles. IEEE Trans Evol Comput 23(2):203\u2013216","journal-title":"IEEE Trans Evol Comput"},{"key":"751_CR34","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/j.ins.2020.01.048","volume":"519","author":"X Wang","year":"2020","unstructured":"Wang X, Jin Y, Schmitt S, Olhofer M (2020) An adaptive Bayesian approach to surrogate-assisted evolutionary multi-objective optimization. Inf Sci 519:317\u2013331","journal-title":"Inf Sci"},{"issue":"3","key":"751_CR35","first-page":"409","volume":"24","author":"C Yang","year":"2020","unstructured":"Yang C, Ding J, Jin Y, Chai T (2020) Offline data-driven multiobjective optimization: knowledge transfer between surrogates and generation of final solutions. IEEE Trans Evol Comput 24(3):409\u2013423","journal-title":"IEEE Trans Evol Comput"},{"key":"751_CR36","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.ins.2018.04.062","volume":"454\u2013455","author":"H Yu","year":"2018","unstructured":"Yu H, Tan Y, Zeng J, Sun C, Jin Y (2018) Surrogate-assisted hierarchical particle swarm optimization. Inf Sci 454\u2013455:59\u201372","journal-title":"Inf Sci"},{"key":"751_CR37","doi-asserted-by":"publisher","first-page":"2347","DOI":"10.1007\/s40747-021-00421-x","volume":"7","author":"H Yu","year":"2021","unstructured":"Yu H, Kang L, Tan Y, Zeng JC, Sun C (2021) A multi-model assisted differential evolution algorithm for computationally expensive optimization problems. Complex Intell Syst 7:2347\u20132371","journal-title":"Complex Intell Syst"},{"issue":"6","key":"751_CR38","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"},{"issue":"3","key":"751_CR39","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1109\/TEVC.2009.2033671","volume":"14","author":"Q Zhang","year":"2010","unstructured":"Zhang Q, Liu W, Tsang E, Virginas B (2010) Expensive multiobjective optimization by MOEA\/D with Gaussian Process model. IEEE Trans Evol Comput 14(3):456\u2013474","journal-title":"IEEE Trans Evol Comput"},{"key":"751_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.106520","volume":"211","author":"Y Zhao","year":"2021","unstructured":"Zhao Y, Sun C, Zeng J, Tan Y, Zhang G (2021) A surrogate-ensemble assisted expensive many-objective optimization. Knowl Based Syst 211:106520","journal-title":"Knowl Based Syst"},{"key":"751_CR41","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107268","volume":"105","author":"Y Zhao","year":"2021","unstructured":"Zhao Y, Zeng J, Tan Y (2021) Neighborhood samples and surrogate assisted multi-objective evolutionary algorithm for expensive many-objective optimization problems. Appl Soft Comput 105:107268","journal-title":"Appl Soft Comput"},{"key":"751_CR42","first-page":"832","volume-title":"Parallel problem solving from nature","author":"E Zitzler","year":"2004","unstructured":"Zitzler E, K\u00fcnzli S (2004) Indicator-based selection in multiobjective search. Parallel problem solving from nature. Springer, Berlin, pp 832\u2013842"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00751-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-022-00751-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00751-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,30]],"date-time":"2022-10-30T06:38:24Z","timestamp":1667111904000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-022-00751-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,3]]},"references-count":42,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["751"],"URL":"https:\/\/doi.org\/10.1007\/s40747-022-00751-4","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,3]]},"assertion":[{"value":"5 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 April 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 May 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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}