Comparison of data structures for storing Pareto-sets in MOEAs

Conference contribution
(Conference Contribution)


Publication Details

Author(s): Mostaghim S, Teich J, Tyagi A
Publisher: IEEE Computer Society
Publication year: 2002
Volume: 1
Pages range: 843-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. © 2002 IEEE.



FAU Authors / FAU Editors

Teich, Jürgen Prof. Dr.-Ing.
Lehrstuhl für Informatik 12 (Hardware-Software-Co-Design)


External institutions with authors

Universität Paderborn


How to cite

APA:
Mostaghim, S., Teich, J., & Tyagi, A. (2002). Comparison of data structures for storing Pareto-sets in MOEAs. (pp. 843-848). Honolulu, HI, US: IEEE Computer Society.

MLA:
Mostaghim, Sanaz, Jürgen Teich, and Ambrish Tyagi. "Comparison of data structures for storing Pareto-sets in MOEAs." Proceedings of the 2002 Congress on Evolutionary Computation, CEC 2002, Honolulu, HI IEEE Computer Society, 2002. 843-848.

BibTeX: 

Last updated on 2018-04-11 at 13:50