- Tytuł:
- Very Fast Non-Dominated Sorting
- Autorzy:
-
Smutnicki, C.
Rudy, J.
Żelazny, D. - Powiązania:
- https://bibliotekanauki.pl/articles/375948.pdf
- Data publikacji:
- 2014
- Wydawca:
- Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
- Tematy:
-
parallel algorithms
Pareto sorting
computational complexity
GPU computing
multiple criteria decision analysis
NSGA-II - Opis:
- A new and very efficient parallel algorithm for the Fast Non-dominated Sorting of Pareto fronts is proposed. By decreasing its computational complexity, the application of the proposed method allows us to increase the speedup of the best up to now Fast and Elitist Multi-Objective Genetic Algorithm (NSGA-II) more than two orders of magnitude. Formal proofs of time complexities of basic as well as improved versions of the procedure are presented. The provided experimental results fully confirm theoretical findings.
- Źródło:
-
Decision Making in Manufacturing and Services; 2014, 8, 1-2; 13-23
1896-8325
2300-7087 - Pojawia się w:
- Decision Making in Manufacturing and Services
- Dostawca treści:
- Biblioteka Nauki
Artykuł