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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
D. Corne, M. Dorigo, and F. Glover. New Ideas in Optimization. Mc Graw Hill, 1999.
K. Deb. Multi-Objective Optimization using Evolutionary Algorithms. John Wiley & Sons, 2001.
K. Deb, S. Agrawal, A. Pratap, and T. Meyarivan. A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: Nsga-ii. In Parallel Problem Solving from Nature VI (PPSN-VI), pages 849–858, 2000.
M. Dellnitz, R. Elsässer, T. Hestermeyer, O. Schütze, and S. Sertl. Covering Pareto sets with multilevel subdivision techniques. to appear, 2002.
M. Dellnitz and A. Hohmann. The computation of unstable manifolds using subdivision and continuation. In H.W. Broer, S.A. van Gils, I. Hoveijn, and F. Takens, editors, Nonlinear Dynamical Systems and Chaos, pages 449–459. Birkhäuser, PNLDE 19, 1996.
M. Dellnitz and A. Hohmann. A subdivision algorithm for the computation of unstable manifolds and global attractors. Numerische Mathematik, 75:293–317, 1997.
M. Dellnitz, O. Schütze, and St. Sertl. Finding zeros by multilevel subdivision techniques. 2002.
D. E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Publishing Company, Inc., 1989.
A. Jüschke and J. Jahn. A bicriterial optimization problem of antenna design. Comp. Opt. Appl., 7:261–276, 1997.
H. Kuhn and A. Tucker. Nonlinear programming. Proc. Berkeley Symp. Math. Statist. Probability, 2nd, (J. Neumann, ed.), pages 481–492, 1951.
G. Rudolph. On a Multi-Objective Evolutionary Algorithm and Its Convergence to the Pareto Set. In 5th IEEE Conference on Evolutionary Computation, pages 511–516, 1998.
S. Schäffler, R. Schultz, and K. Weinzierl. A stochastic method for the solution of unconstrained vector optimization problems. To appear in J. Opt. Th. Appl., 2002.
E. Zitzler, M. Laumanns, and L. Thiele. SPEA2: Improving the strength Pareto evolutionary algorithm. In Evolutionary Methods for Design, Optimisation and Control with Applications to Industrial Problems, 2002.
E. Zitzler and L. Thiele. Multiobjective evolutionary algorithms: A comparative case study and and the strength Pareto approach. IEEE Trans. on Evolutionary Computation, 3(4):257–271, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schütze, O., Mostaghim, S., Dellnitz, M., Teich, J. (2003). Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Thiele, L., Deb, K. (eds) Evolutionary Multi-Criterion Optimization. EMO 2003. Lecture Notes in Computer Science, vol 2632. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36970-8_9
Download citation
DOI: https://doi.org/10.1007/3-540-36970-8_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-01869-8
Online ISBN: 978-3-540-36970-7
eBook Packages: Springer Book Archive