P-ENS: Parallelism in Efficient Non-Dominated Sorting

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.

[1]  Lishan Kang,et al.  A fast algorithm on finding the non-dominated set in multi-objective optimization , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

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

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

[4]  Jinhua Zheng,et al.  Some discussions about MOGAs: individual relations, non-dominated set, and application on automatic negotiation , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

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

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

[7]  Jun Du,et al.  A Sorting Based Algorithm for Finding a Non-dominated Set in Multi-objective Optimization , 2007, Third International Conference on Natural Computation (ICNC 2007).

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

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

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

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

[12]  Maxim Buzdalov,et al.  Fast Implementation of the Steady-State NSGA-II Algorithm for Two Dimensions Based on Incremental Non-Dominated Sorting , 2015, GECCO.

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

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

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

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

[17]  Jinhua Zheng,et al.  A New Method to Construct the Non-Dominated Set in Multi-Objective Genetic Algorithms , 2004, Intelligent Information Processing.

[18]  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).

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

[20]  Jonathan E. Fieldsend,et al.  Using unconstrained elite archives for multiobjective optimization , 2003, IEEE Trans. Evol. Comput..

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

[22]  Zhongzhi Shi,et al.  A Fast Nondominated Sorting Algorithm , 2005, 2005 International Conference on Neural Networks and Brain.

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

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

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

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

[27]  Jiong Shen,et al.  An Immune Recognition Based Algorithm for Finding Non-Dominated Set in Multi-Objective Optimization , 2008, 2008 IEEE Pacific-Asia Workshop on Computational Intelligence and Industrial Application.

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

[29]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[30]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

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

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

[33]  Kalyanmoy Deb,et al.  Omni-optimizer: A Procedure for Single and Multi-objective Optimization , 2005, EMO.