A constrained multimodal multi-objective evolutionary algorithm based on adaptive epsilon method and two-level environmental selection

IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Fengxia Wang , Min Huang , Shengxiang Yang , Xingwei Wang
{"title":"A constrained multimodal multi-objective evolutionary algorithm based on adaptive epsilon method and two-level environmental selection","authors":"Fengxia Wang ,&nbsp;Min Huang ,&nbsp;Shengxiang Yang ,&nbsp;Xingwei Wang","doi":"10.1016/j.swevo.2025.101845","DOIUrl":null,"url":null,"abstract":"<div><div>Constrained multimodal multi-objective optimization problems (CMMOPs) commonly arise in practical problems in which multiple Pareto optimal sets (POSs) correspond to one Pareto optimal front (POF). The existence of constraints and multimodal characteristics makes it challenging to design effective algorithms that promote diversity in the decision space and convergence in the objective space. Therefore, this paper proposes a novel constrained multimodal multi-objective evolutionary algorithm, namely CM-MOEA, to address CMMOPs. In CM-MOEA, an adaptive epsilon-constrained method is designed to utilize promising infeasible solutions, promoting exploration in the search space. Then, a diversity-based offspring generation method is performed to select diverse solutions for mutation, searching for more equivalent POSs. Furthermore, the two-level environmental selection strategy that combines local and global environmental selection is developed to guarantee diversity and convergence of solutions. Finally, we design an archive update strategy that stores well-distributed excellent solutions, which more effectively approach the true POF. The proposed CM-MOEA is compared with several state-of-the-art algorithms on 17 test problems. The experimental results demonstrate that the proposed CM-MOEA has significant advantages in solving CMMOPs.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"93 ","pages":"Article 101845"},"PeriodicalIF":8.2000,"publicationDate":"2025-01-15","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/S2210650225000033","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

Constrained multimodal multi-objective optimization problems (CMMOPs) commonly arise in practical problems in which multiple Pareto optimal sets (POSs) correspond to one Pareto optimal front (POF). The existence of constraints and multimodal characteristics makes it challenging to design effective algorithms that promote diversity in the decision space and convergence in the objective space. Therefore, this paper proposes a novel constrained multimodal multi-objective evolutionary algorithm, namely CM-MOEA, to address CMMOPs. In CM-MOEA, an adaptive epsilon-constrained method is designed to utilize promising infeasible solutions, promoting exploration in the search space. Then, a diversity-based offspring generation method is performed to select diverse solutions for mutation, searching for more equivalent POSs. Furthermore, the two-level environmental selection strategy that combines local and global environmental selection is developed to guarantee diversity and convergence of solutions. Finally, we design an archive update strategy that stores well-distributed excellent solutions, which more effectively approach the true POF. The proposed CM-MOEA is compared with several state-of-the-art algorithms on 17 test problems. The experimental results demonstrate that the proposed CM-MOEA has significant advantages in solving CMMOPs.
求助全文
约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学术官方微信