Solving Hard Multiobjective Optimization Problems Using epsilon-Constraint with Cultured Differential Evolution

In this paper, we propose the use of a mathematical programming technique called the e-constraint method, hybridized with an evolutionary single-objective optimizer: the cultured differential evolution. The e-constraint method uses the cultured differential evolution to produce one point of the Pareto front of a multiobjective optimization problem at each iteration. This approach is able to solve difficult multiobjective problems, relying on the efficiency of the single-objective optimizer, and on the fact that none of the two approaches (the mathematical programming technique or the evolutionary algorithm) are required to generate the entire Pareto front at once. The proposed approach is validated using several difficult multiobjective test problems, and our results are compared with respect to a multi-objective evolutionary algorithm representative of the state-of-the-art in the area: the NSGA-II.

[1]  Sujay V. Kumar,et al.  Evaluation Of The Constraint Method-based Evolutionary Algorithm (CMEA) For A Three-objective Problem , 2002, GECCO.

[2]  Robert G. Reynolds,et al.  Knowledge-based solution to dynamic optimization problems using cultural algorithms , 2001 .

[3]  Riccardo Poli,et al.  New ideas in optimization , 1999 .

[4]  S. Ranji Ranjithan,et al.  Evaluation of the constraint method-based multiobjective evolutionary algorithm (CMEA) for a three-objective optimization problem , 2002 .

[5]  S. Ranji Ranjithan,et al.  Constraint Method-Based Evolutionary Algorithm (CMEA) for Multiobjective Optimization , 2001, EMO.

[6]  Lakhmi C. Jain,et al.  Evolutionary Multiobjective Optimization , 2005, Evolutionary Multiobjective Optimization.

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

[8]  L. Lasdon,et al.  On a bicriterion formation of the problems of integrated system identification and system optimization , 1971 .

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

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

[11]  Marco Laumanns,et al.  An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method , 2006, Eur. J. Oper. Res..

[12]  Shapour Azarm,et al.  Minimal Sets of Quality Metrics , 2003, EMO.

[13]  Julian F. Miller,et al.  Genetic and Evolutionary Computation — GECCO 2003 , 2003, Lecture Notes in Computer Science.

[14]  Gary B. Lamont,et al.  Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation) , 2006 .

[15]  R. Lyndon While,et al.  A Scalable Multi-objective Test Problem Toolkit , 2005, EMO.

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

[17]  Kenneth V. Price,et al.  An introduction to differential evolution , 1999 .

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

[19]  Carlos A. Coello Coello,et al.  Optimization with constraints using a cultured differential evolution approach , 2005, GECCO '05.