.png){kind=icon}
.png){kind=icon}
Return
Many-objective evolutionary algorithm based on adaptive weighted decomposition
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2019.105731.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Decomposition is a representative method for handling many-objective optimization problems with evolutionary algorithms. Classical decomposition scheme relies on a set of uniformly distributed reference vectors to divide the objective space into multiple subregions. This scheme often works poorly when the problem has an irregular Pareto front due to the inconsistency between the distribution of reference vectors and the shape of Pareto fronts. We propose in this paper an adaptive weighted decomposition based many-objective evolutionary algorithm to tackle complicated many-objective problems whose Pareto fronts may or may not be regular. Unlike traditional decomposition based algorithms that use a pre-defined set of reference vectors, the reference vectors in the proposed algorithm are produced from the population during the search. The experiments show that the performance of the proposed algorithm is competitive with other state-of-the-art algorithms and is less-sensitive to the irregularity of the Pareto fronts. (C) 2019 Elsevier B.V. All rights reserved.
Keywords:
Many-objective optimization
Evolutionary algorithm
Objective space decomposition
Adaptive weight generation
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