{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T16:02:40Z","timestamp":1775145760017,"version":"3.50.1"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,7,18]],"date-time":"2023-07-18T00:00:00Z","timestamp":1689638400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,7,18]],"date-time":"2023-07-18T00:00:00Z","timestamp":1689638400000},"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":["62001500"],"award-info":[{"award-number":["62001500"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62071480"],"award-info":[{"award-number":["62071480"]}],"id":[{"id":"10.13039\/501100001809","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":[[2024,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>To deal with the inconsistency of the distribution of reference vectors (RVs) and the shape of Pareto front in decomposition-based multiobjective evolutionary algorithms, many literatures proposed to adjust RVs in evolutionary process. However, most of the existing algorithms adjust RVs either in each generation or at a fixed frequency, not considering the evolving information of the population. To tackle this issue, we propose a many-objective evolutionary algorithm with metric-based reference vector adjustment named MBRA. To adjust RVs periodically and conditionally, we use the improvement rate of convergence degree of subproblems computed through<jats:italic>d<\/jats:italic><jats:sub>1<\/jats:sub>distance to reflect the whole convergence of the population. Only when the subproblems are considered convergent on the whole, are RVs allowed to be adjusted: delete the invalid RVs associated with no solutions and add new ones using the farthest solution in the subregion of the most crowded RVs for diversity. Besides, in mating selection and environmental selection, we adopt the sum of objectives and fitness-based sorting based on<jats:inline-formula><jats:alternatives><jats:tex-math>$$I_{\\varepsilon + }$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:msub><mml:mi>I<\/mml:mi><mml:mrow><mml:mi>\u03b5<\/mml:mi><mml:mo>+<\/mml:mo><\/mml:mrow><\/mml:msub><\/mml:math><\/jats:alternatives><\/jats:inline-formula>as the secondary principles to promote convergence, respectively. Validated through extensive experiments, MBRA is effective and competitive on many-objective optimization problems, especially for problems with irregular Pareto fronts.<\/jats:p>","DOI":"10.1007\/s40747-023-01161-w","type":"journal-article","created":{"date-parts":[[2023,7,18]],"date-time":"2023-07-18T08:02:23Z","timestamp":1689667343000},"page":"207-231","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A many-objective evolutionary algorithm with metric-based reference vector adjustment"],"prefix":"10.1007","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3290-9318","authenticated-orcid":false,"given":"Xujian","family":"Wang","sequence":"first","affiliation":[]},{"given":"Fenggan","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Minli","family":"Yao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,18]]},"reference":[{"key":"1161_CR1","doi-asserted-by":"crossref","unstructured":"Shim VA, Tan KC, Cheong CY (2012) A hybrid estimation of distribution algorithm with decomposition for solving the multiobjective multiple traveling salesman problem. IEEE Trans Syst Man Cybern C Appl Rev 42(5):682\u2013691","DOI":"10.1109\/TSMCC.2012.2188285"},{"issue":"2","key":"1161_CR2","doi-asserted-by":"crossref","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 Topics Comput Intell 1(2):97\u2013111","journal-title":"IEEE Trans Emerg Topics Comput Intell"},{"key":"1161_CR3","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.knosys.2017.08.006","volume":"135","author":"X Ye","year":"2017","unstructured":"Ye X, Liu S, Yin Y, Jin Y (2017) User-oriented many-objective cloud work-flow scheduling based on an improved knee point driven evolutionary algorithm. Knowledge-Based Syst 135:113\u2013124","journal-title":"Knowledge-Based Syst"},{"issue":"2","key":"1161_CR4","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1109\/TCYB.2018.2871673","volume":"50","author":"X Zhang","year":"2020","unstructured":"Zhang X, Zhou K, Pan H, Zhang L, Zeng X, Jin Y (2020) A network reduction-based multiobjective evolutionary algorithm for community detection in large-scale complex networks. IEEE Trans Cybern 50(2):703\u2013716","journal-title":"IEEE Trans Cybern"},{"issue":"1","key":"1161_CR5","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, Li H, Zhao S, Suganthan PN, Zhang Q (2011) Multiobjective evolutionary algorithms: A survey of the state of the art. Swarm Evol Comput 1(1):32\u201349","journal-title":"Swarm Evol Comput"},{"key":"1161_CR6","doi-asserted-by":"crossref","unstructured":"K. Hussain, M. N. Mohd Salleh, S. Cheng, Y. Shi, Metaheuristic research: A comprehensive survey, Artif. Intell. Rev. 52 (2019) 2191\u20132233.","DOI":"10.1007\/s10462-017-9605-z"},{"issue":"1","key":"1161_CR7","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):1\u201335","journal-title":"ACM Comput Surv"},{"issue":"3","key":"1161_CR8","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1162\/106365602760234108","volume":"10","author":"M Laumanns","year":"2002","unstructured":"Laumanns M, Thiele L, Deb K, Zitzler E (2002) Combining convergence and diversity in evolutionary multiobjective optimization. Evol Comput 10(3):263\u2013282","journal-title":"Evol Comput"},{"issue":"1","key":"1161_CR9","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1109\/TEVC.2006.876362","volume":"11","author":"FD Pierro","year":"2007","unstructured":"Pierro FD, Khu ST, Savic DA (2007) An investigation on preference order ranking scheme for multiobjective evolutionary optimization. IEEE Trans Evol Comput 11(1):17\u201345","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"1161_CR10","volume":"90","author":"J Zou","year":"2020","unstructured":"Zou J, Yang Q, Yang S, Zheng J (2020) Ra-dominance: a new dominance relationship for preference-based evolutionary multiobjective optimization. Appl Soft Comput 90(1):106192","journal-title":"Appl Soft Comput"},{"key":"1161_CR11","doi-asserted-by":"crossref","unstructured":"Zou X, Chen Y, Liu M, Kang L (2008) A new evolutionary algorithm for solving many-objective optimization problems. IEEE Trans Syst Man Cybern B Cybern 38(5):1402\u20131412","DOI":"10.1109\/TSMCB.2008.926329"},{"issue":"2","key":"1161_CR12","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1109\/TEVC.2013.2258025","volume":"18","author":"Z He","year":"2014","unstructured":"He Z, Yen GG, Zhang J (2014) Fuzzy-based pareto optimality for many-objective evolutionary algorithms. IEEE Trans Evol Comput 18(2):269\u2013285","journal-title":"IEEE Trans Evol Comput"},{"key":"1161_CR13","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1016\/j.swevo.2018.11.003","volume":"44","author":"SS Das","year":"2019","unstructured":"Das SS, Islam MM, Arafat NA (2019) Evolutionary algorithm using adaptive fuzzy dominance and reference point for many-objective optimization, Swarm. Evol Comput 44:1092\u20131107","journal-title":"Evol Comput"},{"issue":"5","key":"1161_CR14","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1109\/TEVC.2012.2227145","volume":"17","author":"S Yang","year":"2013","unstructured":"Yang S, Li M, Liu X, Zheng J (2013) A grid-based evolutionary algorithm for many-objective optimization. IEEE Trans Evol Comput 17(5):721\u2013736","journal-title":"IEEE Trans Evol Comput"},{"key":"1161_CR15","volume":"96","author":"L Li","year":"2020","unstructured":"Li L, Li G, Chang L (2020) A many-objective particle swarm optimization with grid dominance ranking and clustering. Appl Soft Comput 96:106661","journal-title":"Appl Soft Comput"},{"issue":"2","key":"1161_CR16","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1109\/TEVC.2015.2457245","volume":"20","author":"C Zhu","year":"2016","unstructured":"Zhu C, Xu L, Goodman ED (2016) Generalization of Pareto-optimality for many-objective evolutionary optimization. IEEE Trans Evol Comput 20(2):299\u2013315","journal-title":"IEEE Trans Evol Comput"},{"issue":"8","key":"1161_CR17","doi-asserted-by":"crossref","first-page":"7776","DOI":"10.1109\/TCYB.2021.3051078","volume":"52","author":"S Zhu","year":"2022","unstructured":"Zhu S, Xu L, Goodman ED, Lu Z (2022) A new many-objective evolutionary algorithm based on generalized pareto dominance. IEEE Trans Cybern 52(8):7776\u20137790","journal-title":"IEEE Trans Cybern"},{"issue":"3","key":"1161_CR18","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1109\/TEVC.2013.2262178","volume":"18","author":"M Li","year":"2014","unstructured":"Li M, Yang S, Liu X (2014) Shift-based density estimation for pareto-based algorithms in many-objective optimization. IEEE Trans Evol Comput 18(3):348\u2013365","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"1161_CR19","doi-asserted-by":"crossref","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":"1161_CR20","doi-asserted-by":"crossref","unstructured":"Elarbi M, Bechikh S, Gupta A, Ben Said L, Ong Y-S (2018) A new decomposition-based NSGA-II for many-objective optimization. IEEE Trans Syst Man Cybern Syst 48(7):1191\u20131210","DOI":"10.1109\/TSMC.2017.2654301"},{"issue":"2","key":"1161_CR21","doi-asserted-by":"crossref","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":"5","key":"1161_CR22","doi-asserted-by":"crossref","first-page":"3645","DOI":"10.1109\/TCYB.2020.3015998","volume":"52","author":"J Shen","year":"2022","unstructured":"Shen J, Wang P, Wang X (2022) A controlled strengthened dominance relation for evolutionary many-objective optimization. IEEE Trans Cybern 52(5):3645\u20133657","journal-title":"IEEE Trans Cybern"},{"issue":"2","key":"1161_CR23","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1109\/TEVC.2018.2791283","volume":"23","author":"Y Sun","year":"2019","unstructured":"Sun Y, Yen GG, Zhang Y (2019) IGD indicator-based evolutionary algorithm for many-objective optimization problems. IEEE Trans Evol Comput 23(2):173\u2013187","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"1161_CR24","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(1):45\u201376","journal-title":"Evol Comput"},{"key":"1161_CR25","unstructured":"R. H. G\u00f3mez, C. A. Coello Coello, Improved metaheuristic based on the R2 indicator for many-objective optimization, in Proc. Annu. Conf. Genet. Evol. Comput., Madrid, Spain, 2015, pp. 679\u2013686."},{"key":"1161_CR26","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/j.asoc.2018.02.048","volume":"67","author":"F Li","year":"2018","unstructured":"Li F, Cheng R, Liu J, Jin Y (2018) A two-stage R2 indicator based evolutionary algorithm for many-objective optimization. Appl Soft Comput 67:245\u2013260","journal-title":"Appl Soft Comput"},{"issue":"5","key":"1161_CR27","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1109\/TEVC.2015.2504730","volume":"20","author":"M Li","year":"2016","unstructured":"Li M, Yang S, Liu X (2016) Pareto or non-Pareto: Bi-criterion evolution in multiobjective optimization. IEEE Trans Evol Comput 20(5):645\u2013665","journal-title":"IEEE Trans Evol Comput"},{"key":"1161_CR28","volume":"99","author":"J Zhou","year":"2021","unstructured":"Zhou J, Yao X, Gao L, Hu C (2021) An indicator and adaptive region division based evolutionary algorithm for many-objective optimization. Appl Soft Comput 99:106872","journal-title":"Appl Soft Comput"},{"key":"1161_CR29","doi-asserted-by":"crossref","unstructured":"Y. Tian, X. Zhang, R. Cheng, Y. Jin, A multi-objective evolutionary algorithm based on an enhanced inverted generational distance metric, in Proc. IEEE Congr. Evol. Comput., Vancouver, BC, Canada, 2016.","DOI":"10.1109\/CEC.2016.7748352"},{"issue":"4","key":"1161_CR30","doi-asserted-by":"crossref","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 multi-objective 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":"1161_CR31","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1109\/TEVC.2018.2848921","volume":"23","author":"T Pamulapati","year":"2019","unstructured":"Pamulapati T, Mallipeddi R, Suganthan PN (2019) ISDE+\u2014An indicator for multi and many-objective optimization. IEEE Trans Evol Comput 23(2):346\u2013352","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"1161_CR32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3300148","volume":"52","author":"M Li","year":"2020","unstructured":"Li M, Yao X (2020) Quality evaluation of solution sets in multiobjective optimisation: a survey. ACM Comput Surv 52(2):1\u201338","journal-title":"ACM Comput Surv"},{"key":"1161_CR33","doi-asserted-by":"crossref","unstructured":"J. G. Falc\u00f3n-Cardona, C. A. Coello Coello, Indicator-based multi-objective evolutionary algorithms: A comprehensive survey, ACM Comput. Surv. 53 (2) (2020) 1\u201335.","DOI":"10.1145\/3376916"},{"issue":"6","key":"1161_CR34","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(6):712\u2013731","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"1161_CR35","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1109\/TEVC.2013.2281533","volume":"18","author":"H Liu","year":"2014","unstructured":"Liu H, Gu F, Zhang Q (2014) Decomposition of a multiobjective optimization problem into a number of simple multiobjective subproblems. IEEE Trans Evol Comput 18(3):450\u2013455","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"1161_CR36","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1109\/TEVC.2017.2725902","volume":"22","author":"H Liu","year":"2018","unstructured":"Liu H, Chen L, Zhang Q, Deb K (2018) Adaptively allocating search effort in challenging many-objective optimization problems. IEEE Trans Evol Comput 22(3):433\u2013448","journal-title":"IEEE Trans Evol Comput"},{"key":"1161_CR37","doi-asserted-by":"crossref","unstructured":". Qi, X. Ma, L. Fang, L. Jiao, J. Sun, J, Wu, MOEA\/D with adaptive weight adjustment, Evol. Comput. 22 (2) (2014) 231-264","DOI":"10.1162\/EVCO_a_00109"},{"issue":"2","key":"1161_CR38","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 optimization. Evol Comput 28(2):227\u2013253","journal-title":"Evol Comput"},{"issue":"3","key":"1161_CR39","doi-asserted-by":"crossref","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":"4","key":"1161_CR40","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(4):577\u2013601","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"1161_CR41","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1109\/TEVC.2016.2592479","volume":"21","author":"S Jiang","year":"2017","unstructured":"Jiang S, Yang S (2017) A strength Pareto evolutionary algorithm based on reference direction for multiobjective and many-objective optimization. IEEE Trans Evol Comput 21(3):329\u2013346","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"1161_CR42","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1109\/TEVC.2002.802873","volume":"6","author":"A Jaszkiewicz","year":"2002","unstructured":"Jaszkiewicz A (2002) On the performance of multiple-objective genetic local search on the 0\/1 knapsack problem\u2014a comparative experiment. IEEE Trans Evol Comput 6(4):402\u2013412","journal-title":"IEEE Trans Evol Comput"},{"issue":"6","key":"1161_CR43","doi-asserted-by":"crossref","first-page":"1648","DOI":"10.1016\/j.cor.2012.01.001","volume":"40","author":"Y Tan","year":"2013","unstructured":"Tan Y, Jiao Y, Li H, Wang X (2013) MOEA\/D + uniform design: a new version of MOEA\/D for optimization problems with many objectives. Comput Oper Res 40(6):1648\u20131660","journal-title":"Comput Oper Res"},{"key":"1161_CR44","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.swevo.2017.01.002","volume":"34","author":"Z Wang","year":"2017","unstructured":"Wang Z, Zhang Q, Li H, Ishibuchi H, Jiao L (2017) On the use of two reference points in decomposition based multiobjective evolutionary algorithms, Swarm. Evol Comput 34:89\u2013102","journal-title":"Evol Comput"},{"issue":"2","key":"1161_CR45","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1109\/TEVC.2016.2587749","volume":"21","author":"H Ishibuchi","year":"2017","unstructured":"Ishibuchi H, Setoguchi Y, Masuda H, Nojima Y (2017) Performance of decomposition-based many-objective algorithms strongly depends on pareto front shapes. IEEE Trans Evol Comput 21(2):169\u2013190","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"1161_CR46","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1109\/TEVC.2020.2978158","volume":"24","author":"X Ma","year":"2020","unstructured":"Ma X, Yu Y, Li X, Qi Y, Zhu Z (2020) A survey of weight vector adjustment methods for decomposition-based multiobjective evolutionary algorithms. IEEE Trans Evol Comput 24(4):634\u2013649","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"1161_CR47","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1109\/TEVC.2013.2281534","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 II: Handling constraints and extending to an adaptive approach. IEEE Trans Evol Comput 18(4):602\u2013622","journal-title":"IEEE Trans Evol Comput"},{"key":"1161_CR48","doi-asserted-by":"crossref","unstructured":"Q. Liu, Y. Jin, M. Heiderich, T. Rodemann, Adaptation of reference vectors for evolutionary many-objective optimization of problems with irregular pareto fronts, in Proc. IEEE Cong. Evol. Comput., Wellington, New Zealand, 2019, pp. 1726\u20131733.","DOI":"10.1109\/CEC.2019.8790214"},{"issue":"5","key":"1161_CR49","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(5):773\u2013791","journal-title":"IEEE Trans Evol Comput"},{"issue":"8","key":"1161_CR50","doi-asserted-by":"crossref","first-page":"2321","DOI":"10.1109\/TCYB.2017.2737519","volume":"48","author":"M Asafuddoula","year":"2017","unstructured":"Asafuddoula M, Singh HK, Ray T (2017) An enhanced decomposition-based evolutionary algorithm with adaptive reference vectors. IEEE Trans Cybern 48(8):2321\u20132334","journal-title":"IEEE Trans Cybern"},{"issue":"3","key":"1161_CR51","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1109\/TEVC.2018.2865931","volume":"23","author":"M Wu","year":"2018","unstructured":"Wu M, Li K, Kwong S, Zhang Q, Zhang J (2018) Learning to decompose: a paradigm for decomposition-based multiobjective optimization. IEEE Trans Evol Comput 23(3):376\u2013390","journal-title":"IEEE Trans Evol Comput"},{"key":"1161_CR52","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2020.100644","volume":"54","author":"M Luque","year":"2020","unstructured":"Luque M, Gallardo SG, Saborido R, Ruiz AB (2020) Adaptive global wasf-ga to handle many-objective optimization problems. Swarm Evol Comput 54:100644","journal-title":"Swarm Evol Comput"},{"issue":"2","key":"1161_CR53","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1109\/TEVC.2017.2695579","volume":"22","author":"F Gu","year":"2017","unstructured":"Gu F, Cheung YM (2017) Self-organizing map-based weight design for decomposition-based many-objective evolutionary algorithm. IEEE Trans Evol Comput 22(2):211\u2013225","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"1161_CR54","first-page":"439","volume":"24","author":"Y Liu","year":"2020","unstructured":"Liu Y, Ishibuchi H, Masuyama N, Nojima Y (2020) Adapting reference vectors and scalarizing functions by growing neural gas to handle irregular pareto fronts. IEEE Trans Evol Comput 24(3):439\u2013453","journal-title":"IEEE Trans Evol Comput"},{"issue":"5","key":"1161_CR55","doi-asserted-by":"crossref","first-page":"2698","DOI":"10.1109\/TCYB.2020.3020630","volume":"52","author":"Q Liu","year":"2022","unstructured":"Liu Q, Jin Y, Heiderich M, Rodemann T, Yu G (2022) An adaptive reference vector-guided evolutionary algorithm using growing neural gas for many-objective optimization of irregular problems. IEEE Trans Cybern 52(5):2698\u20132711","journal-title":"IEEE Trans Cybern"},{"key":"1161_CR56","doi-asserted-by":"crossref","unstructured":"R. Denysiuk, L. Costa, I. E. Santo, Clustering-based selection for evolutionary many-objective optimization, in Proc. Int. Conf. Parallel Probl. Solving Nat., 2014, pp. 538\u2013547.","DOI":"10.1007\/978-3-319-10762-2_53"},{"issue":"7","key":"1161_CR57","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(7):2758\u20132770","journal-title":"IEEE Trans Cybern"},{"issue":"4","key":"1161_CR58","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 plat-form for evolutionary multi-objective optimization. IEEE Comput Intell Mag 12(4):73\u201387","journal-title":"IEEE Comput Intell Mag"},{"issue":"1","key":"1161_CR59","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1109\/TEVC.2019.2909636","volume":"24","author":"Y Xiang","year":"2020","unstructured":"Xiang Y, Zhou Y, Yang X, Huang H (2020) A many-objective evolutionary algorithm with pareto-adaptive reference points. IEEE Trans Evol Comput 24(1):99\u2013113","journal-title":"IEEE Trans Evol Comput"},{"issue":"7","key":"1161_CR60","doi-asserted-by":"crossref","first-page":"3429","DOI":"10.1109\/TCYB.2020.2965230","volume":"51","author":"H Xu","year":"2021","unstructured":"Xu H, Zeng W, Zeng X, Yen GG (2021) A polar-metric-based evolutionary algorithm. IEEE Trans Cybern 51(7):3429\u20133440","journal-title":"IEEE Trans Cybern"},{"key":"1161_CR61","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1016\/j.asoc.2016.11.009","volume":"50","author":"Y Liu","year":"2017","unstructured":"Liu Y, Gong D, Sun X, Zhang Y (2017) Many-objective evolutionary optimization based on reference points. Appl Soft Comput 50:344\u2013355","journal-title":"Appl Soft Comput"},{"issue":"5","key":"1161_CR62","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1109\/TEVC.2018.2882166","volume":"23","author":"Y Sun","year":"2019","unstructured":"Sun Y, Xue B, Zhang M, Yen GG (2019) A new two-stage evolutionary algorithm for many-objective optimization. IEEE Trans Evol Comput 23(5):748\u2013761","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-023-01161-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-023-01161-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-023-01161-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,24]],"date-time":"2024-10-24T10:16:18Z","timestamp":1729764978000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-023-01161-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,18]]},"references-count":62,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["1161"],"URL":"https:\/\/doi.org\/10.1007\/s40747-023-01161-w","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,18]]},"assertion":[{"value":"9 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 June 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2023","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 there is no conflict of interest in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This paper 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"}}]}}