.png){kind=icon}
Return
Adaptive multi-stage evolutionary search for constrained multi-objective optimization
.png){kind=icon}
OA
AI
DOI：10.1007/s40747-024-01542-9.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we propose a multi-stage evolutionary framework with adaptive selection (MSEFAS) for efficiently handling constrained multi-objective optimization problems (CMOPs). MSEFAS has two stages of optimization in its early phase of evolutionary search: one stage that encourages promising infeasible solutions to approach the feasible region and increases diversity, and the other stage that enables the population to span large infeasible regions and accelerates convergence. To adaptively determine the execution order of these two stages in the early process, MSEFAS treats the optimization stage with higher validity of selected solutions as the first stage and the other as the second one. In addition, at the late phase of evolutionary search, MSEFAS introduces a third stage to efficiently handle the various characteristics of CMOPs by considering the relationship between the constrained Pareto fronts (CPF) and unconstrained Pareto fronts. We compare the proposed framework with eleven state-of-the-art constrained multi-objective evolutionary algorithms on 56 benchmark CMOPs. Our results demonstrate the effectiveness of the proposed framework in handling a wide range of CMOPs, showcasing its potential for solving complex optimization problems.
Keywords:
Multi-stage evolutionary framework with adaptive selection
Constrained multiobjective optimization problems
Evolutionary search
Infeasible solutions
Journal
IF:
4.6
Papers:
2.1K
Citations:
6.6K
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveDynamic Auxiliary Task-Based Evolutionary Multitasking for Constrained Multiobjective Optimization
PREAI
ShareSaveShareSave
View more