.png){kind=icon}
Return
An adaptive reference vector guided many-objective optimization algorithm based on the pareto front density estimation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2024.101601.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The performance of evolutionary algorithms using reference vectors to guide the evolution process mainly depends on the adaptive reference vector update strategy. In order to solve the challenging many-objective optimization problems with irregular Pareto fronts, this paper proposes an adaptive reference vector update strategy based on the Pareto front density estimation, which estimates the true Pareto front by finding sparse regions while ensuring the uniform distribution of reference vectors. In addition, an improved environmental selection strategy using the angle-based neighborhood density estimation has been proposed for estimating the neighborhood density to effectively guide the population evolution. On this basis, this paper proposes an adaptive reference vector guided many-objective optimization algorithm based on Pareto front density estimation (MaOEA-PDE). Experimental results on a large number of benchmark problems show MaOEA-PDE achieves better performance compared with some state-of-the-art algorithms in the literature.
Keywords:
Evolutionary algorithm
Multi -objective optimization
Many -objective optimization
Many -objective evolutionary algorithm
Journal
IF:
8.5
Papers:
2.2K
Citations:
1.0W
Organization
Cited Papers
ShareSave
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach
PREAI
ShareSavePreference-inspired coevolutionary algorithm based on differentiated space for many-objective problems.png)
SOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
ShareSave
View more