Test Problems Based on Lamé Superspheres

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 Lame supersphere with the positive Rn-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 Lame 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 geometry. 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 SMSEMOA, for which we study the distribution of solution points on different 3-D Pareto fronts.

[1]  Eckart Zitzler,et al.  Evolutionary algorithms for multiobjective optimization: methods and applications , 1999 .

[2]  Nicola Beume,et al.  Multi-objective optimisation using S-metric selection: application to three-dimensional solution spaces , 2005, 2005 IEEE Congress on Evolutionary Computation.

[3]  Kalyanmoy Deb,et al.  Multi-objective Genetic Algorithms: Problem Difficulties and Construction of Test Problems , 1999, Evolutionary Computation.

[4]  Nicola Beume,et al.  An EMO Algorithm Using the Hypervolume Measure as Selection Criterion , 2005, EMO.

[5]  Gary B. Lamont,et al.  Multiobjective evolutionary algorithm test suites , 1999, SAC '99.

[6]  M. Uschold,et al.  Methods and applications , 1953 .

[7]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[8]  Xin Yao,et al.  Parallel Problem Solving from Nature PPSN VI , 2000, Lecture Notes in Computer Science.

[9]  Matthias Ehrgott,et al.  Multicriteria Optimization (2. ed.) , 2005 .

[10]  Kalyanmoy Deb,et al.  A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II , 2000, PPSN.

[11]  Marco Laumanns,et al.  Scalable Test Problems for Evolutionary Multiobjective Optimization , 2005, Evolutionary Multiobjective Optimization.

[12]  R. Lyndon While,et al.  A review of multiobjective test problems and a scalable test problem toolkit , 2006, IEEE Transactions on Evolutionary Computation.

[13]  Michael Emmerich A rigorous analysis of two bi-criteria problem families with scalable curvature of the pareto fronts , 2005 .

[14]  Matthias Ehrgott,et al.  Multicriteria Optimization , 2005 .