MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Strategy Adaptation by Competing Subpopulations (1994) [36 citations — 2 self]

Download:
pdf | ps
by Dirk Schlierkamp-voosen, Heinz Muhlenbein
Parallel Problem Solving from Nature (PPSN III
ftp://borneo.gmd.de/pub/as/ga/gmd_as_ga-94_14.ps
Add To MetaCart

Abstract:

Abstract. 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.

Citations

381 Numerical Optimization of Computer Models – Schwefel - 1981
241 Predictive models for the breeder genetic algorithm – Mühlenbein, Schlierkamp-Vose - 1993
172 A Survey of Evolution Strategies – Back, Hoffmeister, et al. - 1991
94 The science of breeding and its application to the breeder genetic algorithm – Muhlenbein, Schlierkamp-Voosen - 1994
84 Self-adaptation in genetic algorithms – Bäck - 1992
62 An automatic method for finding the greatest or least value of a function – Rosenbrock - 1960
56 Varying the probability of mutation in the genetic algorithm – Fogarty - 1989
25 Reproductive isolation as strategy parameter in hierarchically organized evolution strategies – Herdy - 1992
21 and Hans-Paul Schwefel. An overview of evolutionary algorithms for parameter optimization – Back - 1993
4 A Wide Class of Test Functions For Global Optimization – Schoen - 1993
2 Hans-Paul Schwefel. ASurvey of Evolution Strategies – Back - 1991
2 An automatic method for nding the greatest or least value of a function – Rosenbrock - 1960