A memetic co-evolutionary differential evolution algorithm for constrained optimization

In this paper, a memetic co-evolutionary differential evolution algorithm (MCODE) for constrained optimization is proposed. Two cooperative populations are constructed and evolved by independent differential evolution (DE) algorithm. The purpose of the first population is to minimize the objective function regardless of constraints, and that of the second population is to minimize the violation of constraints regardless of the objective function. Interaction and migration happens between the two populations when separate evolutions go on for several iterations, by migrating feasible solutions into the first group, and infeasible ones into the second group. Then, a Gaussian mutation is applied to the individuals when the best solution keep unchanged for several generations. The algorithm is tested by five famous benchmark problems, and is compared with methods based on penalty functions, co-evolutionary genetic algorithm (COGA), and co-evolutionary differential evolution algorithm (CODE). The results proved the proposed cooperative MCODE is very effective and efficient.

[1]  Zbigniew Michalewicz,et al.  Evolutionary Computation Techniques for Nonlinear Programming Problems , 1994 .

[2]  K. Deb.  An Efficient Constraint Handling Method for Genetic Algorithms , 2000 .

[3]  Osamu Katai,et al.  Solving constraint satisfaction problems by using coevolutionary genetic algorithms , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[4]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[5]  Kevin Kok Wai Wong,et al.  Classification of adaptive memetic algorithms: a comparative study , 2006, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[6]  Zbigniew Michalewicz,et al.  Evolutionary Algorithms for Constrained Parameter Optimization Problems , 1996, Evolutionary Computation.

[7]  Andy J. Keane,et al.  Meta-Lamarckian learning in memetic algorithms , 2004, IEEE Transactions on Evolutionary Computation.

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

[9]  Kenneth A. De Jong,et al.  A Cooperative Coevolutionary Approach to Function Optimization , 1994, PPSN.

[10]  Christopher R. Houck,et al.  On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with GA's , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[11]  Kenneth A. De Jong,et al.  Cooperative Coevolution: An Architecture for Evolving Coadapted Subcomponents , 2000, Evolutionary Computation.

[12]  Carlos A. Coello Coello,et al.  THEORETICAL AND NUMERICAL CONSTRAINT-HANDLING TECHNIQUES USED WITH EVOLUTIONARY ALGORITHMS: A SURVEY OF THE STATE OF THE ART , 2002 .

[13]  Jan Paredis,et al.  Co-evolutionary Constraint Satisfaction , 1994, PPSN.