P-ENS: Parallelism in Efficient Non-Dominated Sorting
Sumit Mishra, Carlos A. Coello Coello · 2018
In recent years, several non-dominated sorting approaches have been proposed. Non-dominated sorting is an essential part of Pareto dominance-based multi-objective evolutionary algorithms (MOEAs) and therefore the relevance of being able to perform such process as efficiently as possible is important. As the use of parallelism has become increasingly popular within MOEAs, there is an evident need for parallel implementations of non-dominated sorting algorithms. In this paper, we have focused on an efficient non-dominated sorting (ENS) approach and explored its parallelization. The time complexity of the parallel version of ENS is theoretically analyzed in four different scenarios.