Large-Scale Constrained Multiobjective Optimization Based on Variable Adaptive Optimization and Population Reconstruction

IF 6 3区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Kunjie Yu;Zhenyu Yang;Jing Liang;Kangjia Qiao;Boyang Qu;Qiao Peng;Ponnuthurai Nagaratnam Suganthan
{"title":"Large-Scale Constrained Multiobjective Optimization Based on Variable Adaptive Optimization and Population Reconstruction","authors":"Kunjie Yu;Zhenyu Yang;Jing Liang;Kangjia Qiao;Boyang Qu;Qiao Peng;Ponnuthurai Nagaratnam Suganthan","doi":"10.1109/TETCI.2025.3641668","DOIUrl":null,"url":null,"abstract":"Constrained multiobjective evolutionary algorithms (CMOEAs) have been proposed to address constrained multiobjective optimization problems (CMOPs), and they have shown promising performance on small-scale problems. However, for CMOPs with large-scale decision variables, complex coupling relationships among variables and the huge search space make the algorithm converge slowly and difficult to find feasible solutions. Therefore, this study proposes a large-scale CMOEA based on variable adaptive optimization and population reconstruction to better solve large-scale CMOPs. First, a variable adaptive optimization strategy is developed in the global search stage, where convergence-related and diversity-related variables are adaptively selected for optimization. This strategy reduces the variable optimization difficulty caused by complex coupling relationships and explores the entire search space to locate regions near the constrained Pareto front (CPF). Then, in the local search stage, an archive-assisted population reconstruction strategy is proposed to generate an initial population by using promising solutions from the global search stage to rapidly guide the population towards the CPF. The experiments are conducted on 43 benchmark problems with up to 1000 decision variables and five real-world problems. Results show that the proposed method has better performance than other latest algorithms.","PeriodicalId":13135,"journal":{"name":"IEEE Transactions on Emerging Topics in Computational Intelligence","volume":"10 2","pages":"1625-1640"},"PeriodicalIF":6.0000,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Emerging Topics in Computational Intelligence","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/11303116/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/12/17 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Constrained multiobjective evolutionary algorithms (CMOEAs) have been proposed to address constrained multiobjective optimization problems (CMOPs), and they have shown promising performance on small-scale problems. However, for CMOPs with large-scale decision variables, complex coupling relationships among variables and the huge search space make the algorithm converge slowly and difficult to find feasible solutions. Therefore, this study proposes a large-scale CMOEA based on variable adaptive optimization and population reconstruction to better solve large-scale CMOPs. First, a variable adaptive optimization strategy is developed in the global search stage, where convergence-related and diversity-related variables are adaptively selected for optimization. This strategy reduces the variable optimization difficulty caused by complex coupling relationships and explores the entire search space to locate regions near the constrained Pareto front (CPF). Then, in the local search stage, an archive-assisted population reconstruction strategy is proposed to generate an initial population by using promising solutions from the global search stage to rapidly guide the population towards the CPF. The experiments are conducted on 43 benchmark problems with up to 1000 decision variables and five real-world problems. Results show that the proposed method has better performance than other latest algorithms.
基于变量自适应优化和种群重建的大规模约束多目标优化
约束多目标进化算法(cmoea)被提出用于解决约束多目标优化问题,并在小尺度问题上显示出良好的性能。然而,对于具有大规模决策变量的cops,变量之间复杂的耦合关系和巨大的搜索空间使得算法收敛缓慢,难以找到可行的解。因此,本研究提出了一种基于变量自适应优化和种群重建的大规模CMOEA,以更好地解决大规模cmoops问题。首先,在全局搜索阶段提出了一种变量自适应优化策略,自适应选择与收敛性和多样性相关的变量进行优化。该策略降低了复杂耦合关系带来的变量优化难度,并探索了整个搜索空间以定位约束帕累托前沿(CPF)附近的区域。然后,在局部搜索阶段,提出了一种档案辅助种群重建策略,利用全局搜索阶段的有前途的解生成初始种群,快速引导种群向CPF方向移动。实验在43个有多达1000个决策变量的基准问题和5个现实问题上进行。结果表明,该方法比其他最新算法具有更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
10.30
自引率
7.50%
发文量
147
期刊介绍: The IEEE Transactions on Emerging Topics in Computational Intelligence (TETCI) publishes original articles on emerging aspects of computational intelligence, including theory, applications, and surveys. TETCI is an electronics only publication. TETCI publishes six issues per year. Authors are encouraged to submit manuscripts in any emerging topic in computational intelligence, especially nature-inspired computing topics not covered by other IEEE Computational Intelligence Society journals. A few such illustrative examples are glial cell networks, computational neuroscience, Brain Computer Interface, ambient intelligence, non-fuzzy computing with words, artificial life, cultural learning, artificial endocrine networks, social reasoning, artificial hormone networks, computational intelligence for the IoT and Smart-X technologies.
×
引用
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学术官方微信
小红书