Using an adaptation of a binary search tree to improve the NSGA-II nondominated sorting procedure

Authors:
João Batista Mendes;João Antônio de Vasconcelos
Affiliations:
Universidade Estadual de Montes Claros, Montes Claros, MG and Evolutionary Computation Laboratory, Universidade Federal de Minas Gerais, Belo Horizonte/Minas Gerais, Brasil;Evolutionary Computation Laboratory, Universidade Federal de Minas Gerais, Belo Horizonte/Minas Gerais, Brasil
Venue:
SEAL'10 Proceedings of the 8th international conference on Simulated evolution and learning
Year:
2010

Citing 7
Cited 0

An efficient approach to unbounded bi-objective archives -: introducing the mak_tree algorithm

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)

Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)
An efficient non-dominated sorting method for evolutionary algorithms

Evolutionary Computation
Improving NSGA-II with an adaptive mutation operator

Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
A fast and elitist multiobjective genetic algorithm: NSGA-II

IEEE Transactions on Evolutionary Computation
Using unconstrained elite archives for multiobjective optimization

IEEE Transactions on Evolutionary Computation
Reducing the run-time complexity of multiobjective EAs: The NSGA-II and other algorithms

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose an adaptation to Nondominated Sorting Genetic Algorithm (NSGA-II), introducing a data structure, called NonDominated Tree (NDT). The NDT is an adaptation of a Binary Search Tree and is used to identify the nondominated fronts in only one run. This structure may be used to improve even more the performance of NSGA-II and other Evolutionary Algorithms (EAs) that use nondominated sorting procedures. It reduces the number of comparisons performed by the NSGA-II nondominated sorting routine. Some tests demonstrated that the proposed structure improves the search of fronts of nondominated solutions in an efficient way.