A unified model of non-panmictic population structures in evolutionary algorithms

This paper presents a formal model of population structures in evolutionary algorithms based on hypergraphs. Since it covers fine grained and coarse grained parallel approaches as well as the simple panmictic case, it provides a unified base for theoretical work on a broad range of algorithms.

[1]  Günter Rudolph,et al.  Significance of Locality and Selection Pressure in the Grand Deluge Evolutionary Algorithm , 1996, PPSN.

[2]  Jayshree Sarma,et al.  An analysis of decentralized and spatially distributed genetic algorithms , 1998 .

[3]  John J. Grefenstette,et al.  A Parallel Genetic Algorithm , 1987, ICGA.

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

[5]  Lothar Thiele,et al.  A Comparison of Selection Schemes Used in Evolutionary Algorithms , 1996, Evolutionary Computation.

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

[7]  Joachim Sprave,et al.  Zelluläre evolutionäre Algorithmen zur Parameteroptimierung , 1993, Informatik in den Biowissenschaften.

[8]  Martina Gorges-Schleuter,et al.  ASPARAGOS An Asynchronous Parallel Genetic Optimization Strategy , 1989, ICGA.

[9]  David E. Goldberg,et al.  Predicting Speedups of Ideal Bounding Cases of Parallel Genetic Algorithms , 1997, ICGA.

[10]  Reiko Tanese,et al.  Parallel Genetic Algorithms for a Hypercube , 1987, ICGA.

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

[12]  Dirk Thierens,et al.  Convergence Models of Genetic Algorithm Selection Schemes , 1994, PPSN.

[13]  Günter Rudolph,et al.  Global Optimization by Means of Distributed Evolution Strategies , 1990, PPSN.