Rank-based Non-dominated Sorting

Abstract

Non-dominated sorting is a computational bo leneck in Pareto-based multi-objective evolutionary algorithms (MOEAs) due to the runtime-intensive comparison operations involved in establishing dominance relationships between solution candidates. In this paper we introduce Rank Sort, a non-dominated sorting approach exploiting sorting stability and ordinal information to avoid expensive dominance comparisons in the rank assignment phase. Two algorithmic variants are proposed: the rst one, RankOrdinal (RO), uses ordinal rank comparisons in order to determine dominance and requires 𝑂 (𝑁 ) space; the second one, RankIntersect (RS), uses set intersections and bit-level parallelism and requires 𝑂 (𝑁 2 ) space. We demonstrate the e ciency of the proposed methods in comparison with other state of the art algorithms in empirical simulations using the NSGA2 algorithm as well as synthetic benchmarks.e RankIntersect algorithm is able to signi cantly outperform the current state of the art o ering up to 30% speed-up for many objectives. C++ implementations are provided for all algorithms.