Symbolic Archive Representation for a Fast Nondominance Test [chapter]

Martin Lukasiewycz, Michael Glaß, Christian Haubelt, Jürgen Teich
Lecture Notes in Computer Science  
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
more » ... ith 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.
doi:10.1007/978-3-540-70928-2_12 dblp:conf/emo/LukasiewyczGHT06 fatcat:5gj3zwfd6fhvln6zuupd6g5jci