Abstract
Pareto optimization methods are usually expected to find well-distributed approximations of Pareto fronts with basic geometry, such as smooth, convex and concave surfaces. In this contribution, test-problems are proposed for which the Pareto front is the intersection of a Lamé supersphere with the positive ℝn-orthant. Besides scalability in the number of objectives and decision variables, the proposed test problems are also scalable in a characteristic we introduce as resolvability of conflict, which is closely related to convexity/concavity, curvature and the position of knee-points of the Pareto fronts.
As a very basic bi-objective problem we propose a generalization of Schaffer’s problem. We derive closed-form expressions for the efficient sets and the Pareto fronts, which are arcs of Lamé supercircles. Adopting the bottom-up approach of test problem construction, as used for the DTLZ test-problem suite, we derive test problems of higher dimension that result in Pareto fronts of superspherical geomery.
Geometrical properties of these test-problems, such as concavity and convexity and the position of knee-points are studied. Our focus is on geometrical properties that are useful for performance assessment, such as the dominated hypervolume measure of the Pareto fronts. The use of these test problems is exemplified with a case-study using the SMS-EMOA, for which we study the distribution of solution points on different 3-D Pareto fronts.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
- Test Problem
- Pareto Front
- Multiobjective Optimization
- Good Compromise Solution
- Pareto Front Approximation
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Deb, K.: Multi-objective genetic algorithms: Problem difficulties and construction of test problems. ECJ 7, 205–230 (1999)
Deb, K., Agrawal, S., Pratab, A., Meyarivan, T.: A Fast Elitist Non-Dominated Sorting Genetic Algorithm for Multi-Objective Optimization: NSGA-II. In: Deb, K., Rudolph, G., Lutton, E., Merelo, J.J., Schoenauer, M., Schwefel, H.-P., Yao, X. (eds.) PPSN 2000. LNCS, vol. 1917, pp. 849–858. Springer, Heidelberg (2000)
Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable Test Problems for Evolutionary Multiobjective Optimization, TIK-Technical Report 112, Institut für Technische Informatik und Kommunikationsnetze, ETH Zürich, Switzerland (2001)
Ehrgott, M.: Multicriteria Optimization. Springer, Berlin (2005)
Emmerich, M., Beume, N., Naujoks, B.: An EMO Algorithm Using the Hypervolume Measure as Selection Criterion. In: Coello Coello, C.A., Hernández Aguirre, A., Zitzler, E. (eds.) EMO 2005. LNCS, vol. 3410, pp. 62–76. Springer, Heidelberg (2005)
Emmerich, M.: A Rigorous Analysis of Two Bi-Criteria Problem Families with Scalable Curvature of the Pareto Fronts, LIACS-TR 2005-05, Leiden Univ. (2005)
Emmerich, M., Deutz, A.: Multiobjective Test Problems with Superspherical Pareto Fronts, LIACS TR 2006-05, Leiden Univ. (2006)
Huband, S., Hingston, P., Barone, L., Whyle, L.: A Review of Multiobjective Test Problems and a Scalable Test Problem Kit. IEEE Transactions on Evolutionary Computation 10(5), 477–506 (2006)
Naujoks, B., Beume, N., Emmerich, M.: Multi-objective optimisation using S-metric selection: Application to three-dimensional solution spaces. In: Proc. Conf. IEEE-CEC’05, pp. 1282–1289. IEEE-Press, Piscataway (2005)
Van Veldhuizen, V.A., Lamont, G.B.: Multiobjective Evolutionary Algorithm Test Suites. In: 1999 ACM Symp. on Applied Computing, pp. 351–357. ACM Press, New York (1999)
Weissstein, E.W.: Superellipsoid. From MathWorld - A Wolfram Web Resource (August 2004), http://mathworld.wolfram.com/Superellipsoid.html
Weissstein, E.W.: Superellipse. From MathWorld - A Wolfram Web Resource (September 2005), http://mathworld.wolfram.com/Superellipse.html
Weissstein, E.W.: Hypersphere. From MathWorld - A Wolfram Web Resource (April 2006), http://mathworld.wolfram.com/Hypersphere.html
Rockafeller, R.T.: Convex Analysis. Princeton University Press, Princeton (1996)
Schaffer, J.D.: Multiple objective optimization with vector evaluated genetic algorithms. In: Proceedings of the first International Conference on Genetic Algorithms, Lawrence Erlbaum, Mahwah (1985)
Zitzler, E.: Evolutionary Algorithms for Multiobjective Optimization: Methods and Applications. PhD thesis, Swiss Federal Institute of Technology (ETH), Zurich, Switzerland (November 1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Emmerich, M.T.M., Deutz, A.H. (2007). Test Problems Based on Lamé Superspheres. 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_68
Download citation
DOI: https://doi.org/10.1007/978-3-540-70928-2_68
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)