.png){kind=icon}
.png){kind=icon}
Return
A knee-point-based evolutionary algorithm using weighted subpopulation for many-objective optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2019.02.001.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Among many-objective optimization problems (MaOPs), the proportion of nondominated solutions is too large to distinguish among different solutions, which is a great obstacle in the process of solving MaOPs. Thus, this paper proposes an algorithm which uses a weighted subpopulation knee point. The weight is used to divide the whole population into a number of subpopulation, and the knee point of each subpopulation guides other solutions to search. Additionally, the convergence of the knee point approach can be exploited, and the subpopulation-based approach improves performance by improving the diversity of the evolutionary algorithm. Therefore, these advantages can make the algorithm suitable for solving MaOPs. Experimental results show that the proposed algorithm performs better on most test problems than six other state-of-the-art many-objective evolutionary algorithms.
Keywords:
Knee point
Many-objective optimization
Decomposition
Convergence
Diversity
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.5
Papers:
2.2K
Citations:
1.0W