Paper Information - Strategy Adaption by Competing Subpopulations

Strategy Adaption by Competing Subpopulations

The breeder genetic algorithm BGA depends on a set of control parameters and genetic operators. In this paper it is shown that strategy adaptation by competing subpopulations makes the BGA more robust and more efficient. Each subpopulation uses a different strategy which competes with other subpopulations. Numerical results are presented for a number of test functions.

Heinz Mühlenbein | Dirk Schlierkamp-Voosen | H. Mühlenbein | Dirk Schlierkamp-Voosen

[1] Heinz Mühlenbein,et al. Predictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization , 1993, Evolutionary Computation.

[2] Terence C. Fogarty,et al. Varying the Probability of Mutation in the Genetic Algorithm , 1989, ICGA.

[3] Thomas Bäck,et al. A Survey of Evolution Strategies , 1991, ICGA.

[4] Hans-Paul Schwefel,et al. Numerical Optimization of Computer Models , 1982 .

[5] Thomas Bäck,et al. An Overview of Evolutionary Algorithms for Parameter Optimization , 1993, Evolutionary Computation.

[6] Fabio Schoen,et al. A wide class of test functions for global optimization , 1993, J. Glob. Optim..

[7] H. H. Rosenbrock,et al. An Automatic Method for Finding the Greatest or Least Value of a Function , 1960, Comput. J..

[8] Heinz Mühlenbein,et al. The Science of Breeding and Its Application to the Breeder Genetic Algorithm (BGA) , 1993, Evolutionary Computation.