Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques
Dellnitz M, Mostaghim S, Schütze O, Teich J (2003)
Publication Type: Conference contribution
Publication year: 2003
Journal
Publisher: Springer-verlag
Edited Volumes: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Series: Covering Pareto Sets by Multilevel
Pages Range: 118-132
Conference Proceedings Title: Proceedings of the Second International Conference on Evolutionary Multi-Criterion Optimization (EMO)
Event location: Faro
Abstract
We present new hierarchical set oriented methods for the numerical solution of multi-objective optimization problems. These methods are based on a generation of collections of subdomains (boxes) in parameter space which cover the entire set of Pareto points. In the course of the subdivision procedure these coverings get tighter until a desired granularity of the covering is reached. For the evaluation of these boxes we make use of evolutionary algorithms. We propose two particular strategies and discuss combinations of those which lead to a better algorithmic performance. Finally we illustrate the efficiency of our methods by several examples. © Springer-Verlag Berlin Heidelberg 2003.
Authors with CRIS profile
Related research project(s)
Involved external institutions
Germany (DE)How to cite
APA:
Dellnitz, M., Mostaghim, S., Schütze, O., & Teich, J. (2003). Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques. In Proceedings of the Second International Conference on Evolutionary Multi-Criterion Optimization (EMO) (pp. 118-132). Faro, PT: Springer-verlag.
MLA:
Dellnitz, Michael, et al. "Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques." Proceedings of the Second International Conference on Evolutionary Multi-Criterion Optimization (EMO),, Faro Springer-verlag, 2003. 118-132.
BibTeX: Download