arrow
Return

Learning-Based Temporal Sequence of Constrained Handling Selection for Constrained Multi-Objective Evolutionary Optimization

delete2025-06-30
delete0
PRE
AI
C
Chaoda Peng
S
S. Yan
C
Cankun Zhong
黄琼 cover
黄琼 (Qiong Huang)
C
Chunguo Wu
H
Han Huang
DOI:10.1109/TEVC.2025.3584207delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
constraint-handling techniques (CHTs) and genetic operators are two crucial components in constrained multi-objective evolutionary algorithms (CMOEAs). Recent research in most of CMOEAs has primarily focused on adaptive designs of these components to address various constrained multi-objective optimization problems (CMOPs). However, the evolutionary process of solving a CMOP can involve various characteristics, such as continuity, discreteness, degeneracy, or some combination thereof, necessitating the tailored selection of CHTs and genetic operators across different generations. This study conceptualizes these selections as a temporal sequence of constrained handling selection, where the time means the generation number. We argue that discovering the systematic patterns within the sequence based on the historical data of applying different selections significantly improves the performance of CMOEAs in finding Pareto optimal solutions. Based on this conceptualization, we propose a CMOEA with a deep reinforcement learning model for solving CMOPs. Specifically, the deep reinforcement learning model dynamically refines the selection of CHTs and genetic operators for upcoming generations by learning from the performance of previous selections, thereby enhancing the predictive accuracy for subsequent selections. Experiments are conducted to validate the performance of the proposed algorithm against nine CMOEAs on thirty-seven benchmark problems and an uncrewed aerial vehicle path planning problem. Experimental results show that the proposed algorithm substantially outperforms the compared algorithms regarding the obtained Pareto optimal solutions. In addition, the results verify that discovering the systematic patterns within the sequence for CMOEAs has a positive impact on solving CMOPs in terms of objective optimization and constraint satisfaction.
Keywords:
Constrained multi-objective optimization
deep reinforcement learning
evolutionary algorithm
temporal sequence of constrained handling selection

Journal

IEEE Transactions on Evolutionary Computation cover
IEEE Transactions on Evolutionary Computation
IF:
12
Papers:
1.8K
Citations:
2.4W

Organization

S
South China Agricultural University
Scholars:
3.1W
Papers: 1.5W
Citations: 2.6W
S
south china university of technology
Scholars:
6.7W
Papers: 5.1W
Citations: 85
J
Jilin University
Scholars:
8.6W
Papers: 5.5W
Citations: 8.9K
researcher View more organizations