Assessment Methodologies for Multiobjective Evolutionary Algorithms

The Pareto-based evolutionary multiobjective algorithms have shown some success in solving multiobjective optimization problems. However, it is difficult to judge the performance of multiobjective algorithms because there is no universally accepted definition of optimum in multiobjective as in single-objective optimization problems. As appeared in the literature, there are several methods to compare two or more multiobjective algorithms. In this chapter, we discuss the existing comparison methods with their strengths and weaknesses.

[1]  Simon Ronald,et al.  Robust Encodings in Genetic Algorithms , 1997 .

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

[3]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[4]  J. David Schaffer,et al.  Proceedings of the third international conference on Genetic algorithms , 1989 .

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

[6]  Jason R. Schott.  Fault Tolerant Design Using Single and Multicriteria Genetic Algorithm Optimization. , 1995 .

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

[8]  Kenneth A. De Jong,et al.  An Analysis of Multi-Point Crossover , 1990, FOGA.

[9]  G. Rudolph.  On a multi-objective evolutionary algorithm and its convergence to the Pareto set , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[10]  Andrzej Jaszkiewicz,et al.  Performance of Multiple Objective Evolutionary Algorithms on a Distribution System Design Problem - Computational Experiment , 2001, EMO.

[11]  Carlos M. Fonseca,et al.  Inferential Performance Assessment of Stochastic Optimisers and the Attainment Function , 2001, EMO.

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

[13]  Thomas Bäck,et al.  Evolutionary Algorithms in Theory and Practice , 1996 .

[14]  H. Abbass,et al.  PDE: a Pareto-frontier differential evolution approach for multi-objective optimization problems , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

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

[16]  J. David Schaffer,et al.  Representation and Hidden Bias: Gray vs. Binary Coding for Genetic Algorithms , 1988, ML.

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

[18]  Larry J. Eshelman,et al.  Biases in the Crossover Landscape , 1989, ICGA.

[19]  John W. Fowler,et al.  Comparison of Multiple Objective Genetic Algorithms for Parallel Machine Scheduling Problems , 2001, EMO.

[20]  Kalyanmoy Deb,et al.  Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms , 1994, Evolutionary Computation.

[21]  Zbigniew Michalewicz,et al.  Evolutionary Computation 2 , 2000 .

[22]  Kalyanmoy Deb,et al.  An Investigation of Niche and Species Formation in Genetic Function Optimization , 1989, ICGA.

[23]  Hans-Paul Schwefel,et al.  Parallel Problem Solving from Nature — PPSN IV , 1996, Lecture Notes in Computer Science.

[24]  H. Schwefel,et al.  Approximating the Pareto Set: Concepts, Diversity Issues, and Performance Assessment , 1999 .

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

[26]  Hisham M. Haddad,et al.  Proceedings of the 1999 ACM Symposium on Applied Computing, SAC'99, San Antonio, Texas, USA, February 28 - March 2, 1999 , 1999, ACM Symposium on Applied Computing.

[27]  Terence C. Fogarty,et al.  Varying the Probability of Mutation in the Genetic Algorithm , 1989, ICGA.

[28]  G. Matheron.  Random Sets and Integral Geometry , 1976 .

[29]  Ernest S. Kuh,et al.  Design space exploration using the genetic algorithm , 1996, 1996 IEEE International Symposium on Circuits and Systems. Circuits and Systems Connecting the World. ISCAS 96.

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

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