A parallel naive approach for non-dominated sorting: a theoretical study considering PRAM CREW model

Pareto-based multi-objective evolutionary algorithms use non-dominated sorting as an intermediate step. These algorithms are easy to parallelize as various steps of these algorithms are independent of each other. Researchers have focused on the parallelization of non-dominated sorting in order to reduce the execution time of these algorithms. In this paper, we focus on one of the initial approaches for non-dominated sorting also known as naive approach, proposed by Srinivas et al. and explore the scope of parallelism in this approach. Parallelism is explored in the considered approach in three different ways considering Parallel Random Access Machine, Concurrent Read Exclusive Write model. The time and space complexities of three different parallel versions are also analyzed. Analysis of parallel algorithms is usually carried out under the assumption that an unbounded number of processors are available. Thus, the same assumption has been considered in our analysis too and we have obtained the maximum number of processors required for three parallel versions.

[1]  Ye Tian,et al.  A Decision Variable Clustering-Based Evolutionary Algorithm for Large-Scale Many-Objective Optimization , 2018, IEEE Transactions on Evolutionary Computation.

[2]  Mikkel T. Jensen,et al.  Reducing the run-time complexity of multiobjective EAs: The NSGA-II and other algorithms , 2003, IEEE Trans. Evol. Comput..

[3]  Sriparna Saha,et al.  MBOS: Modified Best Order Sort Algorithm for Performing Non-Dominated Sorting , 2018, 2018 IEEE Congress on Evolutionary Computation (CEC).

[4]  Leocadio G. Casado,et al.  Non-dominated sorting procedure for Pareto dominance ranking on multicore CPU and/or GPU , 2017, J. Glob. Optim..

[5]  Ujjwal Maulik,et al.  Evolutionary Rough Parallel Multi-Objective Optimization Algorithm , 2010, Fundam. Informaticae.

[6]  Ye Tian,et al.  An Efficient Approach to Nondominated Sorting for Evolutionary Multiobjective Optimization , 2015, IEEE Transactions on Evolutionary Computation.

[7]  Carlos A. Coello Coello,et al.  P-ENS: Parallelism in Efficient Non-Dominated Sorting , 2018, 2018 IEEE Congress on Evolutionary Computation (CEC).

[8]  Virginia Niculescu,et al.  Data-Distributions in PowerList Theory , 2007, ICTAC.

[9]  Kalyanmoy Deb,et al.  Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms , 1994, Evolutionary Computation.

[10]  Anna Syberfeldt,et al.  A New Algorithm Using the Non-Dominated Tree to Improve Non-Dominated Sorting , 2017, Evolutionary Computation.

[11]  Sriparna Saha,et al.  Fast implementation of steady-state NSGA-II , 2016, 2016 IEEE Congress on Evolutionary Computation (CEC).

[12]  Man Leung Wong,et al.  Data Mining Using Parallel Multi-objective Evolutionary Algorithms on Graphics Processing Units , 2013, Massively Parallel Evolutionary Computation on GPGPUs.

[13]  Joseph JáJá,et al.  An Introduction to Parallel Algorithms , 1992 .

[14]  Sriparna Saha,et al.  Divide and conquer based non-dominated sorting for parallel environment , 2016, 2016 IEEE Congress on Evolutionary Computation (CEC).

[15]  Kiyoshi Tanaka,et al.  Computational Cost Reduction of Nondominated Sorting Using the M-Front , 2015, IEEE Transactions on Evolutionary Computation.

[16]  Dominik Zelazny,et al.  Very Fast Non-dominated Sorting , 2014 .

[17]  Carlos A. Coello Coello,et al.  GBOS: Generalized Best Order Sort algorithm for non-dominated sorting , 2018, Swarm Evol. Comput..

[18]  Qingfu Zhang,et al.  Efficient Nondomination Level Update Method for Steady-State Evolutionary Multiobjective Optimization , 2017, IEEE Transactions on Cybernetics.

[19]  Kalyanmoy Deb,et al.  An Efficient Nondominated Sorting Algorithm for Large Number of Fronts , 2019, IEEE Transactions on Cybernetics.

[20]  Maxim Buzdalov,et al.  A Provably Asymptotically Fast Version of the Generalized Jensen Algorithm for Non-dominated Sorting , 2014, PPSN.

[21]  Erik D. Goodman,et al.  A novel non-dominated sorting algorithm for evolutionary multi-objective optimization , 2017, J. Comput. Sci..

[22]  Ki-Joo Kim,et al.  Parallel multiobjective evolutionary algorithms for waste solvent recycling , 2004 .

[23]  Marc Parizeau,et al.  Generalizing the improved run-time complexity algorithm for non-dominated sorting , 2013, GECCO '13.

[24]  Qian Wang,et al.  An Efficient Non-dominated Sorting Method for Evolutionary Algorithms , 2008, Evolutionary Computation.

[25]  Kalyanmoy Deb,et al.  An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints , 2014, IEEE Transactions on Evolutionary Computation.

[26]  Enrique Alba,et al.  Parallel Multiobjective Evolutionary Algorithms , 2015, Handbook of Computational Intelligence.

[27]  Sriparna Saha,et al.  Improved solution to the non-domination level update problem , 2015, Appl. Soft Comput..

[28]  Maxim Buzdalov,et al.  Improved incremental non-dominated sorting for steady-state evolutionary multiobjective optimization , 2017, GECCO.

[29]  Xin Yao,et al.  Corner Sort for Pareto-Based Many-Objective Optimization , 2014, IEEE Transactions on Cybernetics.

[30]  Gary B. Lamont,et al.  Considerations in engineering parallel multiobjective evolutionary algorithms , 2003, IEEE Trans. Evol. Comput..

[31]  José A. Martínez,et al.  Improving the performance and energy of Non-Dominated Sorting for evolutionary multiobjective optimization on GPU/CPU platforms , 2018, Journal of Global Optimization.

[32]  Vadim E. Kotov,et al.  Algorithms, Software and Hardware of Parallel Computers , 1984, Springer Berlin Heidelberg.

[33]  Samarth Gupta,et al.  A scalable parallel implementation of evolutionary algorithms for multi-objective optimization on GPUs , 2015, 2015 IEEE Congress on Evolutionary Computation (CEC).

[34]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[35]  Kent McClymont,et al.  Deductive Sort and Climbing Sort: New Methods for Non-Dominated Sorting , 2012, Evolutionary Computation.

[36]  George Karypis,et al.  Introduction to Parallel Computing , 1994 .

[37]  Kalyanmoy Deb,et al.  Best Order Sort: A New Algorithm to Non-dominated Sorting for Evolutionary Multi-objective Optimization , 2016, GECCO.

[38]  Zixing Cai,et al.  A Fast Method of Constructing the Non-dominated Set: Arena's Principle , 2008, 2008 Fourth International Conference on Natural Computation.