Anzeige
Erschienen in:
2010 | OriginalPaper | Buchkapitel
Using an Adaptation of a Binary Search Tree to Improve the NSGA-II Nondominated Sorting Procedure
verfasst von : João Batista Mendes, João Antônio de Vasconcelos
Erschienen in: Simulated Evolution and Learning
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.