.png){kind=icon}
Return
Two-Archive Evolutionary Algorithm for Constrained Multiobjective Optimization
.png){kind=icon}
OA
AI
DOI：10.1109/TEVC.2018.2855411.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
When solving constrained multiobjective optimization problems, an important issue is how to balance convergence, diversity, and feasibility simultaneously. To address this issue, this paper proposes a parameter-free constraint handling technique, a two-archive evolutionary algorithm, for constrained multiobjective optimization. It maintains two collaborative archives simultaneously: one, denoted as the convergence-oriented archive (CA), is the driving force to push the population toward the Pareto front; the other one, denoted as the diversity-oriented archive (DA), mainly tends to maintain the population diversity. In particular, to complement the behavior of the CA and provide as much diversified information as possible, the DA aims at exploring areas under-exploited by the CA including the infeasible regions. To leverage the complementary effects of both archives, we develop a restricted mating selection mechanism that adaptively chooses appropriate mating parents from them according to their evolution status. Comprehensive experiments on a series of benchmark problems and a real-world case study fully demonstrate the competitiveness of our proposed algorithm, in comparison to five state-of-the-art constrained evolutionary multiobjective optimizers.
Keywords:
Constraint handling
evolutionary algorithm (EA)
decomposition-based technique
multiobjective optimization
two-archive strategy
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
12
Papers:
1.8K
Citations:
2.4W
Organization
View more organizations
Cited Papers
Refining Estimates of Bird Collision and Electrocution Mortality at Power Lines in the United States.png)
PLoS ONEOAAI
PLoS ONEIF0
OAAIShareSaveShareSaveMultiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach
PREAI
ShareSaveDuality evolution: an efficient approach to constraint handling in multi-objective particle swarm optimizationSOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
ShareSave
Main-chain-directed strategy for the assignment of proton NMR spectra of proteinsBiochemistry
BiochemistryIF0
PREAI
ShareSave View more