.png){kind=icon}
Return
An Adaptative Reference Vector Based Evolutionary Algorithm for Many-Objective Optimization
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2019.2923422.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Recent studies have shown difficulties in balancing convergence and diversity for many-objective optimization problems with various types of Pareto fronts. This paper proposes an adaptive reference vector based evolutionary algorithm for many-objective optimization, termed as ARVEA. The ARVEA develops a reference vector adaptation method, which can adapt different types of Pareto fronts by adjusting the distribution of reference vectors. Besides, this algorithm adopts Pareto dominance as the first selection criterion, and the achievement scalarizing function (ASF) is introduced as the secondary selection criterion. The empirical results demonstrate that the proposed ARVEA has good performance for solving problems with various types of Pareto fronts, surpassing several state-of-the-art evolutionary algorithms designed for many-objective optimization.
Keywords:
Many-objective optimization
evolutionary algorithm
convergence
diversity
reference vector
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
Organization
Cited Papers
ShareSaveRefining Estimates of Bird Collision and Electrocution Mortality at Power Lines in the United States.png)
PLoS ONEOAAI
PLoS ONEIF0
OAAIShareSaveShareSaveShareSave
View more