An individual adaptive evolution and regional collaboration based evolutionary algorithm for large-scale constrained multiobjective optimization problems

IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Kunjie Yu , Zhenyu Yang , Jing Liang , Kangjia Qiao , Boyang Qu , Ponnuthurai Nagaratnam Suganthan
{"title":"An individual adaptive evolution and regional collaboration based evolutionary algorithm for large-scale constrained multiobjective optimization problems","authors":"Kunjie Yu ,&nbsp;Zhenyu Yang ,&nbsp;Jing Liang ,&nbsp;Kangjia Qiao ,&nbsp;Boyang Qu ,&nbsp;Ponnuthurai Nagaratnam Suganthan","doi":"10.1016/j.swevo.2025.101925","DOIUrl":null,"url":null,"abstract":"<div><div>Large-scale constrained multiobjective optimization problems (LSCMOPs) refer to constrained multiobjective optimization problems (CMOPs) with large-scale decision variables. When using evolutionary algorithms to solve LSCMOPs, the main challenge lies in balancing feasibility, convergence, and diversity in the high-dimensional search space. However, only a few studies focus on LSCMOPs and most existing related algorithms fail to achieve satisfactory performance. This paper proposes two novel mechanisms (the individual adaptive evolution strategy and the regional collaboration mechanism) to tackle these challenges. The individual adaptive evolution mechanism introduces a dynamic approach to optimize convergence-related and diversity-related variables by allocating computational resources to individuals based on their evolution states. This method effectively balances convergence and diversity in the high-dimensional search space. The regional collaboration mechanism, on the other hand, employs an auxiliary population to explore multiple sub-regions to maintain diversity, guiding the main population towards the constrained Pareto front. By combining these two mechanisms within a two-stage algorithm framework, a new algorithm IAERCEA is proposed. IAERCEA and nine other state-of-the-art algorithms are evaluated on several benchmark suites and three dynamic economic emissions dispatch problems. The results show that IAERCEA has better or competitive performance.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"95 ","pages":"Article 101925"},"PeriodicalIF":8.2000,"publicationDate":"2025-04-13","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/S2210650225000835","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Large-scale constrained multiobjective optimization problems (LSCMOPs) refer to constrained multiobjective optimization problems (CMOPs) with large-scale decision variables. When using evolutionary algorithms to solve LSCMOPs, the main challenge lies in balancing feasibility, convergence, and diversity in the high-dimensional search space. However, only a few studies focus on LSCMOPs and most existing related algorithms fail to achieve satisfactory performance. This paper proposes two novel mechanisms (the individual adaptive evolution strategy and the regional collaboration mechanism) to tackle these challenges. The individual adaptive evolution mechanism introduces a dynamic approach to optimize convergence-related and diversity-related variables by allocating computational resources to individuals based on their evolution states. This method effectively balances convergence and diversity in the high-dimensional search space. The regional collaboration mechanism, on the other hand, employs an auxiliary population to explore multiple sub-regions to maintain diversity, guiding the main population towards the constrained Pareto front. By combining these two mechanisms within a two-stage algorithm framework, a new algorithm IAERCEA is proposed. IAERCEA and nine other state-of-the-art algorithms are evaluated on several benchmark suites and three dynamic economic emissions dispatch problems. The results show that IAERCEA has better or competitive performance.
基于个体自适应进化和区域协作的大规模约束多目标优化问题进化算法
大规模约束多目标优化问题(large constrained multiobjective optimization problems, LSCMOPs)是指具有大规模决策变量的约束多目标优化问题。当使用进化算法求解LSCMOPs时,主要挑战在于如何在高维搜索空间中平衡可行性、收敛性和多样性。然而,针对LSCMOPs的研究很少,现有的相关算法大多不能达到令人满意的性能。本文提出了两种新的机制(个体适应进化策略和区域协作机制)来应对这些挑战。个体自适应进化机制引入了一种动态的方法,通过根据个体的进化状态分配计算资源来优化与收敛和多样性相关的变量。该方法在高维搜索空间中有效地平衡了收敛性和多样性。另一方面,区域协作机制利用辅助人口探索多个子区域以保持多样性,引导主要人口向受限的帕累托前沿移动。将这两种机制结合在一个两阶段算法框架中,提出了一种新的算法IAERCEA。IAERCEA和其他九种最先进的算法在几个基准套件和三个动态经济排放调度问题上进行了评估。结果表明,IAERCEA具有较好的竞争性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信