{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T14:34:51Z","timestamp":1762353291254,"version":"3.37.3"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,10,27]],"date-time":"2022-10-27T00:00:00Z","timestamp":1666828800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,10,27]],"date-time":"2022-10-27T00:00:00Z","timestamp":1666828800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100010098","name":"Shanghai Association for Science and Technology","doi-asserted-by":"publisher","award":["21YF1401400"],"award-info":[{"award-number":["21YF1401400"]}],"id":[{"id":"10.13039\/100010098","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62273088","52078356"],"award-info":[{"award-number":["62273088","52078356"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["2232020D-49"],"award-info":[{"award-number":["2232020D-49"]}],"id":[{"id":"10.13039\/501100012226","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":[[2023,4]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Many real-world optimization problems have complex features, such as bias, multimodel, etc. Existing evolutionary algorithms mainly utilize solutions\u2019 current performance to decide their survivals, which are not comprehensive enough to describe the evolving trend, and may misguide the evolve decision. In this paper, a novel robust performance evaluation approach for evolutionary multiobjective optimization algorithm is proposed. Here, the robustness refers to the performance fluctuation degree among several generations, which can be expressed by interval values in respect to the decision and objective spaces. Based on the robust performance evaluation, solutions can be selected and preserved considering their historical performance, and thus, the exploration strength in convergence potential areas can be maintained. Meanwhile, to construct an evolutionary algorithm that embeds robustness evaluation, a robust elite managerial method and a learning-based updating strategy are also designed. Experiments on multiobjective benchmark problems and a real-world optimization in a robotic manipulation system have proved the superiority of the proposed approach.<\/jats:p>","DOI":"10.1007\/s40747-022-00889-1","type":"journal-article","created":{"date-parts":[[2022,10,27]],"date-time":"2022-10-27T10:03:36Z","timestamp":1666865016000},"page":"1913-1927","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A robust performance evaluation approach for solution preservation in multiobjective optimization"],"prefix":"10.1007","volume":"9","author":[{"given":"Anqi","family":"Pan","sequence":"first","affiliation":[]},{"given":"Chuang","family":"Wang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3482-5783","authenticated-orcid":false,"given":"Bo","family":"Shen","sequence":"additional","affiliation":[]},{"given":"Lei","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,27]]},"reference":[{"key":"889_CR1","doi-asserted-by":"publisher","first-page":"106717","DOI":"10.1016\/j.knosys.2020.106717","volume":"214","author":"M Abdel-Basset","year":"2021","unstructured":"Abdel-Basset M, Mohamed R, Mirjalili S et al (2021) Moeoeed, a multi-objective equilibrium optimizer with exploration exploitation dominance strategy. Knowl Based Syst 214:106717. https:\/\/doi.org\/10.1016\/j.knosys.2020.106717","journal-title":"Knowl Based Syst"},{"issue":"1","key":"889_CR2","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1109\/TEVC.2014.2301794","volume":"19","author":"B Chen","year":"2015","unstructured":"Chen B, Zeng W, Lin Y et al (2015) A new local search-based multiobjective optimization algorithm. IEEE Trans Evolut Comput 19(1):50\u201373. https:\/\/doi.org\/10.1109\/TEVC.2014.2301794","journal-title":"IEEE Trans Evolut Comput"},{"key":"889_CR3","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2019.2930737","author":"H Chen","year":"2019","unstructured":"Chen H, Cheng R, Pedrycz W et al (2019) Solving many-objective optimization problems via multistage evolutionary search. IEEE Trans Syst Man Cybern Syst. https:\/\/doi.org\/10.1109\/TSMC.2019.2930737","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"issue":"2","key":"889_CR4","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1109\/TCYB.2014.2322602","volume":"45","author":"R Cheng","year":"2015","unstructured":"Cheng R, Jin Y (2015) A competitive swarm optimizer for large scale optimization. IEEE Trans Cybern 45(2):191\u2013204. https:\/\/doi.org\/10.1109\/TCYB.2014.2322602","journal-title":"IEEE Trans Cybern"},{"issue":"3","key":"889_CR5","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1109\/tevc.2004.826067","volume":"8","author":"CAC Coello","year":"2004","unstructured":"Coello CAC, Pulido GT, Lechuga MS (2004) Handling multiple objectives with particle swarm optimization. IEEE Trans Evolut Comput 8(3):256\u2013279. https:\/\/doi.org\/10.1109\/tevc.2004.826067","journal-title":"IEEE Trans Evolut Comput"},{"issue":"4","key":"889_CR6","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","volume":"18","author":"K Deb","year":"2014","unstructured":"Deb K, Jain H (2014) An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: solving problems with box constraints. IEEE Trans Evolut Comput 18(4):577\u2013601","journal-title":"IEEE Trans Evolut Comput"},{"issue":"2","key":"889_CR7","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 et al (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evolut Comput 6(2):182\u2013197. https:\/\/doi.org\/10.1109\/4235.996017","journal-title":"IEEE Trans Evolut Comput"},{"key":"889_CR8","doi-asserted-by":"publisher","unstructured":"Denysiuk R, CostaL, Santo IE (2013) Manyobjective optimization using differential evolution with variable-wise mutation restriction. In: Proceedings of the 15th annual conference on genetic and evolutionary computation (GECCO\u201913). Association for Computing Machinery, New York, NY, USA, 591\u2013598. https:\/\/doi.org\/10.1145\/2463372.2463445","DOI":"10.1145\/2463372.2463445"},{"key":"889_CR9","doi-asserted-by":"publisher","first-page":"100980","DOI":"10.1016\/j.swevo.2021.100980","volume":"68","author":"LRC de Farias","year":"2022","unstructured":"de Farias LRC, Ara\u00fajo AFR (2022) A decomposition-based many-objective evolutionary algorithm updating weights when required. Swarm Evolut Comput 68:100980. https:\/\/doi.org\/10.1016\/j.swevo.2021.100980","journal-title":"Swarm Evolut Comput"},{"issue":"1","key":"889_CR10","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1109\/tevc.2019.2912204","volume":"24","author":"D Gong","year":"2020","unstructured":"Gong D, Xu B, Zhang Y et al (2020) A similarity-based cooperative co-evolutionary algorithm for dynamic interval multiobjective optimization problems. IEEE Trans Evolut Comput 24(1):142\u2013156. https:\/\/doi.org\/10.1109\/tevc.2019.2912204","journal-title":"IEEE Trans Evolut Comput"},{"key":"889_CR11","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.future.2020.01.048","volume":"107","author":"Z Gu","year":"2020","unstructured":"Gu Z, Wang G (2020) Improving NSGA-III algorithms with information feedback models for large-scale many-objective optimization. Future Gener Comput Syst 107:49\u201369. https:\/\/doi.org\/10.1016\/j.future.2020.01.048","journal-title":"Future Gener Comput Syst"},{"key":"889_CR12","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/j.swevo.2019.03.015","volume":"48","author":"Y Guo","year":"2019","unstructured":"Guo Y, Yang H, Chen M et al (2019) Ensemble prediction-based dynamic robust multi-objective optimization methods. Swarm Evolut Comput 48:156\u2013171. https:\/\/doi.org\/10.1016\/j.swevo.2019.03.015","journal-title":"Swarm Evolut Comput"},{"key":"889_CR13","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1080\/00207721.2021.1941396","volume":"53","author":"W Huang","year":"2022","unstructured":"Huang W, Wu M, Hu J et al (2022) A multi-objective optimisation algorithm for a drilling trajectory constrained to wellbore stability. Int J Syst Sci 53:154\u2013167. https:\/\/doi.org\/10.1080\/00207721.2021.1941396","journal-title":"Int J Syst Sci"},{"key":"889_CR14","doi-asserted-by":"publisher","unstructured":"Ishibuchi H, Hitotsuyanagi Y, Tsukamoto N, Nojima Y (2010) Many-objective Test problems to visually examine the behavior of multiobjective evolution in a decision space. In: Schaefer R, Cotta C, Kolodziej J, Rudolph G (eds) Parallel problem solving from nature,PPSN XI. PPSN 2010. Lecture Notes in Computer Science, vol 6239. Springer, Berlin,Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-15871-1_10","DOI":"10.1007\/978-3-642-15871-1_10"},{"issue":"2","key":"889_CR15","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 (2009) Multiobjective optimization problems with complicated Pareto sets, MOEA\/D and NSGA-II. IEEE Trans Evolut Comput 13(2):284\u2013302. https:\/\/doi.org\/10.1109\/tevc.2008.925798","journal-title":"IEEE Trans Evolut Comput"},{"issue":"1","key":"889_CR16","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 (2017) Biased multiobjective optimization and decomposition algorithm. IEEE Trans Cybern 47(1):52\u201366. https:\/\/doi.org\/10.1109\/TCYB.2015.2507366","journal-title":"IEEE Trans Cybern"},{"key":"889_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2019.100629","author":"Q Li","year":"2020","unstructured":"Li Q, Cao Z, Ding W et al (2020) A multi-objective adaptive evolutionary algorithm to extract communities in networks. Swarm Evolut Comput. https:\/\/doi.org\/10.1016\/j.swevo.2019.100629","journal-title":"Swarm Evolut Comput"},{"key":"889_CR18","doi-asserted-by":"publisher","unstructured":"Limbourg P, Aponte DES (2005) An optimization algorithm for imprecise multi-objective problem functions. In: 2005 IEEE Congress on evolutionary computation, vol 1, pp 459\u2013466. https:\/\/doi.org\/10.1109\/CEC.2005.1554719","DOI":"10.1109\/CEC.2005.1554719"},{"issue":"1","key":"889_CR19","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/tevc.2016.2631279","volume":"22","author":"Q Lin","year":"2018","unstructured":"Lin Q, Liu S, Zhu Q et al (2018) Particle swarm optimization with a balanceable fitness estimation for many-objective optimization problems. IEEE Trans Evolut Comput 22(1):32\u201346. https:\/\/doi.org\/10.1109\/tevc.2016.2631279","journal-title":"IEEE Trans Evolut Comput"},{"issue":"9","key":"889_CR20","doi-asserted-by":"publisher","first-page":"2689","DOI":"10.1109\/TCYB.2016.2638902","volume":"47","author":"Y Liu","year":"2017","unstructured":"Liu Y, Gong D, Sun J et al (2017) A many-objective evolutionary algorithm using a one-by-one selection strategy. IEEE Trans Cybern 47(9):2689\u20132702","journal-title":"IEEE Trans Cybern"},{"issue":"4","key":"889_CR21","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1109\/TEVC.2020.2978158","volume":"24","author":"X Ma","year":"2020","unstructured":"Ma X, Yu Y, Li X et al (2020) A survey of weight vector adjustment methods for decomposition-based multiobjective evolutionary algorithms. IEEE Trans Evolut Comput 24(4):634\u2013649. https:\/\/doi.org\/10.1109\/TEVC.2020.2978158","journal-title":"IEEE Trans Evolut Comput"},{"key":"889_CR22","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.ins.2020.11.040","volume":"555","author":"V Palakonda","year":"2021","unstructured":"Palakonda V, Mallipeddi R, Suganthan PN (2021) An ensemble approach with external archive for multi- and many-objective optimization with adaptive mating mechanism and two-level environmental selection. Inf Sci 555:164\u2013197. https:\/\/doi.org\/10.1016\/j.ins.2020.11.040","journal-title":"Inf Sci"},{"issue":"1","key":"889_CR23","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/S0377-2217(99)00319-7","volume":"127","author":"A Sengupta","year":"2000","unstructured":"Sengupta A, Pal TK (2000) On comparing interval numbers. Eur J Oper Res 127(1):28\u201343. https:\/\/doi.org\/10.1016\/S0377-2217(99)00319-7","journal-title":"Eur J Oper Res"},{"issue":"8","key":"889_CR24","doi-asserted-by":"publisher","first-page":"3444","DOI":"10.1109\/tcyb.2019.2908485","volume":"50","author":"J Sun","year":"2020","unstructured":"Sun J, Miao Z, Gong D et al (2020) Interval multiobjective optimization with memetic algorithms. IEEE Trans Cybern 50(8):3444\u20133457. https:\/\/doi.org\/10.1109\/tcyb.2019.2908485","journal-title":"IEEE Trans Cybern"},{"issue":"5","key":"889_CR25","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1109\/TEVC.2018.2882166","volume":"23","author":"Y Sun","year":"2019","unstructured":"Sun Y, Xue B, Zhang M et al (2019) A new two-stage evolutionary algorithm for many-objective optimization. IEEE Trans Evolut Comput 23(5):748\u2013761. https:\/\/doi.org\/10.1109\/TEVC.2018.2882166","journal-title":"IEEE Trans Evolut Comput"},{"key":"889_CR26","doi-asserted-by":"publisher","first-page":"106,124","DOI":"10.1016\/j.asoc.2020.106124","volume":"89","author":"X Tao","year":"2020","unstructured":"Tao X, Guo W, Li Q et al (2020) Multiple scale self-adaptive cooperation mutation strategy-based particle swarm optimization. Appl Soft Comput 89:106,124. https:\/\/doi.org\/10.1016\/j.asoc.2020.106124","journal-title":"Appl Soft Comput"},{"issue":"4","key":"889_CR27","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1109\/MCI.2017.2742868","volume":"12","author":"Y Tian","year":"2017","unstructured":"Tian Y, Cheng R, Zhang X et al (2017) PlatEMO: a MATLAB platform for evolutionary multi-objective optimization [educational forum]. IEEE Comput Intell Mag 12(4):73\u201387","journal-title":"IEEE Comput Intell Mag"},{"key":"889_CR28","doi-asserted-by":"publisher","unstructured":"Tian Y, Cheng H, Cheng R et al (2021) A Multistage evolutionary algorithm for better diversity preservation in multiobjective Optimization. IEEE Trans Syst Man Cybern Syst 51(9):5880\u20135894. https:\/\/doi.org\/10.1109\/TSMC.2019.2956288","DOI":"10.1109\/TSMC.2019.2956288"},{"key":"889_CR29","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1080\/00207721.2020.1837991","volume":"52","author":"MG Villarreal-Cervantes","year":"2021","unstructured":"Villarreal-Cervantes MG, Pantoja-Garc\u00eda JS, Rodr\u00edguez-Molina A et al (2021) Pareto optimal synthesis of eight-bar mechanism using meta-heuristic multi-objective search approaches: application to bipedal gait generation. Int J Syst Sci 52:671\u2013693. https:\/\/doi.org\/10.1080\/00207721.2020.1837991","journal-title":"Int J Syst Sci"},{"key":"889_CR30","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.neucom.2019.12.048","volume":"384","author":"C Wang","year":"2020","unstructured":"Wang C, Xu R, Qiu J et al (2020) AdaBoost-inspired multi-operator ensemble strategy for multi-objective evolutionary algorithms. Neurocomputing 384:243\u2013255. https:\/\/doi.org\/10.1016\/j.neucom.2019.12.048","journal-title":"Neurocomputing"},{"issue":"4","key":"889_CR31","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1109\/tevc.2014.2350987","volume":"19","author":"H Wang","year":"2015","unstructured":"Wang H, Jiao L, Yao X (2015) Two Arch2: an improved two-archive algorithm for many-objective optimization. IEEE Trans Evolut Comput 19(4):524\u2013541. https:\/\/doi.org\/10.1109\/tevc.2014.2350987","journal-title":"IEEE Trans Evolut Comput"},{"key":"889_CR32","doi-asserted-by":"publisher","DOI":"10.1080\/00207721.2022.2070793","author":"HC Wu","year":"2022","unstructured":"Wu HC (2022) Solving multiobjective optimisation problems using genetic algorithms and solutions concepts of cooperative games. Int J Syst Sci. https:\/\/doi.org\/10.1080\/00207721.2022.2070793","journal-title":"Int J Syst Sci"},{"key":"889_CR33","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1016\/j.swevo.2019.06.007","volume":"49","author":"B Xu","year":"2019","unstructured":"Xu B, Zhang H, Zhang M et al (2019) Differential evolution using cooperative ranking-based mutation operators for constrained optimization. Swarm Evolut Comput 49:206\u2013219. https:\/\/doi.org\/10.1016\/j.swevo.2019.06.007","journal-title":"Swarm Evolut Comput"},{"key":"889_CR34","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1016\/j.ins.2018.10.005","volume":"509","author":"JH Yi","year":"2020","unstructured":"Yi JH, Xing LN, Wang GG et al (2020) Behavior of crossover operators in NSGA-III for large-scale optimization problems. Inf Sci 509:470\u2013487","journal-title":"Inf Sci"},{"issue":"4","key":"889_CR35","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1109\/TEVC.2021.3064508","volume":"25","author":"K Zhang","year":"2021","unstructured":"Zhang K, Shen C, Yen GG et al (2021) Two-stage double niched evolution strategy for multimodal multiobjective optimization. IEEE Trans Evolut Comput 25(4):754\u2013768. https:\/\/doi.org\/10.1109\/TEVC.2021.3064508","journal-title":"IEEE Trans Evolut Comput"},{"issue":"5","key":"889_CR36","doi-asserted-by":"publisher","first-page":"1052","DOI":"10.1109\/tfuzz.2018.2872125","volume":"27","author":"L Zhang","year":"2019","unstructured":"Zhang L, Wang S, Zhang K et al (2019) Cooperative artificial bee colony algorithm with multiple populations for interval multiobjective optimization problems. IEEE Trans Fuzzy Syst 27(5):1052\u20131065. https:\/\/doi.org\/10.1109\/tfuzz.2018.2872125","journal-title":"IEEE Trans Fuzzy Syst"},{"issue":"1","key":"889_CR37","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1109\/TEVC.2016.2600642","volume":"22","author":"X Zhang","year":"2018","unstructured":"Zhang X, Tian Y, Cheng R et al (2018) A decision variable clustering-based evolutionary algorithm for large-scale many-objective optimization. IEEE Trans Evolut Comput 22(1):97\u2013112","journal-title":"IEEE Trans Evolut Comput"},{"key":"889_CR38","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.ins.2017.10.037","volume":"427","author":"X Zhang","year":"2018","unstructured":"Zhang X, Zheng X, Cheng R et al (2018) A competitive mechanism based multi-objective particle swarm optimizer with fast convergence. Inf Sci 427:63\u201376. https:\/\/doi.org\/10.1016\/j.ins.2017.10.037","journal-title":"Inf Sci"},{"key":"889_CR39","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2021.3097339","author":"X Zhang","year":"2021","unstructured":"Zhang X, Zhan ZH, Fang W et al (2021) Multi population ant colony system with knowledge based local searches for multiobjective supply chain configuration. IEEE Trans Evolut Comput. https:\/\/doi.org\/10.1109\/TEVC.2021.3097339","journal-title":"IEEE Trans Evolut Comput"},{"issue":"1","key":"889_CR40","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.swevo.2011.03.001","volume":"1","author":"A Zhou","year":"2011","unstructured":"Zhou A, Qu BY, Li H et al (2011) Multiobjective evolutionary algorithms: a survey of the state of the art. Swarm Evolut Comput 1(1):32\u201349","journal-title":"Swarm Evolut Comput"},{"key":"889_CR41","doi-asserted-by":"publisher","unstructured":"Zhou Y, Chen Z, Huang Z et al (2020) A multiobjective evolutionary algorithm based on objective-space localization selection. IEEE Trans Cybern. https:\/\/doi.org\/10.1109\/TCYB.2020.3016426","DOI":"10.1109\/TCYB.2020.3016426"},{"key":"889_CR42","doi-asserted-by":"publisher","unstructured":"Zhu S, Xu L, Goodman ED et al (2021) A new many-objective evolutionary algorithm based on generalized Pareto dominance. IEEE Trans Cybern. https:\/\/doi.org\/10.1109\/TCYB.2021.3051078","DOI":"10.1109\/TCYB.2021.3051078"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00889-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-022-00889-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00889-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T09:38:31Z","timestamp":1681810711000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-022-00889-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,27]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["889"],"URL":"https:\/\/doi.org\/10.1007\/s40747-022-00889-1","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"type":"print","value":"2199-4536"},{"type":"electronic","value":"2198-6053"}],"subject":[],"published":{"date-parts":[[2022,10,27]]},"assertion":[{"value":"15 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 October 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 October 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 conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}