Comparison of data structures for storing Pareto-sets in MOEAs

Author

Mostaghim, Sanaz ; Teich, Jürgen ; Tyagi, Ambrish

Author_Institution

Dept. of Electr. Eng., Paderborn Univ., Germany

Volume

1

fYear

2002

Firstpage

843

Lastpage

848

Abstract

In MOEAs with elitism, the data structures and algorithms for storing and updating archives may have a great impact on the CPU time, especially when optimizing continuous problems with larger population sizes. In this paper, we introduce quadtrees as an efficient data structure for storing Pareto-points. Apart from conventional linear lists, we have implemented three kinds of quadtrees for the archives. These data structures were examined for different examples. The results presented show that linear lists perform better in terms of CPU time for small population sizes whereas tree structures perform better for large population sizes

Keywords

evolutionary computation; optimisation; quadtrees; CPU time; Pareto set storage; archive storage; archive updating; continuous problem optimization; data structures; elitism; linear lists; multi-objective evolutionary algorithms; population sizes; quadtrees; Data structures; Evolutionary computation; Optimization methods; Search methods; Simulated annealing; Stochastic processes; Sun; Testing; Tree data structures; Vectors;

fLanguage

English

Publisher

ieee

Conference_Titel

Evolutionary Computation, 2002. CEC '02. Proceedings of the 2002 Congress on

Conference_Location

Honolulu, HI

Print_ISBN

0-7803-7282-4

Type

conf

DOI

10.1109/CEC.2002.1007035

Filename

1007035