论文信息 - A Provably Asymptotically Fast Version of the Generalized Jensen Algorithm for Non-dominated Sorting

A Provably Asymptotically Fast Version of the Generalized Jensen Algorithm for Non-dominated Sorting

The non-dominated sorting algorithm by Jensen, generalized by Fortin et al to handle the cases of equal objective values, has the running time complexity of O(N log K − 1 N) in the general case. Here N is the number of points, K is the number of objectives and K is thought to be a constant when N varies. However, the complexity was not proven to be the same in the worst case.

Maxim Buzdalov | Anatoly Shalyto | A. Shalyto | M. Buzdalov

[1] David W. Corne,et al. Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy , 2000, 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] Marc Parizeau,et al. Generalizing the improved run-time complexity algorithm for non-dominated sorting , 2013, GECCO '13.

[4] Aravind Seshadri,et al. A FAST ELITIST MULTIOBJECTIVE GENETIC ALGORITHM: NSGA-II , 2000 .

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

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

[7] Martin J. Oates,et al. The Pareto Envelope-Based Selection Algorithm for Multi-objective Optimisation , 2000, PPSN.

[8] H. Abbass,et al. PDE: a Pareto-frontier differential evolution approach for multi-objective optimization problems , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[9] Martin J. Oates,et al. PESA-II: region-based selection in evolutionary multiobjective optimization , 2001 .

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