.png){kind=icon}
.png){kind=icon}
Return
A multi-objective evolutionary algorithm for steady-state constrained multi-objective optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2020.107042.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Many multi-objective evolutionary algorithms (MOEAs) are developed to solve constrained multiobjective optimization problems (CMOPs). However, they encounter low efficiency for steady-state CMOPs which are to optimize a known feasible solution named the current steady-state operation point. This paper proposes a multi-objective evolutionary algorithm (MOEA), termed FACE, for tackling the steady-state CMOPs. In FACE, the known feasible solution is maintained in the second population and evolves together with the main population. The main population is evolved by global search without handling constraints to accelerate the convergence. And the second population is evolved by local search to hold and achieve more feasible solutions. Two kinds of performance comparison between FACE and five representative MOEAs are made: the first using two cases of steady-state multisource compressed-air pipeline optimization problems to evaluate the performance of FACE on real life applications, and the second using a set of bench-mark test problems of CMOPs assigned with a known feasible solution to further assess the scalability of FACE. The results demonstrate the efficiency and the scalability of FACE with a potential for steady-state CMOPs. (C) 2020 Elsevier B.V. All rights reserved.
Keywords:
Multi-objective evolutionary algorithm
Steady-state constrained multi-objective
optimization
Co-evolution
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.6
Papers:
1.4W
Citations:
4.8W