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

Constraint-handling techniques 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 constraint-handling techniques 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 constraint-handling techniques 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 unmanned aerial vehicle path planning problem. Experimental results show that the proposed algorithm substantially outperforms the compared algorithms regarding the obtained Pareto optimal solutions. Additionally, 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.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Evolutionary Computation
Published
2025-01-01
DOI
https://doi.org/10.1109/tevc.2025.3584207
Citations
2
Primary Topic
Advanced Multi-Objective Optimization Algorithms
Type
article
Field-Weighted Citation Impact
3.01

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Chunguo Wu, Qiong Huang, Cankun Zhong, Chaoda Peng et al.
2 citations
IEEE Transactions on Evolutionary Computation
Advanced Multi-Objective Optimization Algorithms
3.01
article

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

Chunguo Wu, Qiong Huang, Cankun Zhong, Chaoda Peng, Han Huang, S. Yan
article en
2 citations

Abstract

Constraint-handling techniques 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 constraint-handling techniques 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 constraint-handling techniques 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 unmanned aerial vehicle path planning problem. Experimental results show that the proposed algorithm substantially outperforms the compared algorithms regarding the obtained Pareto optimal solutions. Additionally, 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.

IEEE Transactions on Evolutionary Computation
South China Agricultural University (CN), Jilin University (CN), South China University of Technology (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 8%
Advanced Multi-Objective Optimization Algorithms
3.01
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.