Comparison of data structures for storing Pareto-sets in MOEAs

Beitrag bei einer Tagung
(Konferenzbeitrag)


Details zur Publikation

Autorinnen und Autoren: Mostaghim S, Teich J, Tyagi A
Verlag: IEEE Computer Society
Jahr der Veröffentlichung: 2002
Band: 1
Seitenbereich: 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-Autorinnen und Autoren / FAU-Herausgeberinnen und Herausgeber

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


Einrichtungen weiterer Autorinnen und Autoren

Universität Paderborn


Zitierweisen

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: 

Zuletzt aktualisiert 2019-23-07 um 07:45