arrow
返回

Clustering-based evolutionary algorithm for constrained multimodal multi-objective optimization

delete2024-12-01
delete5
PRE
AI
G
Guoqing Li
W
Weiwei Zhang
岳彩通 封面图
岳彩通 (Caitong Yue)
G
Gary G. Yen *
DOI:10.1016/j.swevo.2024.101714delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Handling constrained multimodal multi-objective optimization problems (CMMOPs) is a tremendous challenge as it involves the discovery of multiple equivalent constrained Pareto sets (CPSs) with the identical constrained Pareto front (CPF). However, the existing constrained multi-objective evolutionary algorithms are rarely suitable for solving CMMOPs due to the fact that they focus solely on locating CPF and do not intend to search for multiple equivalent CPSs. To address this issue, this paper proposes a framework of clustering-based constrained multimodal multi-objective evolutionary algorithm, termed FCCMMEA. In the proposed FCCMMEA, we adopt a clustering method to separate the population into multiple subpopulations for locating diverse CPSs and maintaining population diversity. Subsequently, each subpopulation evolves independently to produce offspring by an evolutionary algorithm. To balance the convergence and feasibility, we develop a quality evaluation metric in the classification strategy that considers the local convergence quality and constraint violation values, and it divides the populations into superior and inferior populations according to the quality evaluation of individuals. Furthermore, we also employ a diversity maintenance methodology in environmental selection to maintain the diverse population. The proposed FCCMMEA algorithm is compared with seven state-of-the-art competing algorithms on a standard CMMOP test suite, and the experimental results validate that the proposed FCCMMEA enables to find multiple CPSs and is suitable for handling CMMOPs. Also, the proposed FCCMMEA won the first place in the 2023 IEEE Congress on Evolutionary Computation competition on CMMOPs.
Keyword:
Constrained multimodal multi-objective opti-
mization
Clustering
Evolutionary algorithm
Equivalent constrained Pareto sets

期刊

Swarm and Evolutionary Computation 封面图
Swarm and Evolutionary Computation
IF:
8.5
论文数:
2.2K
被引数:
1.0W

机构

Z
Zhengzhou University
学者数:
6.8W
论文数: 4.4W
被引数: 8.5W
O
oklahoma state university system
学者数:
8.3K
论文数: 7.3K
被引数: 6
Z
Zhengzhou University of Light Industry
学者数:
6.4K
论文数: 4.0K
被引数: 5.4K
N
Ningbo University
学者数:
2.6W
论文数: 1.8W
被引数: 2.4W
学者 查看更多机构
引用论文

引用论文

Push and pull search for solving constrained multi-objective optimization problems
err2019-02-01
err342
errOAAI
errFan, Zhun; Li, Wenji; Cai, Xinye; Li, Hui; Wei, Caimin; Zhang, Qingfu; Deb, Kalyanmoy; Goodman, Erik
err分享
err收藏
An improved epsilon constraint-handling method in MOEA/D for CMOPs with large infeasible regions
err2019-02-04
err238
PREAI
errFan, Zhun; Li, Wenji; Cai, Xinye; Huang, Han; Fang, Yi; You, Yugen; Mo, Jiajie; Wei, Caimin; Goodman, Erik
err分享
err收藏
学者 查看更多内容