{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T21:07:04Z","timestamp":1761599224553,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,9,22]],"date-time":"2021-09-22T00:00:00Z","timestamp":1632268800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,9,22]],"date-time":"2021-09-22T00:00:00Z","timestamp":1632268800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"National Key Research and Development Project","award":["2018AAA0101301"],"award-info":[{"award-number":["2018AAA0101301"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61876163"],"award-info":[{"award-number":["61876163"]}],"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":[[2023,4]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>It has been acknowledged that dominance-resistant solutions (DRSs) extensively exist in the feasible region of multi-objective optimization problems. Recent studies show that DRSs can cause serious performance degradation of many multi-objective evolutionary algorithms (MOEAs). Thereafter, various strategies (e.g., the <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\epsilon $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03f5<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-dominance and the modified objective calculation) to eliminate DRSs have been proposed. However, these strategies may in turn cause algorithm inefficiency in other aspects. We argue that these coping strategies prevent the algorithm from obtaining some boundary solutions of an extremely convex Pareto front (ECPF). That is, there is a dilemma between eliminating DRSs and preserving boundary solutions of the ECPF. To illustrate such a dilemma, we propose a new multi-objective optimization test problem with the ECPF as well as DRSs. Using this test problem, we investigate the performance of six representative MOEAs in terms of boundary solutions preservation and DRS elimination. The results reveal that it is quite challenging to distinguish between DRSs and boundary solutions of the ECPF.<\/jats:p>","DOI":"10.1007\/s40747-021-00543-2","type":"journal-article","created":{"date-parts":[[2021,9,23]],"date-time":"2021-09-23T03:40:44Z","timestamp":1632368444000},"page":"1117-1126","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["The dilemma between eliminating dominance-resistant solutions and preserving boundary solutions of extremely convex Pareto fronts"],"prefix":"10.1007","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1152-6780","authenticated-orcid":false,"given":"Zhenkun","family":"Wang","sequence":"first","affiliation":[]},{"given":"Qingyan","family":"Li","sequence":"additional","affiliation":[]},{"given":"Qite","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Hisao","family":"Ishibuchi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,22]]},"reference":[{"issue":"2","key":"543_CR1","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1162\/106365600568202","volume":"8","author":"E Zitzler","year":"2000","unstructured":"Zitzler E, Deb K, Thiele L (2000) Comparison of multiobjective evolutionary algorithms: empirical results. Evol Comput 8(2):173\u2013195","journal-title":"Evol Comput"},{"key":"543_CR2","doi-asserted-by":"crossref","unstructured":"Deb K, Thiele L, Laumanns M, Zitzler E (2005) Scalable test problems for evolutionary multiobjective optimization. In: Evolutionary multiobjective optimization. Springer, Berlin, pp\u00a0105\u2013145","DOI":"10.1007\/1-84628-137-7_6"},{"key":"543_CR3","doi-asserted-by":"crossref","unstructured":"Huband S, Barone L, While L, Hingston P (2005) A scalable multi-objective test problem toolkit. In: International conference on evolutionary multi-criterion optimization (EMO). Springer, Berlin, pp\u00a0280\u2013295","DOI":"10.1007\/978-3-540-31880-4_20"},{"issue":"2","key":"543_CR4","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"},{"key":"543_CR5","unstructured":"Zitzler E, Laumanns M, Thiele L (2001) SPEA2: improving the strength Pareto evolutionary algorithm. TIK-report, vol\u00a0103"},{"key":"543_CR6","doi-asserted-by":"crossref","unstructured":"Knowles J, Corne D (1999) The Pareto archived evolution strategy: a new baseline algorithm for Pareto multiobjective optimisation. In: IEEE conference on evolutionary computation (CEC), vol\u00a01. IEEE, pp\u00a098\u2013105","DOI":"10.1109\/CEC.1999.781913"},{"issue":"2","key":"543_CR7","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1109\/TEVC.2018.2844286","volume":"23","author":"Z Wang","year":"2018","unstructured":"Wang Z, Ong Y-S, Ishibuchi H (2018) On scalable multiobjective test problems with hardly dominated boundaries. IEEE Trans Evol Comput 23(2):217\u2013231","journal-title":"IEEE Trans Evol Comput"},{"key":"543_CR8","doi-asserted-by":"crossref","unstructured":"Batista LS, Campelo F, Guimar\u00e3es FG, Ram\u00edrez JA (2011) A comparison of dominance criteria in many-objective optimization problems. In: IEEE conference on evolutionary computation (CEC). IEEE, pp\u00a02359\u20132366","DOI":"10.1109\/CEC.2011.5949909"},{"issue":"1","key":"543_CR9","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/TEVC.2015.2420112","volume":"20","author":"Y Yuan","year":"2015","unstructured":"Yuan Y, Xu H, Wang B, Yao X (2015) A new dominance relation-based evolutionary algorithm for many-objective optimization. IEEE Trans Evol Comput 20(1):16\u201337","journal-title":"IEEE Trans Evol Comput"},{"key":"543_CR10","unstructured":"Le K, Landa-Silva D (2007) Obtaining better non-dominated sets using volume dominance. In: IEEE conference on evolutionary computation (CEC). IEEE, pp\u00a03119\u20133126"},{"issue":"3","key":"543_CR11","doi-asserted-by":"publisher","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"},{"key":"543_CR12","doi-asserted-by":"crossref","unstructured":"Ishibuchi H, Matsumoto T, Masuyama N, Nojima Y (2020) Effects of dominance resistant solutions on the performance of evolutionary multi-objective and many-objective algorithms. In: Proceedings of the genetic and evolutionary computation conference (GECCO). Springer, Berlin, pp\u00a0507\u2013515","DOI":"10.1145\/3377930.3390166"},{"issue":"6","key":"543_CR13","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"},{"key":"543_CR14","doi-asserted-by":"crossref","unstructured":"Giagkiozis I, Purshouse RC, Fleming PJ (2013) Generalized decomposition. In: International conference on evolutionary multi-criterion optimization (EMO). Springer, Berlin, pp\u00a0428\u2013442","DOI":"10.1007\/978-3-642-37140-0_33"},{"issue":"3","key":"543_CR15","doi-asserted-by":"publisher","first-page":"1653","DOI":"10.1016\/j.ejor.2006.08.008","volume":"181","author":"N Beume","year":"2007","unstructured":"Beume N, Naujoks B, Emmerich M (2007) SMS-EMOA: multiobjective selection based on dominated hypervolume. Eur J Oper Res 181(3):1653\u20131669","journal-title":"Eur J Oper Res"},{"key":"543_CR16","doi-asserted-by":"publisher","first-page":"190240","DOI":"10.1109\/ACCESS.2020.3032240","volume":"8","author":"LM Pang","year":"2020","unstructured":"Pang LM, Ishibuchi H, Shang K (2020) NSGA-II with simple modification works well on a wide variety of many-objective problems. IEEE Access 8:190240\u2013190250","journal-title":"IEEE Access"},{"key":"543_CR17","doi-asserted-by":"crossref","unstructured":"Wang Z, Deng J, Zhang Q, Yang Q (2021) On the parameter setting of the penalty-based boundary intersection method in MOEA\/D. In: International conference on evolutionary multi-criterion optimization (EMO), pp\u00a0413\u2013423","DOI":"10.1007\/978-3-030-72062-9_33"},{"issue":"2","key":"543_CR18","first-page":"115","volume":"9","author":"K Deb","year":"1995","unstructured":"Deb K, Agrawal RB et al (1995) Simulated binary crossover for continuous search space. Complex Syst 9(2):115\u2013148","journal-title":"Complex Syst"},{"issue":"2","key":"543_CR19","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TEVC.2003.810758","volume":"7","author":"E Zitzler","year":"2003","unstructured":"Zitzler E, Thiele L, Laumanns M, Fonseca CM, Da Fonseca VG (2003) Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans Evol Comput 7(2):117\u2013132","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"543_CR20","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/TEVC.2007.894202","volume":"12","author":"Q Zhang","year":"2008","unstructured":"Zhang Q, Zhou A, Jin Y (2008) RM-MEDA: a regularity model-based multiobjective estimation of distribution algorithm. IEEE Trans Evol Comput 12(1):41\u201363","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"543_CR21","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans Evol Comput 3(4):257\u2013271","journal-title":"IEEE Trans Evol Comput"},{"key":"543_CR22","doi-asserted-by":"publisher","first-page":"40963","DOI":"10.1109\/ACCESS.2018.2859028","volume":"6","author":"L Li","year":"2018","unstructured":"Li L, Chen H, Li J, Jing N, Emmerich M (2018) Preference-based evolutionary many-objective optimization for agile satellite mission planning. IEEE Access 6:40963\u201340978","journal-title":"IEEE Access"},{"key":"543_CR23","doi-asserted-by":"crossref","unstructured":"Zhang Y, Finkelstein A, Harman M (2008) Search based requirements optimisation: existing work and challenges. In: Proceedings of the conference on requirements engineering: foundation for software quality. Springer, Berlin, pp\u00a088\u201394","DOI":"10.1007\/978-3-540-69062-7_8"},{"issue":"4","key":"543_CR24","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1162\/evco.2007.15.4.493","volume":"15","author":"AG Hernandez-Diaz","year":"2007","unstructured":"Hernandez-Diaz AG, Santana-Quintero LV, Coello Coello CA, Molina J (2007) Pareto-adaptive $$\\varepsilon $$-dominance. Evol Comput 15(4):493\u2013517","journal-title":"Evol Comput"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-021-00543-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-021-00543-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-021-00543-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T09:18:49Z","timestamp":1681809529000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-021-00543-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,22]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["543"],"URL":"https:\/\/doi.org\/10.1007\/s40747-021-00543-2","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"type":"print","value":"2199-4536"},{"type":"electronic","value":"2198-6053"}],"subject":[],"published":{"date-parts":[[2021,9,22]]},"assertion":[{"value":"28 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 September 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 September 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}