.png){kind=icon}
.png){kind=icon}
Return
An Indicator-Based Evolutionary Algorithm for Large-Scale Constrained Multiobjective Optimization
.png){kind=icon}
PRE
AI
DOI：10.1109/TEVC.2025.3544287.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Most existing constrained multiobjective evolutionary algorithms (CMOEAs) experience a dramatic performance degradation when solving large-scale constrained multiobjective optimization problems (LSCMOPs), since they converge very slowly and easily get trapped in local optima due to the loss of diversity. To enhance the efficiency of tackling LSCMOPs, this article proposes an indicator-based evolutionary algorithm, referred to as ILCMO. In ILCMO, two complementary indicators are proposed to assess the contribution of each individual to feasibility, convergence, and diversity. The first is a feasibility-oriented indicator designed to drive the population toward the feasible regions. The second is an infeasibility-assisted dynamic indicator, which comprises two relaxed constraint boundaries. Theoretical studies demonstrate that this dynamic indicator can effectively guide the population to focus on evenly searching the infeasible regions around feasible solutions to enhance local diversity. In addition, a variable grouping-based differential evolution (VGDE) strategy, which includes a group-based intralearning operator and a group-based interlearning operator, is devised to improve the quality of reproduction in large-scale search spaces. The effectiveness of the proposed algorithm is validated through comprehensive experiments on four benchmarks and a microgrid dispatch problem against seven state-of-the-art algorithms.
Keywords:
Constrained multiobjective optimization
differential evolution (DE)
indicator
large-scale
variable grouping
Journal
IF:
12
Papers:
1.8K
Citations:
2.4W
View more organizations