Enhancing search efficiency in large-scale constrained multi-objective optimization using a decision variable importance matrix

IF 9.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Swarm and Evolutionary Computation Pub Date : 2026-10-01 Epub Date: 2026-09-29 DOI:10.1016/j.swevo.2026.102553
Guangyu Qian, Mingcheng Zuo, Yong Zhang, Dunwei Gong, Ali Wagdy Mohamed
{"title":"Enhancing search efficiency in large-scale constrained multi-objective optimization using a decision variable importance matrix","authors":"Guangyu Qian,&nbsp;Mingcheng Zuo,&nbsp;Yong Zhang,&nbsp;Dunwei Gong,&nbsp;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.
利用决策变量重要性矩阵提高大规模约束多目标优化的搜索效率
现有的约束多目标进化算法(cmoea)在求解大规模约束多目标优化问题(LSCMOPs)时,由于搜索空间呈指数级增长,严重制约了其优化效率。针对这一问题,提出了一种变重要度矩阵辅助的大规模约束多目标进化优化方法。首先,基于历史种群数据,在每一代开始时构建多个决策树;所得到的关于目标和约束的变量重要性得分被整合成一个变量重要性矩阵(VIM)。其次,利用参考向量对目标空间进行统一划分,并利用VIM估计不同搜索子区域中个体的变量重要度,得到基于子区域的变量重要度矩阵(SVIM);最后,根据SVIM为不同个体制定差异化的搜索方向,从而提高群体的搜索效率。该方法可以无缝集成到现有的cmoea中,并在不同程度上提高其性能。针对162个基准问题和一个综合煤矿能源系统调度优化问题,对9种最先进算法进行了广泛的对比实验。结果表明了该方法的有效性和优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Swarm and Evolutionary Computation
Swarm and Evolutionary Computation COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCEC-COMPUTER SCIENCE, THEORY & METHODS
CiteScore
16.00
自引率
12.00%
发文量
169
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书