An Approach for Non-domination Level Update Problem in Steady-State Evolutionary Algorithms With Parallelism

One of the bottlenecks in steady-state multiobjective evolutionary algorithms (MOEAs) is non-dominated sorting because it is performed every time whenever a new offspring is generated. The recent literature shows that there is no requirement to perform the complete non-dominated sorting procedure because the entire structure of non-domination level (NDL) does not change. Some approaches have been recently proposed based on this idea. In this paper, we update our previous work where an offspring is inserted into the set of fronts, to further reduce the number of dominance comparisons. Additionally, we also explore parallelism in the updated approach in two different manners considering the PRAM CREW model. Finally, the time and space complexities of two parallel versions is theoretically analyzed.

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

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

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

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

[5]  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.

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

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

[8]  Carlos A. Coello Coello,et al.  A divide-and-conquer based efficient non-dominated sorting approach , 2019, Swarm Evol. Comput..

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

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

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

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

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

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

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

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

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

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

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

[20]  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.

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

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

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

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

[25]  Enrique Alba,et al.  On the Effect of the Steady-State Selection Scheme in Multi-Objective Genetic Algorithms , 2009, EMO.

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

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

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

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

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

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