{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T22:48:04Z","timestamp":1770418084843,"version":"3.49.0"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,5,9]],"date-time":"2022-05-09T00:00:00Z","timestamp":1652054400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,5,9]],"date-time":"2022-05-09T00:00:00Z","timestamp":1652054400000},"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":["61876123"],"award-info":[{"award-number":["61876123"]}],"id":[{"id":"10.13039\/501100001809","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\/501100004480","name":"Natural Science Foundation of Shanxi Province","doi-asserted-by":"publisher","award":["201901D111262"],"award-info":[{"award-number":["201901D111262"]}],"id":[{"id":"10.13039\/501100004480","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ShanXi Science and Technology Innovation project for Excellent Talents","award":["201805D211028"],"award-info":[{"award-number":["201805D211028"]}]},{"DOI":"10.13039\/501100010010","name":"Shanxi Province Science Foundation for Youths","doi-asserted-by":"publisher","award":["201901D211237"],"award-info":[{"award-number":["201901D211237"]}],"id":[{"id":"10.13039\/501100010010","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":[[2022,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Evolutionary algorithms (EAs) have shown excellent performance for solving optimization problems with multiple objectives as they can get a set of compromising solutions on a single run. However, when the number of objectives increases, an efficient selection is significant to find a good set of solutions. In this paper, a decomposition-based many-objective evolutionary algorithm with optional performance indicators is proposed, in which the decomposition strategy is utilized to convert a many-objective optimization problem into a set of single-objective optimization problems, and the criterion to select a solution for the next generation along each reference is randomly set to convergence or diversity performance. The performance of the proposed method is evaluated on two sets of benchmark problems, and the experimental results showed the efficiency of the proposed method compared with seven state-of-the-art MaOEAs.<\/jats:p>","DOI":"10.1007\/s40747-022-00747-0","type":"journal-article","created":{"date-parts":[[2022,5,9]],"date-time":"2022-05-09T03:23:46Z","timestamp":1652066626000},"page":"5157-5176","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A decomposition-based many-objective evolutionary algorithm with optional performance indicators"],"prefix":"10.1007","volume":"8","author":[{"given":"Hao","family":"Wang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8011-8222","authenticated-orcid":false,"given":"Chaoli","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Haibo","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Xiaobo","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,9]]},"reference":[{"issue":"5","key":"747_CR1","doi-asserted-by":"publisher","first-page":"790","DOI":"10.1109\/TSMC.2016.2616347","volume":"48","author":"X Zheng","year":"2016","unstructured":"Zheng X, Wang L (2016) A collaborative multiobjective fruit fly optimization algorithm for the resource constrained unrelated parallel machine green scheduling problem. IEEE Trans Syst Man Cybern Syst 48(5):790\u2013800","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"issue":"2","key":"747_CR2","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":"4","key":"747_CR3","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1109\/TSC.2018.2866421","volume":"14","author":"H Chen","year":"2021","unstructured":"Chen H, Zhu X, Liu G, Pedrycz W (2021) Uncertainty-aware online scheduling for real-time workflows in cloud service environment. IEEE Trans Serv Comput 14(4):1167\u20131178","journal-title":"IEEE Trans Serv Comput"},{"issue":"19","key":"747_CR4","doi-asserted-by":"publisher","first-page":"5714","DOI":"10.1021\/acs.iecr.6b00441","volume":"55","author":"M Wei","year":"2016","unstructured":"Wei M, Yang M-L, Qian F, Wenli D, Zhong W (2016) Integrated dual-production mode modeling and multi-objective optimization of an industrial continuous catalytic naphtha reforming process. Ind Eng Chem Res 55(19):5714\u20135725","journal-title":"Ind Eng Chem Res"},{"issue":"5","key":"747_CR5","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":"1","key":"747_CR6","doi-asserted-by":"publisher","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 (CSUR) 48(1):1\u201335","journal-title":"ACM Comput Surv (CSUR)"},{"issue":"6","key":"747_CR7","doi-asserted-by":"publisher","first-page":"3552","DOI":"10.1109\/TSMC.2019.2930737","volume":"51","author":"H Chen","year":"2021","unstructured":"Chen H, Cheng R, Pedrycz W, Jin Y (2021) Solving many-objective optimization problems via multistage evolutionary search. IEEE Trans Syst Man Cybern Syst 51(6):3552\u20133564","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"747_CR8","unstructured":"Robin\u00a0CP (2003) On the evolutionary optimisation of many objectives"},{"issue":"2","key":"747_CR9","doi-asserted-by":"publisher","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"},{"issue":"4","key":"747_CR10","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1162\/106365605774666895","volume":"13","author":"K Deb","year":"2005","unstructured":"Deb K, Mohan M, Mishra S (2005) Evaluating the $$\\epsilon $$ -domination based multi-objective evolutionary algorithm for a quick computation of pareto-optimal solutions. Evol Comput 13(4):501\u2013525","journal-title":"Evol Comput"},{"issue":"5","key":"747_CR11","doi-asserted-by":"publisher","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":"747_CR12","doi-asserted-by":"crossref","unstructured":"Kokolo I, Hajime K, Shigenobu K (2001) Failure of pareto-based moeas: does non-dominated really mean near to optimal? In Proceedings of the 2001 congress on evolutionary computation (IEEE Cat. No. 01TH8546), volume\u00a02, pages 957\u2013962. IEEE","DOI":"10.1109\/CEC.2001.934293"},{"key":"747_CR13","doi-asserted-by":"crossref","unstructured":"Cynthia\u00a0A, Rodr\u00edguez\u00a0Villalobos Carlos\u00a0AC (2012) A new multi-objective evolutionary algorithm based on a performance assessment indicator. In Proceedings of the 14th annual conference on Genetic and evolutionary computation, pages 505\u2013512,","DOI":"10.1145\/2330163.2330235"},{"issue":"6","key":"747_CR14","first-page":"95","volume":"25","author":"R Storn","year":"1995","unstructured":"Storn R, Price K (1995) Differential evolution: a simple and efficient adaptive scheme for global optimization over continuous space. Tech Rep 25(6):95\u2013102","journal-title":"Tech Rep"},{"key":"747_CR15","doi-asserted-by":"crossref","unstructured":"Hisao I, Hiroyuki M, Yuki T, Yusuke N (2015) Modified distance calculation in generational distance and inverted generational distance. In: International conference on evolutionary multi-criterion optimization, pp. 110\u2013125. Springer, New York","DOI":"10.1007\/978-3-319-15892-1_8"},{"issue":"4","key":"747_CR16","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":"6","key":"747_CR17","doi-asserted-by":"publisher","first-page":"924","DOI":"10.1109\/TEVC.2016.2549267","volume":"20","author":"B Li","year":"2016","unstructured":"Li B, Tang K, Li J, Yao X (2016) Stochastic ranking algorithm for many-objective optimization based on multiple indicators. IEEE Trans Evol Comput 20(6):924\u2013938","journal-title":"IEEE Trans Evol Comput"},{"key":"747_CR18","doi-asserted-by":"crossref","unstructured":"Hao W, Chaoli S, Guochen Z, Jonathan\u00a0EF, Yaochu J (2021) Non-dominated sorting on performance indicators for evolutionary many-objective optimization. Inf Sci 551:23\u201338","DOI":"10.1016\/j.ins.2020.11.008"},{"issue":"2","key":"747_CR19","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1109\/TEVC.2015.2443001","volume":"20","author":"Y Yuan","year":"2016","unstructured":"Yuan Y, Hua X, Wang B, Zhang B, Yao X (2016) Balancing convergence and diversity in decomposition-based many-objective optimizers. IEEE Trans Evol Comput 20(2):180\u2013198","journal-title":"IEEE Trans Evol Comput"},{"key":"747_CR20","doi-asserted-by":"crossref","unstructured":"Ran C, Yaochu J, Markus O, Bernhard S (2016) A reference vector guided evolutionary algorithm for many-objective optimization. IEEE Trans Evolut Comput 20(5)","DOI":"10.1109\/TEVC.2016.2519378"},{"issue":"3","key":"747_CR21","doi-asserted-by":"publisher","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":"747_CR22","doi-asserted-by":"crossref","unstructured":"Huangke C, Guohua W, Witold P, Suganthan PN, Lining X, Xiaomin Z (2019) An adaptive resource allocation strategy for objective space partition-based multiobjective optimization. IEEE Trans Syst Man Cybern pp 1\u201316","DOI":"10.1109\/TSMC.2019.2898456"},{"issue":"5","key":"747_CR23","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1109\/TEVC.2014.2373386","volume":"19","author":"K Li","year":"2014","unstructured":"Li K, Deb K, Zhang Q, Kwong S (2014) An evolutionary many-objective optimization algorithm based on dominance and decomposition. IEEE Trans Evol Comput 19(5):694\u2013716","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"747_CR24","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 Evol Comput 18(4):577\u2013601","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"747_CR25","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 Evol Comput 19(4):524\u2013541","journal-title":"IEEE Trans Evol Comput"},{"issue":"6","key":"747_CR26","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":"5","key":"747_CR27","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1109\/TEVC.2014.2373386","volume":"19","author":"K Li","year":"2015","unstructured":"Li K, Deb K, Zhang Q, Kwong S (2015) An evolutionary many-objective optimization algorithm based on dominance and decomposition. IEEE Trans Evol Comput 19(5):694\u2013716","journal-title":"IEEE Trans Evol Comput"},{"key":"747_CR28","unstructured":"Kaisa M (201) Nonlinear multiobjective optimization, volume\u00a012. Springer, New York"},{"issue":"2","key":"747_CR29","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":"2","key":"747_CR30","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"},{"key":"747_CR31","first-page":"30","volume":"26","author":"K Deb","year":"1996","unstructured":"Deb K, Goyal M et al (1996) A combined genetic adaptive search (geneas) for engineering design. Comput Sci Inf 26:30\u201345","journal-title":"Comput Sci Inf"},{"key":"747_CR32","unstructured":"Kalyanmoy D, Lothar T, Marco L, Eckart Z (2006) Scalable Test problems for evolutionary multiobjective optimization"},{"key":"747_CR33","doi-asserted-by":"crossref","unstructured":"Saul Z-M, Carlos\u00a0ACC, Hernan\u00a0EA, Kiyoshi T (2019) A review of features and limitations of existing scalable multiobjective test suites. IEEE Trans Evolut Comput 23(1):130\u2013142","DOI":"10.1109\/TEVC.2018.2836912"},{"key":"747_CR34","unstructured":"Ran C, Miqing L, Ye\u00a0T, Xingyi Z, Shengxiang Y, Yaochu J, Xin Y (2017) A benchmark test suite for evolutionary many-objective optimization"},{"key":"747_CR35","doi-asserted-by":"crossref","unstructured":"Tatsuya O, Yaochu J, Markus O, Bernhard S (2004) On test functions for evolutionary multi-objective optimization. pp 792\u2013802","DOI":"10.1007\/978-3-540-30217-9_80"},{"issue":"2","key":"747_CR36","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":"747_CR37","doi-asserted-by":"publisher","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(1):29\u201338","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"747_CR38","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, Jin Y (2017) Platemo: a matlab platform for evolutionary multi-objective optimization [educational forum]. IEEE Comput Intell Magn 12(4):73\u201387","journal-title":"IEEE Comput Intell Magn"},{"issue":"4","key":"747_CR39","doi-asserted-by":"publisher","first-page":"859","DOI":"10.2307\/2530180","volume":"37","author":"C Tadeusz","year":"1981","unstructured":"Tadeusz C, Steel RGD, Torrie JH (1981) Principles and procedures of statistics: a biometrical approach. Biometrics 37(4):859","journal-title":"Biometrics"},{"key":"747_CR40","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.ins.2017.09.053","volume":"423","author":"W Guohua","year":"2018","unstructured":"Guohua W, Shen X, Li H, Chen H, Lin A, Suganthan PN (2018) Ensemble of differential evolution variants. Inf Sci 423:172\u2013186","journal-title":"Inf Sci"},{"issue":"1","key":"747_CR41","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/TEVC.2020.2999100","volume":"25","author":"J Yuan","year":"2020","unstructured":"Yuan J, Liu H-L, Fangqing G, Zhang Q, He Z (2020) Investigating the properties of indicators and an evolutionary many-objective algorithm using promising regions. IEEE Trans Evol Comput 25(1):75\u201386","journal-title":"IEEE Trans Evol Comput"},{"issue":"5","key":"747_CR42","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1109\/TEVC.2018.2882166","volume":"23","author":"Y Sun","year":"2018","unstructured":"Sun Y, Xue B, Zhang M, Yen GG (2018) A new two-stage evolutionary algorithm for many-objective optimization. IEEE Trans Evol Comput 23(5):748\u2013761","journal-title":"IEEE Trans Evol Comput"},{"key":"747_CR43","doi-asserted-by":"crossref","unstructured":"Qiuzhen L, Songbai L, Qingling Z, Chaoyu T, Ruizhen S, Jianyong C, Carlos ACC, Ka-Chun W, Jun Z (2016) Particle swarm optimization with a balanceable fitness estimation for many-objective optimization problems. IEEE Trans Evolut Comput 22(1):32\u201346","DOI":"10.1109\/TEVC.2016.2631279"},{"issue":"6","key":"747_CR44","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1109\/TEVC.2014.2378512","volume":"19","author":"X Zhang","year":"2014","unstructured":"Zhang X, Tian Y, Jin Y (2014) A knee point-driven evolutionary algorithm for many-objective optimization. IEEE Trans Evol Comput 19(6):761\u2013776","journal-title":"IEEE Trans Evol Comput"},{"key":"747_CR45","doi-asserted-by":"crossref","unstructured":"Sun Y, Yen GG, Yi Z (2018) Igd indicator-based evolutionary algorithm for many-objective optimization problems. IEEE Trans Evol Comput 23(2):173\u2013187","DOI":"10.1109\/TEVC.2018.2791283"},{"key":"747_CR46","unstructured":"Hisao I, Noritaka T, Yuji S, Yusuke N (2010) Indicator-based evolutionary algorithm with hypervolume approximation by achievement scalarizing functions. In: Proceedings of the 12th annual conference on Genetic and evolutionary computation, pp 527\u2013534"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00747-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-022-00747-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00747-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,24]],"date-time":"2024-09-24T02:41:24Z","timestamp":1727145684000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-022-00747-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,9]]},"references-count":46,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["747"],"URL":"https:\/\/doi.org\/10.1007\/s40747-022-00747-0","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,9]]},"assertion":[{"value":"30 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 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":"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"}}]}}