Solving Multiobjective Optimization Problems using Evolutionary Algorithm

Being capable of finding a set of pareto–optimal solutions in a single run, which is a necessary feature for multi–criteria decision making, Evolutionary Algorithms (EAs) has attracted many researchers and practitioners to address the solution of Multiobjective Optimization Problems (MOPs). In a previous work, we developed a Pareto Differential Evolution (PDE) algorithm to handle multiobjective optimization problems. Despite the overwhelming number of Multiobjective Evolutionary Algorithms (MEAs) in the literature, little work has been done to identify the best MEA using an appropriate assessment methodology. In this paper, we compare our algorithm with twelve other well-known MEAs, using a popular assessment methodology, by solving two bench-mark problems. The comparison shows the superiority of our algorithm over others.

[1]  David E. Goldberg,et al.  A niched Pareto genetic algorithm for multiobjective optimization , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[2]  R. Storn,et al.  Differential Evolution - A simple and efficient adaptive scheme for global optimization over continuous spaces , 2004 .

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

[4]  C. Fonseca,et al.  GENETIC ALGORITHMS FOR MULTI-OBJECTIVE OPTIMIZATION: FORMULATION, DISCUSSION, AND GENERALIZATION , 1993 .

[5]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

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

[7]  Prabhat Hajela,et al.  Genetic search strategies in multicriterion optimal design , 1991 .

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

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

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

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