Symbolic archive representation for a fast nondominance test

Beitrag bei einer Tagung

Details zur Publikation

Autor(en): Lukasiewycz M, Glaß M, Haubelt C, Teich J
Jahr der Veröffentlichung: 2007
Seitenbereich: 111-125
ISBN: 9783540709275


Archives are used in Multi-Objective Evolutionary Algorithms to establish elitism. Depending on the optimization problem, an unconstrained archive may grow to an immense size. With the growing number of nondominated solutions in the archive, testing a new solution for nondominance against this archive becomes the main bottleneck during optimization. As a remedy to this problem, we will propose a new data structure on the basis of Binary Decision Diagrams (BDDs) that permits a nondominance test with a runtime that is independent from the archive size. For this purpose, the region in the objective space weakly dominated by the solutions in the archive is represented by a BDD. We will present the algorithms for constructing the BDD as well as the nondominance test. Moreover, experimental results from using this symbolic data structure will show the efficiency of our approach in test cases where many candidates have to be tested but only few have to be added to the archive. © Springer-Verlag Berlin Heidelberg 2007.

FAU-Autoren / FAU-Herausgeber

Glaß, Michael Prof. Dr.-Ing.
Juniorprofessur für Informatik
Haubelt, Christian Prof. Dr.-Ing.
Technische Fakultät
Teich, Jürgen Prof. Dr.-Ing.
Lehrstuhl für Informatik 12 (Hardware-Software-Co-Design)


Lukasiewycz, M., Glaß, M., Haubelt, C., & Teich, J. (2007). Symbolic archive representation for a fast nondominance test. (pp. 111-125). Matsushima, JP.

Lukasiewycz, Martin, et al. "Symbolic archive representation for a fast nondominance test." Proceedings of the 4th International Conference on Evolutionary Multi-Criterion Optimization, EMO 2007, Matsushima 2007. 111-125.


Zuletzt aktualisiert 2018-07-08 um 21:08