Fast implementation of the steady-state NSGA-II algorithm for two dimensions based on incremental non-dominated sorting

GECCO 2015 - Proceedings of the 2015 Genetic and Evolutionary Computation Conference

Volumn , Issue , 2015, Pages 647-654

  Buzdalov, Maxim ^a   Yakupov, Ilya ^a   Stankevich, Andrey ^a  

^a ITMO UNIVERSITY   (Russian Federation)

Author keywords

Incremental updates; Multi objective; Non dominated sorting; NSGA II; Steady state

Indexed keywords

EVOLUTIONARY ALGORITHMS; GENETIC ALGORITHMS; MULTIOBJECTIVE OPTIMIZATION; OPTIMIZATION; SORTING;

INCREMENTAL UPDATES; MULTI OBJECTIVE; NON-DOMINATED SORTING; NSGA-II; STEADY STATE;

ALGORITHMS;

EID: 84963682335     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2739480.2754728     Document Type: Conference Paper

References (19)

1. H. A. Abbass, R. Sarker, and C. Newton. PDE: A Pareto Frontier Differential Evolution Approach for Multiobjective Optimization Problems. In Proceedings of the Congress on Evolutionary Computation, pages 971-978. IEEE Press, 2001.
2. M. Buzdalov and A. Shalyto. A provably asymptotically fast version of the generalized Jensen algorithm for non-dominated sorting. In International Conference on Parallel Problem Solving from Nature, number 8672 in Lecture Notes in Computer Science, pages 528-537. 2014.
3. D. W. Corne, N. R. Jerram, J. D. Knowles, and M. J. Oates. PESA-II: Region-based Selection in Evolutionary Multiobjective Optimization. In Proceedings of Genetic and Evolutionary Computation Conference, pages 283-290. Morgan Kaufmann Publishers, 2001.
4. D. W. Corne, J. D. Knowles, and M. J. Oates. The Pareto Envelope-based Selection Algorithm for Multiobjective Optimization. sIn Parallel Problem Solving from Nature Parallel Problem Solving from Nature VI, number 1917 in Lecture Notes in Computer Science, pages 839-848. Springer, 2000.
5. K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan. A Fast Elitist Multi-Objective Genetic Algorithm: NSGA-II. Transactions on Evolutionary Computation, 6:182-197, 2000.
6. K. Deb, L. Thiele, M. Laumanns, and E. Zitzler. Scalable Test Problems for Evolutionary Multiobjective Optimization, pages 105-145. Springer, 2005.
7. F.-A. Fortin, S. Grenier, and M. Parizeau. Generalizing the Improved Run-time Complexity Algorithm for Non-dominated Sorting. In Proceeding of the Fifteenth Annual Conference on Genetic and Evolutionary Computation Conference, GECCO '13, pages 615-622. ACM, 2013.
8. S. Huband, P. Hingston, L. Barone, and R. L. While. A review of multiobjective test problems and a scalable test problem toolkit. IEEE Transactions on Evolutionary Computation, 10(5):477-506, 2006.
9. M. T. Jensen. Reducing the Run-time Complexity of Multiobjective EAs: The NSGA-II and Other Algorithms. Transactions on Evolutionary Computation, 7(5):503-515, 2003.
10. J. D. Knowles and D. W. Corne. Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy. Evolutionary Computation, 8(2):149-172, 2000.
11. H. T. Kung, F. Luccio, and F. P. Preparata. On finding the maxima of a set of vectors. Journal of ACM, 22(4):469-476, 1975.
12. K. Li, K. Deb, Q. Zhang, and S. Kwong. Efficient non-domination level update approach for steady-state evolutionary multiobjective optimization. Technical report, 2014.
13. A. J. Nebro and J. J. Durillo. On the effect of applying a steady-state selection scheme in the multi-objective genetic algorithm NSGA-II. In Nature-Inspired Algorithms for Optimisation, number 193 in Studies in Computational Intelligence, pages 435-456. Springer Berlin Heidelberg, 2009.
14. D. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. Journal of ACM, 32(3):652-686, 1985.
15. J. Vuillemin. A unifying look at data structures. Communications of ACM, 23(4):229-239, 1980.
16. I. Yakupov and M. Buzdalov. Incremental non-dominated sorting with O (N) insertion for the two-dimensional case. In Proceedings of IEEE Congress on Evolutionary Computation, 2015 (to appear).
17. E. Zitzler, K. Deb, and L. Thiele. Comparison of multiobjective evolutionary algorithms: Empirical results. Evolutionary Computation, 8(2):173-195, 2000.
18. E. Zitzler, M. Laumanns, and L. Thiele. SPEA2: Improving the Strength Pareto Evolutionary Algorithm for Multiobjective Optimization. In Proceedings of the EUROGEN'2001 Conference, pages 95-100, 2001.
19. E. Zitzler and L. Thiele. Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach. IEEE Transactions on Evolutionary Computation, 3(4):257-271, 1999.