Abstract
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.
Supported in part by the German Science Foundation (DFG), SFB 694.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Deb, K.: Multi-Objective Optimization using Evolutionary Algorithms. John Wiley & Sons, Chichester (2001)
Coello Coello, C.A., Van Veldhuizen, D.A., Lamont, G.B.: Evolutionary Algorithms for Solving Multi-Objective Problems. Kluwer Academic Publishers, Dordrecht (2002)
Rudolph, G., Agapie, A.: Convergence Properties of Some Multi-Objective Evolutionary Algorithms. In: Proceedings of the 2000 Congress on Evolutionary Computation (CEC00), San Diego, California, July, pp. 1010–1016 (2000)
Fieldsend, J.E., Everson, R.M., Singh, S.: Using Unconstrained Elite Archives for Multiobjective Optimization. IEEE Transactions on Evolutionary Computation 7(3), 305–323 (2003)
Schütze, O.: A New Data Structure for the Nondominance Problem in Multi-Objective Optimization. In: Proceedings of the Second International Conference on Evolutionary Multi-Criterion Optimization, FARO, Portugal, April, pp. 509–518 (2003)
Mostaghim, S., Teich, J.: Quad-Trees: A Data structure for Storing Pareto-Sets in Multi-Objective Evolutionary Algorithms with Elitism. Advanced Information and Knowledge Processing. In: Evolutionary Multiobjective Optimization – Theoretical Advances and Applications, pp. 81–104. Springer, London (2005)
Bryant, R.E.: Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers C-35(8), 677–691 (1986)
Habenicht, W.: Quad Trees, a Data Structure for Discrete Vector Optimization Problems. In: Lecture Notes in Economic and Mathematical Systems, pp. 136–145. Springer, Heidelberg (1983)
Pareto, V.: Cours d’Économie Politique, vol. 1. F. Rouge & Cie., Lausanne (1896)
Laumanns, M.: Analysis and Applications of Evolutionary Multiobjective Optimization Algorithms. PhD thesis, Eidgenössische Technische Hochschule Zürich (2003)
Gupta, P., Janardan, R., Smid, M., Dasgupta, B.: The Rectangle Enclosure and Point-Dominance Problems Revisited. International Journal of Computational Geometry and Applications 7(5), 437–455 (1997)
Bryant, R.E.: Symbolic Boolean Manipulation with Ordered Binary Decision Diagrams. Technical report, School of Computer Science, Carnegie Mellon University (1992)
Buddy: http://sourceforge.net/projects/buddy (2006)
Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable MultiObjective Optimization Test Problems. In: Proceedings of the 2002 Congress on Evolutionary Computation (CEC02), Piscataway, New Jersey, May, pp. 825–830 (2002)
Rudell, R.: Dynamic Variable Ordering for Ordered Binary Decision Diagrams. In: ICCAD ’93: Proceedings of the 1993 IEEE/ACM International Conference on Computer-Aided Design, pp. 42–47. IEEE Computer Society Press, Los Alamitos (1993)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Lukasiewycz, M., Glaß, M., Haubelt, C., Teich, J. (2007). Symbolic Archive Representation for a Fast Nondominance Test. In: Obayashi, S., Deb, K., Poloni, C., Hiroyasu, T., Murata, T. (eds) Evolutionary Multi-Criterion Optimization. EMO 2007. Lecture Notes in Computer Science, vol 4403. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70928-2_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-70928-2_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70927-5
Online ISBN: 978-3-540-70928-2
eBook Packages: Computer ScienceComputer Science (R0)