Theoretical models of selection pressure for dEAs: topology influence

This paper presents a study of different models for the best individual's growth curve and the takeover time in a distributed evolutionary algorithm (dEA). The calculation of the takeover time is a common analytical approach to measure the selection pressure of an EA. This work is another step forward to mathematically unify and describe the roles of several parameters of the migration policy: the migration rate, the migration frequency, and the topology in the selection pressure induced by the dynamics of dEAs. In order to achieve these goals we comparatively evaluate the appropriateness of the well-known panmictic logistic model, hypergraph model and two new models for dEAs. We introduce new accurate models for growth curves and takeover times in dEAs, and analytically explain the effects of the migration rate, migration frequency, and topology

[1]  Kenneth A. De Jong,et al.  An Analysis of Local Selection Algorithms in a Spatially Structured Evolutionary Algorithm , 1997, ICGA.

[2]  J. Sprave.  A unified model of non-panmictic population structures in evolutionary algorithms , 1999 .

[3]  Kalyanmoy Deb,et al.  Analysis of Selection Algorithms: A Markov Chain Approach , 1996, Evolutionary Computation.

[4]  G. Rudolph.  On Takeover Times in Spatially Structured Populations : Array and Ring , 2001 .

[5]  Enrique Alba,et al.  Influence of the Migration Policy in Parallel Distributed GAs with Structured and Panmictic Populations , 2000, Applied Intelligence.

[6]  Erick Cantú-Paz.  Migration, Selection Pressure, and Superlinear Speedups , 2001 .

[7]  Kalyanmoy Deb,et al.  A Comparative Analysis of Selection Schemes Used in Genetic Algorithms , 1990, FOGA.

[8]  Kenneth A. De Jong,et al.  An Analysis of the Effects of Neighborhood Size and Shape on Local Selection Algorithms , 1996, PPSN.

[9]  Marco Tomassini,et al.  Modeling Selection Intensity for Linear Cellular Evolutionary Algorithms , 2003, Artificial Evolution.

[10]  L. Darrell Whitley,et al.  Serial and Parallel Genetic Algorithms as Function Optimizers , 1993, ICGA.

[11]  Enrique Alba,et al.  Selection Intensity in Asynchronous Cellular Evolutionary Algorithms , 2003, GECCO.

[12]  Martina Gorges-Schleuter,et al.  An Analysis of Local Selection in Evolution Strategies , 1999, GECCO.

[13]  Enrique Alba,et al.  Growth Curves and Takeover Time in Distributed Evolutionary Algorithms , 2004, GECCO.

[14]  John R. Koza,et al.  Parallel genetic programming: a scalable implementation using the transputer network architecture , 1996 .

[15]  Enrique Alba,et al.  Parallelism and evolutionary algorithms , 2002, IEEE Trans. Evol. Comput..