Some results about the Markov chains associated to GPs and general EAs

Theoretical Computer Science

Volumn 361, Issue 1, 2006, Pages 72-110

  Mitavskiy, Boris ^a   Rowe, Jonathan ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Crossover; Evolutionary algorithms; Fitness proportional selection; Geiringer theorem; Markov chain; Mutation; Stationary distribution

Indexed keywords

EVOLUTIONARY ALGORITHMS; GENETIC ALGORITHMS; GENETIC ENGINEERING; LINEAR PROGRAMMING; MATHEMATICAL MODELS; MUTAGENESIS; THEOREM PROVING;

FITNESS-PROPORTIONAL SELECTION; GEIRINGER THEOREM; MARKOV CHAIN; MUTATION; STATIONARY DISTRIBUTION;

MARKOV PROCESSES;

EID: 33747005131     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.04.006     Document Type: Article

References (14)

1. S. Coffey, An applied probabilist's guide to genetic algorithms, Master's Thesis, The University of Dublin, 1999.
2. Fisher R.A. The Genetical Theory of Natural Selection (1930), Clarendon Press, Oxford
3. Geiringer H. On the probability of linkage in mendelian heredity. Annu. Math. Statist. 15 (1944) 25-57
4. Mitavskiy B., and Rowe J. An extension of Geiringer theorem for a wide class of evolutionary algorithms. Evolutionary Computation 14 (2006) 87-108
5. Poli R. Hyperschema theory for gp with one-point crossover, building blocks, and some new results in ga theory. In: Poli R., Banzhaf W., et al. (Eds). Genetic Programming, Proc. EuroGP'2000 (2000), Springer, Berlin 163-180
6. Poli R., and Langdon W. On the search properties of different crossover operators in genetic programming. Proc. Third Annu. Genetic Programming Conf. (1998) 293-301
7. R. Poli, C. Stephens, A. Wright, J. Rowe, A schema-theory-based extension of Geiringer's theorem for linear gp and variable-length gas under homologous crossover, in: K. De Jong, R. Poli, J.E. Rowe (Eds.), Foundations of Genetic Algorithms, Vol. 7, 2002, pp. 45-62.
8. Y. Rabani, Y. Rabinovich, A. Sinclair, A computational view of population genetics, Annu. ACM Symp. Theory of Comput., 1995, pp. 83-92.
9. Radcliffe N. The algebra of genetic algorithms. Annu. Math. Artif. Intell. 10 (1994) 339-384
10. Schmitt L. Theory of genetic algorithms. Theoret. Comput. Sci. 259 (2001) 1-61
11. Schmitt L. Theory of genetic algorithms ii: models for genetic operators over the string-tensor representation of populations and convergence to global optima for arbitrary fitness function under scaling. Theoret. Comput. Sci. 310 (2004) 181-231
12. W. Spears, The equilibrium and transient behavior of mutation and recombination, in: W. Martin, W. Spears (Eds.), Foundations of Genetic Algorithms, Vol. 6, 2000, pp. 241-260.
13. Vose M. The Simple Genetic Algorithm: Foundations and Theory (1999), MIT Press
14. Wright S. Evolution in mendelian populations. Genetics 16 (1931) 97-159