Very Fast Non-Dominated Sorting
Wroclaw University of Technology, Institute of Computer Engineering, Control and Robotics, Poland
Decision Making in Manufacturing and Services, Vol. 8, No. 1-2, pp. 13-23, 2014
@article{smutnicki2014very,
title={Very Fast Non-Dominated Sorting},
author={Smutnicki, Czes{l}aw and Rudy, Jaros{l}aw and {.Z}elazny, Dominik},
year={2014}
}
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.
February 24, 2015 by hgpu
