Very fast non-dominated sorting

Tyt. z nagłówka.Bibliogr. s. 22-23.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.Dostępny również w formie drukowanej.KEYWORDS: parallel algorithms, Pareto sorting, computational complexity, GPU computing, multiple-criteria decision analysis, NSGA-II