.png){kind=icon}
.png){kind=icon}
Return
A dual-population auxiliary multiobjective coevolutionary algorithm for constrained multiobjective optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2024.111827.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The key to solving constrained multiobjective optimization problems (CMOPs) lies in maintaining the feasibility, convergence, and diversity of the population. In recent years, various constraint handling techniques (CHTs) and strategies have been proposed to enhance the performance of constrained multiobjective evolutionary algorithms (CMOEAs). However, most of these algorithms face difficulties in dealing with problems that have large infeasible regions and discontinuous small feasible regions, as they have trouble crossing large infeasible regions while simultaneously maintaining the convergence and diversity of the population. To tackle this issue, this paper proposes a dual-population auxiliary coevolutionary algorithm with an enhanced operator, denoted as DAEAEO. Auxiliary population 1 employs an improved epsilon-constraint handling technique to provide high-quality feasible solutions for the main population. Auxiliary population 2 adopts the non-dominated sorting method to provide favorable objective information for the main population to help it cross the infeasible region. In addition, to further improve diversity, each population adopts an enhanced operator and a genetic operator to generate offspring, respectively. Finally, knowledge transfer between offspring is realized. Compared to six state-of-the-art CMOEAs on DASCMOPs, LIR-CMOPs, DOC test suites, and two real-world problems, the proposed DAEAEO achieved superior performance, especially for CMOPs with large infeasible regions and discontinuous small feasible regions.
Keywords:
Dual-population auxiliary
Enhanced operator
Knowledge transfer
Constrained multiobjective optimization problems
Coevolutionary algorithm