{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T17:43:12Z","timestamp":1776447792074,"version":"3.51.2"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,10,9]],"date-time":"2021-10-09T00:00:00Z","timestamp":1633737600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,10,9]],"date-time":"2021-10-09T00:00:00Z","timestamp":1633737600000},"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":[[2023,4]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Sparse large-scale multi-objective optimization problems (LSMOPs) widely exist in real-world applications, which have the properties of involving a large number of decision variables and sparse Pareto optimal solutions, i.e., most decision variables of these solutions are zero. In recent years, sparse LSMOPs have attracted increasing attentions in the evolutionary computation community. However, all the recently tailored algorithms for sparse LSMOPs put the sparsity detection and maintenance in the first place, where the nonzero variables can hardly be optimized sufficiently within a limited budget of function evaluations. To address this issue, this paper proposes to enhance the connection between real variables and binary variables within the two-layer encoding scheme with the assistance of variable grouping techniques. In this way, more efforts can be devoted to the real part of nonzero variables, achieving the balance between sparsity maintenance and variable optimization. According to the experimental results on eight benchmark problems and three real-world applications, the proposed algorithm is superior over existing state-of-the-art evolutionary algorithms for sparse LSMOPs.<\/jats:p>","DOI":"10.1007\/s40747-021-00553-0","type":"journal-article","created":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T16:15:06Z","timestamp":1633882506000},"page":"1127-1142","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":70,"title":["Improved SparseEA for sparse large-scale multi-objective optimization problems"],"prefix":"10.1007","volume":"9","author":[{"given":"Yajie","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Ye","family":"Tian","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5052-000X","authenticated-orcid":false,"given":"Xingyi","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,9]]},"reference":[{"key":"553_CR1","doi-asserted-by":"publisher","unstructured":"Xiao J, Zhang T, Du J, Zhang X (2019) An evolutionary multiobjective route grouping-based heuristic algorithm for large-scale capacitated vehicle routing problems. IEEE Trans Cybern. https:\/\/doi.org\/10.1109\/TCYB.2019.2950626","DOI":"10.1109\/TCYB.2019.2950626"},{"issue":"5","key":"553_CR2","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1109\/TEVC.2020.2967501","volume":"24","author":"C He","year":"2020","unstructured":"He C, Cheng R, Zhang C, Tian Y et al (2020) Evolutionary large-scale multiobjective optimization for ratio error estimation of voltage transformers. IEEE Trans Evol Comput 24(5):868\u2013881","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"553_CR3","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":"6","key":"553_CR4","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":"4","key":"553_CR5","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, 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":"1","key":"553_CR6","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1162\/EVCO_a_00122","volume":"23","author":"H Wang","year":"2015","unstructured":"Wang H, Jiao L, Shang R, He S, Liu F (2015) A memetic optimization strategy based on dimension reduction in decision space. Evol Comput 23(1):69\u2013100","journal-title":"Evol Comput"},{"key":"553_CR7","doi-asserted-by":"crossref","unstructured":"Tian Y, Si L, Zhang X, Cheng R, et al (2021) Evolutionary large-scale multi-objective optimization: a survey. ACM Comput Surv","DOI":"10.1145\/3470971"},{"key":"553_CR8","doi-asserted-by":"crossref","unstructured":"Antonio L, Coello Coello C (2013) Use of cooperative coevolution for solving large scale multiobjective optimization problems. In: IEEE Congress on Evolutionary Computation (CEC), pp 2758\u20132765","DOI":"10.1109\/CEC.2013.6557903"},{"issue":"2","key":"553_CR9","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1109\/TEVC.2015.2455812","volume":"20","author":"X Ma","year":"2016","unstructured":"Ma X, Liu F, Qi Y et al (2016) A multiobjective evolutionary algorithm based on decision variable analyses for multiobjective optimization problems with large-scale variables. IEEE Trans Evol Comput 20(2):275\u2013298","journal-title":"IEEE Trans Evol Comput"},{"issue":"99","key":"553_CR10","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, Jin Y (2018) A decision variable clustering-based evolutionary algorithm for large-scale many-objective optimization. IEEE Trans Evol Comput 22(99):97\u2013112","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"553_CR11","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1109\/TEVC.2017.2704782","volume":"22","author":"H Zille","year":"2018","unstructured":"Zille H, Ishibuchi H, Mostaghim S, Nojima Y (2018) A framework for large-scale multiobjective optimization based on problem transformation. IEEE Trans Evol Comput 22(2):260\u2013275","journal-title":"IEEE Trans Evol Comput"},{"issue":"6","key":"553_CR12","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1109\/TEVC.2019.2896002","volume":"23","author":"C He","year":"2019","unstructured":"He C, Li L, Tian Y et al (2019) Accelerating large-scale multiobjective optimization via problem reformulation. IEEE Trans Evol Comput 23(6):949\u2013961","journal-title":"IEEE Trans Evol Comput"},{"key":"553_CR13","doi-asserted-by":"publisher","unstructured":"He C, Cheng R, Yazdani D (2020) Adaptive offspring generation for evolutionary large-scale multiobjective optimization. Syst Man Cybern Syst IEEE Trans. https:\/\/doi.org\/10.1109\/TSMC.2020.3003926","DOI":"10.1109\/TSMC.2020.3003926"},{"issue":"8","key":"553_CR14","doi-asserted-by":"publisher","first-page":"3696","DOI":"10.1109\/TCYB.2019.2906383","volume":"50","author":"Y Tian","year":"2019","unstructured":"Tian Y, Zheng X, Zhang X, Jin Y (2019) Efficient large-scale multi-objective optimization based on a competitive swarm optimizer. IEEE Trans. Cybern 50(8):3696\u20133708","journal-title":"IEEE Trans. Cybern"},{"issue":"2","key":"553_CR15","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","journal-title":"IEEE Trans Cybern"},{"key":"553_CR16","doi-asserted-by":"crossref","unstructured":"Zille H, Mostaghim S (2019) Linear search mechanism for multi- and many-objective optimisation. In: Deb K et al (eds), EMO 2019, LNCS, Springer, Cham 11411:399\u2013410","DOI":"10.1007\/978-3-030-12598-1_32"},{"key":"553_CR17","doi-asserted-by":"publisher","unstructured":"Zille H, Ishibuchi H, Mostaghim S, Nojima Y (2016) Mutation operators based on variable grouping for multi-objective large-scale optimization. In: IEEE Symposium Series on Computational Intelligence (SSCI), Greece. https:\/\/doi.org\/10.1109\/SSCI.2016.7850214","DOI":"10.1109\/SSCI.2016.7850214"},{"issue":"3","key":"553_CR18","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1109\/TSMCC.2008.919172","volume":"38","author":"Y Jin","year":"2008","unstructured":"Jin Y, Sendhoff B (2008) Pareto-based multiobjective machine learning: an overview and case studies. IEEE Trans Syst Man Cybern Syst 38(3):397\u2013415","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"553_CR19","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1016\/j.asoc.2014.08.026","volume":"24","author":"K Lwin","year":"2014","unstructured":"Lwin K, Qu R, Kendall G (2014) A learning-guided multi-objective evolutionary algorithm for constrained portfolio optimization. Appl Soft Comput J 24:757\u2013772","journal-title":"Appl Soft Comput J"},{"key":"553_CR20","doi-asserted-by":"crossref","unstructured":"Zhang Y, Tian Y, Zhang X (2021) A comparsion study of evolutionary algorithms on large-scale sparse multi-objective optimization problems. In: Ishibuchi H et al (eds), EMO 2021, LNCS, Springer, 12654:424\u2013437","DOI":"10.1007\/978-3-030-72062-9_34"},{"issue":"2","key":"553_CR21","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1109\/TEVC.2019.2918140","volume":"24","author":"Y Tian","year":"2020","unstructured":"Tian Y, Zhang X, Wang C, Jin Y (2020) An evolutionary algorithm for large-scale sparse multiobjective optimization problems. IEEE Trans Evol Comput 24(2):380\u2013393","journal-title":"IEEE Trans Evol Comput"},{"issue":"6","key":"553_CR22","doi-asserted-by":"publisher","first-page":"3115","DOI":"10.1109\/TCYB.2020.2979930","volume":"51","author":"Y Tian","year":"2020","unstructured":"Tian Y, Lu C, Zhang X et al (2020) Solving large-scale multiobjective optimization problems with sparse optimal solutions via unsupervised neural networks. IEEE Trans Cybern 51(6):3115\u20133128","journal-title":"IEEE Trans Cybern"},{"key":"553_CR23","doi-asserted-by":"crossref","unstructured":"Fischer A, Igel C (2012) An introduction to restricted Boltzmann machines. In: the Iberoamerican congress on pattern recognition, Springer, 14\u201336","DOI":"10.1007\/978-3-642-33275-3_2"},{"key":"553_CR24","doi-asserted-by":"crossref","unstructured":"Vincent P, Larochelle H, Bengio Y, et al (2008) Extracting and composing robust features with denoising autoencoders. In: The 25th International Conference on Machine Learning, ACM, pp 1096\u20131103","DOI":"10.1145\/1390156.1390294"},{"key":"553_CR25","doi-asserted-by":"publisher","unstructured":"Tian Y, Lu C, Zhang X, et al (2020) A pattern mining based evolutionary algorithm for large-scale sparse multi-objective optimization problems. IEEE Trans Cybern. https:\/\/doi.org\/10.1109\/TCYB.2020.3041325","DOI":"10.1109\/TCYB.2020.3041325"},{"key":"553_CR26","doi-asserted-by":"crossref","unstructured":"Tan Z, Wang H, Liu S (2021) Multi-stage dimension reduction for expensive sparse multi-objective optimization problems. Neurocomputing pp 159\u2013174","DOI":"10.1016\/j.neucom.2021.01.115"},{"key":"553_CR27","doi-asserted-by":"publisher","unstructured":"Tian Y, Liu R, Zhang X et al (2020) A multi-population evolutionary algorithm for solving large-scale multi-model multi-objective optimization problems. IEEE Trans Evol Comput. https:\/\/doi.org\/10.1109\/TEVC.2020.3044711","DOI":"10.1109\/TEVC.2020.3044711"},{"key":"553_CR28","doi-asserted-by":"publisher","unstructured":"Omidvar M, Li X, Yang Z, Yao X (2010) Cooperative co-evolution for large scale optimization through more frequent random grouping. In: IEEE Congress on Evolutionary Computation (CEC), pp 1\u20138. https:\/\/doi.org\/10.1109\/CEC.2010.5586127","DOI":"10.1109\/CEC.2010.5586127"},{"key":"553_CR29","doi-asserted-by":"crossref","unstructured":"Chen W, Weise T, Yang Z, Tang K (2010) Large-scale global optimization using cooperative coevolution with variable interaction learning. In: Schaefer, Robert, Cotta, Carlos, et al (eds.) PPSN. LNCS, 6239:300-309. Springer, Heidelberg","DOI":"10.1007\/978-3-642-15871-1_31"},{"issue":"5","key":"553_CR30","doi-asserted-by":"publisher","first-page":"1287","DOI":"10.1016\/j.csda.2004.11.011","volume":"50","author":"S Aelst","year":"2006","unstructured":"Aelst S, Wang X, Zamar R, Zhu R (2006) Linear grouping using orthogonal regression. Comput Stat Data Anal 50(5):1287\u20131312","journal-title":"Comput Stat Data Anal"},{"issue":"6","key":"553_CR31","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1109\/TEVC.2017.2694221","volume":"21","author":"M Omidvar","year":"2017","unstructured":"Omidvar M, Yang M, Mei Y, Yao X (2017) DG2: a faster and more accurate differential grouping for large-scale black-box optimization. IEEE Trans Evol Comput 21(6):929\u2013942","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"553_CR32","first-page":"115","volume":"9","author":"K Deb","year":"1995","unstructured":"Deb K, Agrawal R (1995) Simulated binary crossover for continuous search space. Complex Syst 9(4):115\u2013148","journal-title":"Complex Syst"},{"issue":"4","key":"553_CR33","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 Inf 26(4):30\u201345","journal-title":"Comput Sci Inf"},{"issue":"4","key":"553_CR34","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. IEEE Comput Intell Mag 12(4):73\u201387","journal-title":"IEEE Comput Intell Mag"},{"key":"553_CR35","unstructured":"Liang J, Gong M, Li H, Yue C, and Qu B (2018) Problem definitions and evaluation criteria for the cec special session on evolutionary algorithms for sparse optimization. Technical Report, Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou, China"},{"issue":"2","key":"553_CR36","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1109\/TEVC.2003.810761","volume":"7","author":"P Bosman","year":"2003","unstructured":"Bosman P, Thierens D (2003) The balance between proximity and diversity in multiobjective evolutionary algorithms. IEEE Trans Evol Comput 7(2):174\u2013188","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"553_CR37","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"},{"issue":"2","key":"553_CR38","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1109\/TEVC.2014.2315442","volume":"19","author":"H Ishibuchi","year":"2015","unstructured":"Ishibuchi H, Akedo N, Nojima Y (2015) Behavior of multi-objective evolutionary algorithms on many-objective knapsack problems. IEEE Trans Evol Comput 19(2):264\u2013283","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"553_CR39","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1109\/TEVC.2019.2922419","volume":"24","author":"Y Xiang","year":"2020","unstructured":"Xiang Y, Yang X, Zhou Y, Huang H (2020) Enhancing decomposition-based algorithms by estimation of distribution for constrained optimal software product selection. IEEE Trans Evol Comput 24(2):245\u2013259","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-021-00553-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-021-00553-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-021-00553-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T09:18:32Z","timestamp":1681809512000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-021-00553-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,9]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["553"],"URL":"https:\/\/doi.org\/10.1007\/s40747-021-00553-0","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10,9]]},"assertion":[{"value":"14 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 October 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}},{"value":"Not applicable","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not applicable","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable","order":6,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}]}}