Comparison of data structures for storing Pareto-sets in MOEAs

Mostaghim S, Teich J, Tyagi A (2002)


Publication Status: Published

Publication Type: Conference contribution, Conference Contribution

Publication year: 2002

Publisher: IEEE Computer Society

Book Volume: 1

Pages Range: 843-848

Article Number: 1007035

Event location: Honolulu, HI US

DOI: 10.1109/CEC.2002.1007035

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.

Authors with CRIS profile

Related research project(s)

Involved external institutions

How to cite

APA:

Mostaghim, S., Teich, J., & Tyagi, A. (2002). Comparison of data structures for storing Pareto-sets in MOEAs. In Proceedings of the 2002 Congress on Evolutionary Computation, CEC 2002 (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: Download