Multi-objective benchmark studies fro volutionary computation

During the past few decades, many global optimisation and multi-objective evolutionary algorithms (MOEAs) have been developed. Those algorithms have shown very useful in enabling system design automation and globally accurate modelling. However, there is a lack of systematic benchmark measures that may be used to assess the merit and performance of these algorithms [1],[2],[3],[7],[8]. Such benchmarks should be consistent with those used in measuring conventional optimisation algorithms, should be simple to use and should result in little program overhead. This paper attempts to formalise, and to promote discussions on, this issue. In this paper, benchmarks in terms of (i) optimality; (ii) solution spread measure; (iii) optimiser overhead will be presented.

[1]  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).

[2]  M. Hansen,et al.  Evaluating the quality of approximations to the non-dominated set , 1998 .

[3]  Peter J. Fleming,et al.  On the Performance Assessment and Comparison of Stochastic Multiobjective Optimizers , 1996, PPSN.

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

[5]  C. A. Coello Coello,et al.  A Comprehensive Survey of Evolutionary-Based Multiobjective Optimization Techniques , 1999, Knowledge and Information Systems.

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

[7]  M. Chowdhury,et al.  Benchmarks for testing evolutionary algorithms , 1998 .

[8]  Carlos A. Coello Coello,et al.  An updated survey of evolutionary multiobjective optimization techniques: state of the art and future trends , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

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

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

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

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

[13]  D.A. Van Veldhuizen,et al.  On measuring multiobjective evolutionary algorithm performance , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

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

[15]  Kay Chen Tan,et al.  MOEA toolbox for computer aided multi-objective optimization , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).