Best Order Sort: A New Algorithm to Non-dominated Sorting for Evolutionary Multi-objective Optimization

Finding the non-dominated sorting of a given set vectors has applications in Pareto based evolutionary multi-objective optimization (EMO), finding convex hull, linear optimization, nearest neighbor, skyline queries in database and many others. Among these, EMOs use this method for survival selection. The worst case complexity of this problem is found to be O(NlogM-1N) when the number of objectives M is constant and the size of solutions N is varying. But this bound becomes too large when M depends on N. In this paper we are proposing a new algorithm with worst case complexity O(MNlogN+MN2), however, with reduced running time in many objective cases. This algorithm can make use of the faster implementation of sorting algorithms. It removes unnecessary comparisons among the solutions which improves the running time. The proposed algorithm is compared with four other competing algorithms on three different datasets. Experimental results show that our approach, namely, best order sort (BOS) is computationally more efficient than all other compared algorithms with respect to running time.

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

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

[3]  C.A. Coello Coello,et al.  MOPSO: a proposal for multiple objective particle swarm optimization , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

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

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

[6]  Kazuyuki Murase,et al.  Evolutionary Path Control Strategy for Solving Many-Objective Optimization Problem , 2015, IEEE Transactions on Cybernetics.

[7]  Marco Laumanns,et al.  Scalable multi-objective optimization test problems , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[8]  Marco Laumanns,et al.  SPEA2: Improving the Strength Pareto Evolutionary Algorithm For Multiobjective Optimization , 2002 .

[9]  Peter J. Fleming,et al.  Diversity Management in Evolutionary Many-Objective Optimization , 2011, IEEE Transactions on Evolutionary Computation.

[10]  Jarek Gryz,et al.  Maximal Vector Computation in Large Data Sets , 2005, VLDB.

[11]  David E. Goldberg,et al.  A niched Pareto genetic algorithm for multiobjective optimization , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[12]  T. Simpson,et al.  Algorithms to identify pareto points in multi-dimensional data sets , 2004 .

[13]  Timothy W. Simpson,et al.  Analysis of an Algorithm for Identifying Pareto Points in Multi-Dimensional Data Sets , 2004 .

[14]  Louis Monier,et al.  Combinatorial Solutions of Multidimensional Divide-and-Conquer Recurrences , 1980, J. Algorithms.

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

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

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

[18]  Jon Louis Bentley,et al.  Multidimensional divide-and-conquer , 1980, CACM.

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

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

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

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

[23]  R. Lyndon While,et al.  A review of multiobjective test problems and a scalable test problem toolkit , 2006, IEEE Transactions on Evolutionary Computation.

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

[25]  H. Ishibuchi,et al.  MOGA: multi-objective genetic algorithms , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.

[26]  H. T. Kung,et al.  On the Average Number of Maxima in a Set of Vectors and Applications , 1978, JACM.

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

[28]  David Corne,et al.  The Pareto archived evolution strategy: a new baseline algorithm for Pareto multiobjective optimisation , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).