论文信息 - A unified model of non-panmictic population structures in evolutionary algorithms

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.

J. Sprave | J. Sprave

[1] Michael D. Vose,et al. Modeling genetic algorithms with Markov chains , 1992, Annals of Mathematics and Artificial Intelligence.

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

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

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

[5] Martina Gorges-Schleuter,et al. Genetic algorithms and population structures: a massively parallel algorithm , 1991 .