{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T04:02:46Z","timestamp":1776744166057,"version":"3.51.2"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,2,22]],"date-time":"2024-02-22T00:00:00Z","timestamp":1708560000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,2,22]],"date-time":"2024-02-22T00:00:00Z","timestamp":1708560000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2024,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Most existing multi-objective evolutionary algorithms relying on fixed reference vectors originating from an ideal or a nadir point may fail to perform well on multi- and many-objective optimization problems with various convexity or shapes of Pareto fronts. A possible reason could be the inaccurate measurement of the diversity of solutions or the failure of the fixed reference vectors in guiding the rapidly changing population. To meet this challenge, this work develops an adaptive normal reference vector-based decomposition strategy for guiding the search process, which is able to handle various convexity and shapes of Pareto fronts. Specifically, the normal vector passing through the center of each cluster in a constructed hyperplane is adopted as the reference vector for guiding the search process. Then, a selection strategy is put forward based on the positions of solutions in the current population and the normal vectors for the environmental selection. Based on the adaptive normal vectors, the proposed algorithm can not only rapidly adapt to the changing population but also alleviate the influence of the convexity of Pareto fronts on the measurement of diversity. Experimental results show that the proposed algorithm performs consistently well on various types of multi-\/many-objective problems having regular or irregular Pareto fronts. In addition, the proposed algorithm is shown to perform well in the optimization of the polyester fiber esterification process.<\/jats:p>","DOI":"10.1007\/s40747-024-01353-y","type":"journal-article","created":{"date-parts":[[2024,2,22]],"date-time":"2024-02-22T09:02:50Z","timestamp":1708592570000},"page":"3709-3726","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["Adaptive normal vector guided evolutionary multi- and many-objective optimization"],"prefix":"10.1007","volume":"10","author":[{"given":"Yicun","family":"Hua","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1587-5515","authenticated-orcid":false,"given":"Qiqi","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Kuangrong","family":"Hao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,22]]},"reference":[{"key":"1353_CR1","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.swevo.2011.03.001","volume":"1","author":"A Zhou","year":"2011","unstructured":"Zhou A, Qu B-Y, Li H, Zhao S-Z, Suganthan PN, Zhang Q (2011) Multiobjective evolutionary algorithms: a survey of the state of the art. Swarm Evol Comput 1:32\u201349","journal-title":"Swarm Evol Comput"},{"key":"1353_CR2","doi-asserted-by":"crossref","first-page":"1199","DOI":"10.1109\/JAS.2020.1003539","volume":"8","author":"Z Zhao","year":"2021","unstructured":"Zhao Z, Liu S, Zhou M, Abusorrah A (2021) Dual-objective mixed integer linear program and memetic algorithm for an industrial group scheduling problem. IEEE\/CAA J Autom Sin 8:1199\u20131209","journal-title":"IEEE\/CAA J Autom Sin"},{"key":"1353_CR3","first-page":"707","volume":"58","author":"C von L\u00fccken","year":"2014","unstructured":"von L\u00fccken C, Bar\u00e1n B, Brizuela C (2014) A survey on multi-objective evolutionary algorithms for many-objective problems. Comput Optim Appl 58:707\u2013756","journal-title":"Comput Optim Appl"},{"key":"1353_CR4","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1109\/JAS.2021.1003817","volume":"8","author":"Y Hua","year":"2021","unstructured":"Hua Y, Liu Q, Hao K, Jin Y (2021) A survey of evolutionary algorithms for multi-objective optimization problems with irregular pareto fronts. IEEE\/CAA J Automat Sin 8:303\u2013318","journal-title":"IEEE\/CAA J Automat Sin"},{"key":"1353_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2792984","volume":"48","author":"B Li","year":"2015","unstructured":"Li B, Li J, Tang K, Yao X (2015) Many-objective evolutionary algorithms: a survey. ACM Comput Surv 48:1\u201335","journal-title":"ACM Comput Surv"},{"key":"1353_CR6","doi-asserted-by":"crossref","first-page":"6222","DOI":"10.1109\/TSMC.2022.3143657","volume":"52","author":"F Ming","year":"2022","unstructured":"Ming F, Gong W, Wang L (2022) A two-stage evolutionary algorithm with balanced convergence and diversity for many-objective optimization. IEEE Trans Syst Man Cybern Syst 52:6222\u20136234","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"1353_CR7","doi-asserted-by":"crossref","first-page":"4129","DOI":"10.1109\/TCYB.2018.2859171","volume":"49","author":"L Chen","year":"2019","unstructured":"Chen L, Liu H-L, Tan KC, Cheung Y-M, Wang Y (2019) Evolutionary many-objective algorithm using decomposition-based dominance relationship. IEEE Trans Cybern 49:4129\u20134139","journal-title":"IEEE Trans Cybern"},{"key":"1353_CR8","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1109\/TCYB.2013.2247594","volume":"44","author":"H Wang","year":"2014","unstructured":"Wang H, Yao X (2014) Corner sort for pareto-based many-objective optimization. IEEE Trans Cybern 44:92\u2013102","journal-title":"IEEE Trans Cybern"},{"key":"1353_CR9","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:712\u2013731","journal-title":"IEEE Trans Evol Comput"},{"key":"1353_CR10","doi-asserted-by":"crossref","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 Evol Comput 18:577\u2013601","journal-title":"IEEE Trans Evol Comput"},{"key":"1353_CR11","doi-asserted-by":"crossref","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:773\u2013791","journal-title":"IEEE Trans Evol Comput"},{"key":"1353_CR12","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2019.105731","volume":"84","author":"S Jiang","year":"2019","unstructured":"Jiang S, He X, Zhou Y (2019) Many-objective evolutionary algorithm based on adaptive weighted decomposition. Appl Soft Comput 84:105731","journal-title":"Appl Soft Comput"},{"key":"1353_CR13","volume":"55","author":"J Li","year":"2020","unstructured":"Li J, Chen G, Li M, Chen H (2020) An enhanced-indicator based many-objective evolutionary algorithm with adaptive reference point. Swarm Evol Comput 55:100669","journal-title":"Swarm Evol Comput"},{"key":"1353_CR14","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/j.ins.2019.02.054","volume":"509","author":"W Tang","year":"2020","unstructured":"Tang W, Liu H-L, Chen L, Tan KC, Cheung YM (2020) Fast hypervolume approximation scheme based on a segmentation strategy. Inf Sci 509:320\u2013342","journal-title":"Inf Sci"},{"key":"1353_CR15","doi-asserted-by":"crossref","first-page":"26194","DOI":"10.1109\/ACCESS.2018.2832181","volume":"6","author":"K Li","year":"2018","unstructured":"Li K, Wang R, Zhang T, Ishibuchi H (2018) Evolutionary many-objective optimization: a comparative study of the state-of-the-art. IEEE Access 6:26194\u201326214","journal-title":"IEEE Access"},{"key":"1353_CR16","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1109\/TEVC.2013.2281534","volume":"18","author":"H Jain","year":"2014","unstructured":"Jain H, Deb K (2014) An evolutionary many-objective optimization algorithm using reference-point based nondominated sorting approach, part ii: Handling constraints and extending to an adaptive approach. IEEE Trans Evol Comput 18:602\u2013622","journal-title":"IEEE Trans Evol Comput"},{"key":"1353_CR17","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1162\/evco_a_00269","volume":"28","author":"M Li","year":"2020","unstructured":"Li M, Yao X (2020) What weights work for you? adapting weights for any pareto front shape in decomposition-based evolutionary multiobjective optimisation. Evol Comput 28:227\u2013253","journal-title":"Evol Comput"},{"key":"1353_CR18","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1109\/TEVC.2017.2749619","volume":"22","author":"Y Tian","year":"2017","unstructured":"Tian Y, Cheng R, Zhang X, Cheng F, Jin Y (2017) An indicator-based multiobjective evolutionary algorithm with reference point adaptation for better versatility. IEEE Trans Evol Comput 22:609\u2013622","journal-title":"IEEE Trans Evol Comput"},{"key":"1353_CR19","volume":"231","author":"J Zou","year":"2021","unstructured":"Zou J, Zhang Z, Zheng J, Yang S (2021) A many-objective evolutionary algorithm based on dominance and decomposition with reference point adaptation. Knowl-Based Syst 231:107392","journal-title":"Knowl-Based Syst"},{"key":"1353_CR20","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1109\/TSMC.2022.3187370","volume":"53","author":"Q Liu","year":"2023","unstructured":"Liu Q, Jin Y, Heiderich M, Rodemann T (2023) Coordinated adaptation of reference vectors and scalarizing functions in evolutionary many-objective optimization. IEEE Trans Syst Man Cybern Syst 53:763\u2013775","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"1353_CR21","first-page":"439","volume":"24","author":"Y Liu","year":"2019","unstructured":"Liu Y, Ishibuchi H, Masuyama N, Nojima Y (2019) Adapting reference vectors and scalarizing functions by growing neural gas to handle irregular Pareto fronts. IEEE Trans Evol Comput 24:439\u2013453","journal-title":"IEEE Trans Evol Comput"},{"key":"1353_CR22","doi-asserted-by":"crossref","first-page":"2698","DOI":"10.1109\/TCYB.2020.3020630","volume":"52","author":"Q Liu","year":"2020","unstructured":"Liu Q, Jin Y, Heiderich M, Rodemann T, Yu G (2020) An adaptive reference vector-guided evolutionary algorithm using growing neural gas for many-objective optimization of irregular problems. IEEE Trans Cybern 52:2698\u20132711","journal-title":"IEEE Trans Cybern"},{"key":"1353_CR23","volume":"78","author":"R Hong","year":"2023","unstructured":"Hong R, Yao F, Liao T, Xing L, Cai Z, Hou F (2023) Growing neural gas assisted evolutionary many-objective optimization for handling irregular Pareto fronts. Swarm Evol Comput 78:101273","journal-title":"Swarm Evol Comput"},{"key":"1353_CR24","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/j.ins.2018.07.012","volume":"465","author":"C Zhou","year":"2018","unstructured":"Zhou C, Dai G, Zhang C, Li X, Ma K (2018) Entropy based evolutionary algorithm with adaptive reference points for many-objective optimization problems. Inf Sci 465:232\u2013247","journal-title":"Inf Sci"},{"key":"1353_CR25","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2021.100980","volume":"68","author":"LR de Farias","year":"2022","unstructured":"de Farias LR, Ara\u00fajo AF (2022) A decomposition-based many-objective evolutionary algorithm updating weights when required. Swarm Evol Comput 68:100980","journal-title":"Swarm Evol Comput"},{"key":"1353_CR26","doi-asserted-by":"crossref","first-page":"2758","DOI":"10.1109\/TCYB.2018.2834466","volume":"49","author":"Y Hua","year":"2019","unstructured":"Hua Y, Jin Y, Hao K (2019) A clustering-based adaptive evolutionary algorithm for multiobjective optimization with irregular pareto fronts. IEEE Trans Cybern 49:2758\u20132770","journal-title":"IEEE Trans Cybern"},{"key":"1353_CR27","doi-asserted-by":"crossref","first-page":"1164","DOI":"10.1109\/TCYB.2020.2971638","volume":"52","author":"S Liu","year":"2020","unstructured":"Liu S, Lin Q, Wong K-C, Coello CAC, Li J, Ming Z, Zhang J (2020) A self-guided reference vector strategy for many-objective optimization. IEEE Trans Cybern 52:1164\u20131178","journal-title":"IEEE Trans Cybern"},{"key":"1353_CR28","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/j.ins.2020.03.104","volume":"537","author":"S Liu","year":"2020","unstructured":"Liu S, Yu Q, Lin Q, Tan KC (2020) An adaptive clustering-based evolutionary algorithm for many-objective optimization problems. Inf Sci 537:261\u2013283","journal-title":"Inf Sci"},{"key":"1353_CR29","doi-asserted-by":"publisher","unstructured":"Sato H, Nakagawa S, Miyakawa M, Takadama K (2016) Enhanced decomposition-based many-objective optimization using supplemental weight vectors. In: IEEE Congress on Evolutionary Computation (CEC) 2016, p. 1626\u20131633. https:\/\/doi.org\/10.1109\/CEC.2016.7743983","DOI":"10.1109\/CEC.2016.7743983"},{"key":"1353_CR30","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1109\/TCYB.2018.2872803","volume":"50","author":"M Wu","year":"2020","unstructured":"Wu M, Li K, Kwong S, Zhang Q (2020) Evolutionary many-objective optimization based on adversarial decomposition. IEEE Trans Cybern 50:753\u2013764","journal-title":"IEEE Trans Cybern"},{"key":"1353_CR31","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1007\/s11047-017-9633-2","volume":"17","author":"X Bi","year":"2018","unstructured":"Bi X, Wang C (2018) A many-objective evolutionary algorithm based on hyperplane projection and penalty distance selection. Nat Comput 17:877\u2013899","journal-title":"Nat Comput"},{"key":"1353_CR32","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1109\/TEVC.2019.2958921","volume":"24","author":"M Elarbi","year":"2020","unstructured":"Elarbi M, Bechikh S, Coello Coello CA, Makhlouf M, Said LB (2020) Approximating complex pareto fronts with predefined normal-boundary intersection directions. IEEE Trans Evol Comput 24:809\u2013823","journal-title":"IEEE Trans Evol Comput"},{"key":"1353_CR33","first-page":"115","volume":"9","author":"K Deb","year":"1995","unstructured":"Deb K, Agrawal RB (1995) Simulated binary crossover for continuous search space. Complex Syst 9:115\u2013148","journal-title":"Complex Syst"},{"key":"1353_CR34","first-page":"30","volume":"26","author":"K Deb","year":"1996","unstructured":"Deb K, Goyal M (1996) A combined genetic adaptive search (geneas) for engineering design. Comput Sci Inform 26:30\u201345","journal-title":"Comput Sci Inform"},{"key":"1353_CR35","doi-asserted-by":"crossref","first-page":"1001","DOI":"10.3934\/jimo.2020009","volume":"17","author":"Q Long","year":"2021","unstructured":"Long Q, Wu X, Wu C (2021) Non-dominated sorting methods for multi-objective optimization: review and numerical comparison. J Ind Manag Optim 17:1001\u20131023","journal-title":"J Ind Manag Optim"},{"key":"1353_CR36","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/s00357-014-9161-z","volume":"31","author":"F Murtagh","year":"2014","unstructured":"Murtagh F, Legendre P (2014) Ward\u2019s hierarchical agglomerative clustering method: which algorithms implement ward\u2019s criterion? J Classif 31:274\u2013295","journal-title":"J Classif"},{"key":"1353_CR37","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1109\/MCI.2017.2742868","volume":"12","author":"Y Tian","year":"2017","unstructured":"Tian Y, Cheng R, Zhang X, Jin Y (2017) Platemo: a matlab platform for evolutionary multi-objective optimization [educational forum]. IEEE Comput Intell Mag 12:73\u201387","journal-title":"IEEE Comput Intell Mag"},{"key":"1353_CR38","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/1-84628-137-7_6","volume-title":"Scalable test problems for evolutionary multiobjective optimization","author":"K Deb","year":"2005","unstructured":"Deb K, Thiele L, Laumanns M, Zitzler E (2005) Scalable test problems for evolutionary multiobjective optimization. Springer, London, pp 105\u2013145"},{"key":"1353_CR39","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/978-3-540-31880-4_20","volume-title":"Evolutionary multi-criterion optimization","author":"S Huband","year":"2005","unstructured":"Huband S, Barone L, While L, Hingston P (2005) A scalable multi-objective test problem toolkit. In: Coello Coello CA, Hern\u00e1ndez Aguirre A, Zitzler E (eds) Evolutionary multi-criterion optimization. Springer, Berlin, pp 280\u2013295"},{"key":"1353_CR40","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1109\/MCI.2019.2919398","volume":"14","author":"Y Tian","year":"2019","unstructured":"Tian Y, Cheng R, Zhang X, Li M, Jin Y (2019) Diversity assessment of multi-objective evolutionary algorithms: performance metric and benchmark problems [research frontier]. IEEE Comput Intell Mag 14:61\u201374","journal-title":"IEEE Comput Intell Mag"},{"key":"1353_CR41","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s40747-017-0039-7","volume":"3","author":"C Ran","year":"2017","unstructured":"Ran C, Li M, Ye T, Zhang X, Yang S (2017) A benchmark test suite for evolutionary many-objective optimization. Complex Intell Syst 3:67\u201381","journal-title":"Complex Intell Syst"},{"key":"1353_CR42","unstructured":"Zhen L, Li M, Ran C, Peng D, Xin Y (2018) Multiobjective test problems with degenerate pareto fronts 1\u201320"},{"key":"1353_CR43","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1109\/TEVC.2016.2587808","volume":"21","author":"Y Xiang","year":"2017","unstructured":"Xiang Y, Zhou Y, Li M, Chen Z (2017) A vector angle-based evolutionary algorithm for unconstrained many-objective optimization. IEEE Trans Evol Comput 21:131\u2013152","journal-title":"IEEE Trans Evol Comput"},{"key":"1353_CR44","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1109\/TEVC.2014.2378512","volume":"19","author":"X Zhang","year":"2015","unstructured":"Zhang X, Tian Y, Jin Y (2015) A knee point-driven evolutionary algorithm for many-objective optimization. IEEE Trans Evol Comput 19:761\u2013776","journal-title":"IEEE Trans Evol Comput"},{"key":"1353_CR45","doi-asserted-by":"crossref","unstructured":"Ishibuchi H, Masuda H, Tanigaki Y, Nojima Y (2015) Modified distance calculation in generational distance and inverted generational distance. In: International Conference on Evolutionary Multi-criterion optimization, Springer, pp. 110\u2013125","DOI":"10.1007\/978-3-319-15892-1_8"},{"key":"1353_CR46","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/TEVC.2005.851275","volume":"10","author":"L While","year":"2006","unstructured":"While L, Hingston P, Barone L, Huband S (2006) A faster algorithm for calculating hypervolume. IEEE Trans Evol Comput 10:29\u201338","journal-title":"IEEE Trans Evol Comput"},{"key":"1353_CR47","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1109\/TCYB.2014.2334632","volume":"45","author":"PC Roy","year":"2015","unstructured":"Roy PC, Islam MM, Murase K, Yao X (2015) Evolutionary path control strategy for solving many-objective optimization problem. IEEE Trans Cybern 45:702\u2013715","journal-title":"IEEE Trans Cybern"},{"key":"1353_CR48","doi-asserted-by":"crossref","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:631\u2013657","DOI":"10.1137\/S1052623496307510"},{"key":"1353_CR49","doi-asserted-by":"crossref","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 Evol Comput 19:524\u2013541","journal-title":"IEEE Trans Evol Comput"},{"key":"1353_CR50","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s00500-008-0323-y","volume":"13","author":"J Alcal\u00e1-Fdez","year":"2009","unstructured":"Alcal\u00e1-Fdez J, Sanchez L, Garcia S, del Jesus MJ, Ventura S, Garrell JM, Otero J, Romero C, Bacardit J, Rivas VM et al (2009) KEEL: a software tool to assess evolutionary algorithms for data mining problems. Soft Comput 13:307\u2013318","journal-title":"Soft Comput"},{"key":"1353_CR51","unstructured":"Zhu X, Hao K, Tang X, Wang T, Hua Y, Liu X (2019) The multi-objective optimization of esterification process based on improved nsga-iii algorithm. In: 2019 12th Asian Control Conference (ASCC), pp. 603\u2013608"},{"key":"1353_CR52","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1162\/EVCO_a_00009","volume":"19","author":"J Bader","year":"2011","unstructured":"Bader J, Zitzler E (2011) Hype: an algorithm for fast hypervolume-based many-objective optimization. Evol Comput 19:45\u201376","journal-title":"Evol Comput"},{"key":"1353_CR53","doi-asserted-by":"publisher","unstructured":"Ishibuchi H, Imada R, Setoguchi Y, Nojima Y (2017) Reference point specification in hypervolume calculation for fair comparison and efficient search. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO \u201917, Association for Computing Machinery, New York, NY, USA, p. 585\u2013592. https:\/\/doi.org\/10.1145\/3071178.3071264","DOI":"10.1145\/3071178.3071264"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-024-01353-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-024-01353-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-024-01353-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,16]],"date-time":"2024-05-16T18:17:10Z","timestamp":1715883430000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-024-01353-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,22]]},"references-count":53,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["1353"],"URL":"https:\/\/doi.org\/10.1007\/s40747-024-01353-y","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,22]]},"assertion":[{"value":"4 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2024","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 known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper. The authors declare the following financial interests\/personal relationships which may be considered as potential competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}