Competitive cooperation for strategy adaptation in coevolutionary genetic algorithm for constrained optimization

A coevolutionary algorithm as a search strategy adaptation procedure in constrained optimization is discussed in the paper. The coevolutionary algorithm consists of the set of individual conventional genetic algorithms with different search strategies. Individual genetic algorithms compete and cooperate with each other. Competition is provided with resource re-allocation among algorithms and cooperation is provided with migration of the best individuals to all of the algorithms. At early works this method was applied for unconstrained optimization problems. The common result was that coevolutionary algorithm is more effective than average individual genetic algorithms. In this paper modification of competitive-cooperative coevolutionary algorithm for constrained optimization problems is considered. Results of test comparison of coevolutionary algorithm with conventional genetic algorithms demonstrate that coevolutionary algorithm is not less effective than the best for problem-in-hand individual conventional algorithm.

[1]  Zbigniew Michalewicz,et al.  Parameter control in evolutionary algorithms , 1999, IEEE Trans. Evol. Comput..

[2]  Heinz Mühlenbein,et al.  Strategy Adaption by Competing Subpopulations , 1994, PPSN.

[3]  Stefano Marsili-Libelli,et al.  Adaptive mutation in genetic algorithms , 2000, Soft Comput..

[4]  Richard K. Belew,et al.  New Methods for Competitive Coevolution , 1997, Evolutionary Computation.

[5]  Eugene Semenkin,et al.  Local Search Efficiency when Optimizing Unimodal Pseudoboolean Functions , 1998, Informatica.

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

[7]  Jens Gottlieb,et al.  Evolutionary algorithms for constrained optimization problems , 2000, Berichte aus der Informatik.

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

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