{"title":"Enhancing search efficiency in large-scale constrained multi-objective optimization using a decision variable importance matrix","authors":"Guangyu Qian, Mingcheng Zuo, Yong Zhang, Dunwei Gong, Ali Wagdy Mohamed","doi":"10.1016/j.swevo.2026.102553","DOIUrl":null,"url":null,"abstract":"<div><div>Existing constrained multi-objective evolutionary algorithms (CMOEAs) encounter significant challenges in solving large-scale constrained multi-objective optimization problems (LSCMOPs), as the exponentially increasing search space severely restricts their optimization efficiency. To address this issue, this paper proposes a variable importance matrix-assisted large-scale constrained multi-objective evolutionary optimization method. First, multiple decision trees are constructed at the beginning of each generation based on historical population data. The resulting variable importance scores with respect to objectives and constraints are integrated to form a variable importance matrix (VIM). Second, the objective space is uniformly divided using reference vectors, and the VIM is employed to estimate the variable importance of individuals in different search subregions, resulting in the subregion-based variable importance matrix (SVIM). Finally, differentiated search directions are developed for different individuals according to the SVIM, thereby enhancing the search efficiency of the population. The proposed method can be seamlessly incorporated into existing CMOEAs and improve their performance to varying degrees. Extensive comparative experiments are conducted against nine state-of-the-art algorithms on 162 benchmark problems and an integrated coal mine energy system scheduling optimization problem. The results demonstrate the effectiveness and superiority of the proposed method.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"109 ","pages":"Article 102553"},"PeriodicalIF":9.6000,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650226002737","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/9/29 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
Existing constrained multi-objective evolutionary algorithms (CMOEAs) encounter significant challenges in solving large-scale constrained multi-objective optimization problems (LSCMOPs), as the exponentially increasing search space severely restricts their optimization efficiency. To address this issue, this paper proposes a variable importance matrix-assisted large-scale constrained multi-objective evolutionary optimization method. First, multiple decision trees are constructed at the beginning of each generation based on historical population data. The resulting variable importance scores with respect to objectives and constraints are integrated to form a variable importance matrix (VIM). Second, the objective space is uniformly divided using reference vectors, and the VIM is employed to estimate the variable importance of individuals in different search subregions, resulting in the subregion-based variable importance matrix (SVIM). Finally, differentiated search directions are developed for different individuals according to the SVIM, thereby enhancing the search efficiency of the population. The proposed method can be seamlessly incorporated into existing CMOEAs and improve their performance to varying degrees. Extensive comparative experiments are conducted against nine state-of-the-art algorithms on 162 benchmark problems and an integrated coal mine energy system scheduling optimization problem. The results demonstrate the effectiveness and superiority of the proposed method.
期刊介绍:
Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.