Scalable Test Problems for Evolutionary Multiobjective Optimization

After adequately demonstrating the ability to solve different two-objective optimization problems, multiobjective evolutionary algorithms (MOEAs) must demonstrate their efficacy in handling problems having more than two objectives. In this study, we have suggested three different approaches for systematically designing test problems for this purpose. The simplicity of construction, scalability to any number of decision variables and objectives, knowledge of the shape and the location of the resulting Pareto-optimal front, and introduction of controlled difficulties in both converging to the true Pareto-optimal front and maintaining a widely distributed set of solutions are the main features of the suggested test problems. Because of the above features, they should be found useful in various research activities on MOEAs, such as testing the performance of a new MOEA, comparing different MOEAs, and better understanding of the working principles of MOEAs.

[1]  J. D. Schaffer,et al.  Some experiments in machine learning using vector evaluated genetic algorithms (artificial intelligence, optimization, adaptation, pattern recognition) , 1984 .

[2]  Frank Kursawe,et al.  A Variant of Evolution Strategies for Vector Optimization , 1990, PPSN.

[3]  Masahiro Tanaka,et al.  GA-based decision support system for multicriteria optimization , 1995, 1995 IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21st Century.

[4]  Peter J. Fleming,et al.  An Overview of Evolutionary Algorithms in Multiobjective Optimization , 1995, Evolutionary Computation.

[5]  Christian Fonteix,et al.  Multicriteria optimization using a genetic algorithm for determining a Pareto set , 1996, Int. J. Syst. Sci..

[6]  Hajime Kita,et al.  Multi-objective optimization by genetic algorithms: a review , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[7]  Kaisa Miettinen,et al.  Nonlinear multiobjective optimization , 1998, International series in operations research and management science.

[8]  Marco Laumanns,et al.  A Spatial Predator-Prey Approach to Multi-objective Optimization: A Preliminary Study , 1998, PPSN.

[9]  Gary B. Lamont,et al.  Multiobjective evolutionary algorithms: classifications, analyses, and new innovations , 1999 .

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

[11]  David Corne,et al.  The Pareto archived evolution strategy: a new baseline algorithm for Pareto multiobjective optimisation , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[12]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

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

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

[15]  Lothar Thiele,et al.  Comparison of Multiobjective Evolutionary Algorithms: Empirical Results , 2000, Evolutionary Computation.

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

[17]  Gary B. Lamont,et al.  Multiobjective Evolutionary Algorithms: Analyzing the State-of-the-Art , 2000, Evolutionary Computation.

[18]  David W. Corne,et al.  Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy , 2000, Evolutionary Computation.

[19]  C. Poloni,et al.  Hybridization of a multi-objective genetic algorithm, a neural network and a classical optimizer for a complex design problem in fluid dynamics , 2000 .

[20]  H. Kita,et al.  Failure of Pareto-based MOEAs: does non-dominated really mean near to optimal? , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[21]  Marco Laumanns,et al.  Mutation Control and Convergence in Evolutionary Multi-Object Optimization , 2001 .

[22]  Kalyanmoy Deb,et al.  Constrained Test Problems for Multi-objective Evolutionary Optimization , 2001, EMO.

[23]  Marco Laumanns,et al.  On the convergence and diversity-preservation properties of multi-objective evolutionary algorithms , 2001 .

[24]  Marco Laumanns,et al.  SPEA2: Improving the strength pareto evolutionary algorithm , 2001 .

[25]  Marco Laumanns,et al.  Combining Convergence and Diversity in Evolutionary Multiobjective Optimization , 2002, Evolutionary Computation.

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

[27]  Gary B. Lamont,et al.  Evolutionary Algorithms for Solving Multi-Objective Problems , 2002, Genetic Algorithms and Evolutionary Computation.

[28]  Marco Laumanns,et al.  Running time analysis of a multi-objective evolutionary algorithm on a simple discrete optimization problem , 2002 .

[29]  Marco Laumanns,et al.  Scalable multi-objective optimization test problems , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[30]  Kalyanmoy Deb,et al.  Towards a Quick Computation of Well-Spread Pareto-Optimal Solutions , 2003, EMO.

[31]  Kalyanmoy Deb,et al.  Multi-Speed Gearbox Design Using Multi-Objective Evolutionary Algorithms , 2003 .

[32]  Marco Laumanns,et al.  PISA: A Platform and Programming Language Independent Interface for Search Algorithms , 2003, EMO.

[33]  Marco Laumanns,et al.  Running time analysis of multiobjective evolutionary algorithms on pseudo-Boolean functions , 2004, IEEE Transactions on Evolutionary Computation.