.png){kind=icon}
.png){kind=icon}
Return
Merge Nondominated Sorting Algorithm for Many-Objective Optimization
.png){kind=icon}
OA
AI
DOI：10.1109/TCYB.2020.2968301.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Many Pareto-based multiobjective evolutionary algorithms require ranking the solutions of the population in each iteration according to the dominance principle, which can become a costly operation particularly in the case of dealing with many-objective optimization problems. In this article, we present a new efficient algorithm for computing the nondominated sorting procedure, called merge nondominated sorting (MNDS), which has a best computational complexity of O(N logN) and a worst computational complexity of O(MN2), with N being the population size and M being the number of objectives. Our approach is based on the computation of the dominance set, that is, for each solution, the set of solutions that dominate it, by taking advantage of the characteristics of the merge sort algorithm. We compare MNDS against six well-known techniques that can be considered as the state-of-the-art. The results indicate that the MNDS algorithm outperforms the other techniques in terms of the number of comparisons as well as the total running time.
Keywords:
Evolutionary algorithms (EAs)
many-objective problems
multiobjective optimization
nondominated sorting
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.5
Papers:
1.1W
Citations:
5.0W
View more organizations