Liping Wang, Bangjin Che, Qicang Qiu, Yuyan Gao, Peipei Zhao
{"title":"A multi-feature fusion-based evolutionary algorithm for large-scale sparse multi-objective optimization problems","authors":"Liping Wang, Bangjin Che, Qicang Qiu, Yuyan Gao, Peipei Zhao","doi":"10.1007/s10489-025-06772-z","DOIUrl":null,"url":null,"abstract":"<div><p>Large-scale sparse multi-objective optimization problems are common and present significant challenges in scientific research and engineering practice. The primary characteristics of these problems include the high dimensionality of decision variables and the sparsity of the solution set, which greatly increase the problem’s difficulty. During the algorithmic solution process, the interference of non-critical variables reduces the algorithm’s solving efficiency and negatively impacts the quality of the solution set. Therefore, this paper proposes a large-scale sparse multi-objective evolutionary algorithm based on multi-feature fusion, comprehensively considering the importance of decision variables from multiple aspects. First, we introduce a reference point perturbation clustering method. By evenly distributing reference points in the decision space, we control the perturbation of decision variables. The perturbed decision variables are clustered, and an activation function is used to transform the clustering results into contribution values that assess the importance of the decision variables. Second, we propose a sparse feature detection method to mine sparse features from the sparse information of the decision variables, evaluating the informational content of the decision variables. This information is used to filter decision variables to reduce the search space. Finally, the filtered decision variables are competitively optimized using contribution values. Experiments on eight benchmark problems and three real-world applications demonstrate that the algorithm surpasses current state-of-the-art large-scale sparse multi-objective evolutionary algorithms in terms of convergence speed and solution set quality.</p></div>","PeriodicalId":8041,"journal":{"name":"Applied Intelligence","volume":"55 13","pages":""},"PeriodicalIF":3.5000,"publicationDate":"2025-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Intelligence","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s10489-025-06772-z","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
Large-scale sparse multi-objective optimization problems are common and present significant challenges in scientific research and engineering practice. The primary characteristics of these problems include the high dimensionality of decision variables and the sparsity of the solution set, which greatly increase the problem’s difficulty. During the algorithmic solution process, the interference of non-critical variables reduces the algorithm’s solving efficiency and negatively impacts the quality of the solution set. Therefore, this paper proposes a large-scale sparse multi-objective evolutionary algorithm based on multi-feature fusion, comprehensively considering the importance of decision variables from multiple aspects. First, we introduce a reference point perturbation clustering method. By evenly distributing reference points in the decision space, we control the perturbation of decision variables. The perturbed decision variables are clustered, and an activation function is used to transform the clustering results into contribution values that assess the importance of the decision variables. Second, we propose a sparse feature detection method to mine sparse features from the sparse information of the decision variables, evaluating the informational content of the decision variables. This information is used to filter decision variables to reduce the search space. Finally, the filtered decision variables are competitively optimized using contribution values. Experiments on eight benchmark problems and three real-world applications demonstrate that the algorithm surpasses current state-of-the-art large-scale sparse multi-objective evolutionary algorithms in terms of convergence speed and solution set quality.
期刊介绍:
With a focus on research in artificial intelligence and neural networks, this journal addresses issues involving solutions of real-life manufacturing, defense, management, government and industrial problems which are too complex to be solved through conventional approaches and require the simulation of intelligent thought processes, heuristics, applications of knowledge, and distributed and parallel processing. The integration of these multiple approaches in solving complex problems is of particular importance.
The journal presents new and original research and technological developments, addressing real and complex issues applicable to difficult problems. It provides a medium for exchanging scientific research and technological achievements accomplished by the international community.