arrow
Return

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 *
岳彩通 cover
岳彩通 (Caitong Yue)
Y
Yirui Wang
DOI:10.1016/j.swevo.2024.101652delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

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.
Keywords:
Constrained multimodal multi-objective optimization
Co-evolutionary
Exploration and exploitation
Constraint-relaxed
Convergence-relaxed

Journal

Swarm and Evolutionary Computation cover
Swarm and Evolutionary Computation
IF:
8.5
Papers:
2.1K
Citations:
1.0W

Organization

Z
Zhengzhou University
Scholars:
6.8W
Papers: 4.4W
Citations: 8.5W
Z
Zhengzhou University of Light Industry
Scholars:
6.4K
Papers: 4.0K
Citations: 5.4K
N
Ningbo University
Scholars:
2.6W
Papers: 1.8W
Citations: 2.4W
researcher View more organizations