KDT-MOEA: A multiobjective optimization framework based on K-D trees

This paper presents KDT-MOEA, a framework that takes advantage of a special kind of binary search tree, named K-D tree, to solve multiobjective optimization problems (MOPs). Our main goal is to explore the capabilities of this data structure to define neighborhood structures either in decision varia...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Information sciences Ročník 503; s. 200 - 218
Hlavní autoři: Lacerda, Allysson S.M., Batista, Lucas S.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 01.11.2019
Témata:
Evolutionary algorithms
K-D trees
Multiobjective optimization
Neighborhood operators
Spatial data structures
Spatial data structures
Neighborhood operators
Evolutionary algorithms
K-D trees
Multiobjective optimization
ISSN:0020-0255, 1872-6291
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper presents KDT-MOEA, a framework that takes advantage of a special kind of binary search tree, named K-D tree, to solve multiobjective optimization problems (MOPs). Our main goal is to explore the capabilities of this data structure to define neighborhood structures either in decision variables space or in objective space, as well as by switching between them at any time. The KDT-MOEA framework performance is compared with five state-of-the-art algorithms on the DTLZ, WFG and LZ09 benchmarking problems with up to 15 objectives. Statistical tests demonstrate that KDT-MOEA was able to outperform the compared methods on most problems. In addition, in order to evaluate the flexibility and the potential of the proposed operators, extended versions of the compared algorithms are also presented. Empirical results pointed out that the new versions were superior to all five original MOEAs, indicating that the proposed operators can also be easily incorporated into existing MOEAs with different strategies to achieve better results.
ISSN:0020-0255
1872-6291
DOI:10.1016/j.ins.2019.07.011