arrow
返回

Balancing exploration and exploitation in dynamic constrained multimodal multi-objective co-evolutionary algorithm

delete2024-08-01
delete4
PRE
AI
G
Guoqing Li
W
Weiwei Zhang *
岳彩通 封面图
岳彩通 (Caitong Yue)
Y
Yirui Wang
DOI:10.1016/j.swevo.2024.101652delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Constrained multimodal multi-objective optimization (CMMOPs) involves multiple equivalent constrained Pareto optimal sets (CPSs) matching the same constrained Pareto front (CPF). An essential challenge in solving CMMOPs is how to balance exploration and exploitation in searching for the CPSs. To tackle this issue, a dynamic constrained co-evolutionary multimodal multi-objective algorithm termed DCMMEA is developed in this paper. DCMMEA involves a constraint-relaxed population for handling constraints and a convergence-relaxed population for improving convergence quality. Subsequently, a constraint-relaxed epsilon strategy that considers the constraint violation degree between individuals is designed and applied dynamically in the constraint-relaxed population to develop equivalent CPSs. Similarly, a dynamic convergence-relaxed epsilon strategy that considers the differences between objective values is developed and used dynamically in the convergence-relaxed population. It explores CPSs with high convergence quality and transfers the convergence knowledge to the constraint-relaxed population. Additionally, the constraint- relaxed population size is dynamically increased and the convergence-relaxed population size is dynamically decreased to balance the exploration and exploitation procedures. Experiments are performed on standard CMMOP test suites and validate that DCMMEA obtains superior performance on solving CMMOPs in comparison to state-of-the-art algorithms. Also, DCMMEA is implemented on standard CMOPs and demonstrated good performance in handling CMOPs.
Keyword:
Constrained multimodal multi-objective optimization
Co-evolutionary
Exploration and exploitation
Constraint-relaxed
Convergence-relaxed

期刊

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

机构

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

引用论文

err分享
err收藏
学者 查看更多内容