Selection pressure and takeover time of distributed evolutionary algorithms

This paper presents a theoretical study about the selection pressure and the convergence speed of distributed evolutionary algorithms (dEA). In concrete, we model the best individual's growth curve and the takeover time for usual models of multipopulation EAs found in the literature. 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 all the parameters of the migration policy (the migration rate, the migration period, the topology, and the selection/replace schemes of immigrants) in the selection pressure induced by the dynamics of dEAs. In order to achieve these goals we analyze the behaviour of these algorithms and propose a mathematical formula which models that dynamic. The proposed mathematical model is later verified in practice.

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

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

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

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

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

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

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

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

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

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

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

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

[13]  Enrique Alba,et al.  Parallel Metaheuristics: A New Class of Algorithms , 2005 .

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