Adding a diversity mechanism to a simple evolution strategy to solve constrained optimization problems

In this paper, we propose the use of a simple evolution strategy (SES) (i.e., a (1 + /spl lambda/)-ES with self-adaptation that uses three tournament rules based on feasibility) coupled with a diversity mechanism to solve constrained optimization problems. The proposed mechanism is based on multiobjective optimization concepts taken from an approach called the niched-Pareto genetic algorithm (NPGA). The main advantage of the proposed approach is that it does not require the definition of any extra parameters, other than those required by an evolution strategy. The performance of the proposed approach is shown to be highly competitive with respect to other constraint-handling techniques representative of the state-of-the-art in the area when using a set of well-known benchmarks.

[1]  Xin Yao,et al.  Stochastic ranking for constrained evolutionary optimization , 2000, IEEE Trans. Evol. Comput..

[2]  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.

[3]  Carlos A. Coello Coello,et al.  A Simple Evolution Strategy to Solve Constrained Optimization Problems , 2003, GECCO.

[4]  Gunar E. Liepins,et al.  Some Guidelines for Genetic Algorithms with Penalty Functions , 1989, ICGA.

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

[6]  Zbigniew Michalewicz,et al.  Evolutionary Algorithms, Homomorphous Mappings, and Constrained Parameter Optimization , 1999, Evolutionary Computation.

[7]  Carlos A. Coello Coello,et al.  Handling Constraints in Genetic Algorithms Using Dominance-based Tournaments , 2002 .

[8]  José L. Verdegay,et al.  Evolutionary Techniques for Constrained Optimization Problems , 1999 .

[9]  M. Gorges-Schleuter,et al.  Local interaction evolution strategies for design optimization , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[10]  Carlos Artemio Coello-Coello,et al.  Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art , 2002 .

[11]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

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