.png){kind=icon}
Return
A two-stage bidirectional coevolution algorithm with reverse search for constrained multiobjective optimization
.png){kind=icon}
OA
AI
DOI：10.1007/s40747-024-01418-y.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Constrained multiobjective optimization problems (CMOPs) are widespread in reality. The presence of constraints complicates the feasible region of the original problem and increases the difficulty of problem solving. There are not only feasible regions, but also large areas of infeasible regions in the objective space of CMOPs. Inspired by this, this paper proposes a bidirectional coevolution method with reverse search (BCRS) combined with a two-stage approach. In the first stage of evolution, constraints are ignored and the population is pushed toward promising regions. In the second stage, evolution is divided into two parts, i.e., the main population evolves toward the constrained Pareto front (CPF) within the feasible region, while the reverse population approaches the CPF from the infeasible region. Then a solution exchange strategy similar to weak cooperation is used between the two populations. The experimental results on benchmark functions and real-world problems show that the proposed algorithm exhibits superior or at least competitive performance compared to other state-of-the-art algorithms. It demonstrates BCRS is an effective algorithm for addressing CMOPs.
Keywords:
Constrained multiobjective optimization
Evolutionary algorithm
Two-stage
Bidirectional coevolution
Reverse search
Journal
IF:
4.6
Papers:
2.1K
Citations:
6.6K
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
View more