An extension of Geiringer's theorem for a wide class of evolutionary search algorithms

Evolutionary Computation

Volumn 14, Issue 1, 2006, Pages 87-118

  Mitavskiy, Boris ^a   Rowe, Jonathan ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Crossover; Geiringer theorem; Genetic algorithms; Markov process; Mutation; Random walk on a group; Schemata; Stationary distribution

Indexed keywords

ALGORITHM; ARTICLE; BIOLOGICAL MODEL; COMPUTER SIMULATION; CROSS BREEDING; GENE FREQUENCY; GENETIC RECOMBINATION; MOLECULAR EVOLUTION; POPULATION GENETICS;

ALGORITHMS; COMPUTER SIMULATION; CROSSES, GENETIC; EVOLUTION, MOLECULAR; GENE FREQUENCY; GENETICS, POPULATION; MODELS, GENETIC; RECOMBINATION, GENETIC;

EID: 33646083237     PISSN: 10636560     EISSN: 15309304     Source Type: Journal    
DOI: 10.1162/evco.2006.14.1.87     Document Type: Conference Paper

References (18)

1. Coffey, S. (1999). An applied probabilist's guide to genetic algorithms. Master's thesis, The University of Dublin.
2. Dummit, D. and Foote, R. (1991). Abstract Algebra. Prentice-Hall.
3. Geiringer, H. (1944). On the probability of linkage in mendelian heredity. Annals of Mathematical Statistics, 15:25-57.
4. Mitavskiy, B. (2003). Comparing evolutionary computation techniques via their representation. In Cantu-Paz, E., et al, editors, Proceedings of the Genetic and Evolutionary Computation (GECCO) Conference, volume 1, pages 1196-1209. Springer-Verlag.
5. Mitavskiy, B. (2004a). Crossover invariant subsets of the search space for evolutionary algorithms. Evolutionary Computation, 12(1):19-46.
6. Mitavskiy, B. (2004b). A mathematical model of evolutionary computation and some consequences. PhD thesis, University of Michigan.
7. Mitavskiy, B. and Rowe, J. E. (2005). Some results about the markov chains associated with GPs and general EAs. Theoretical Computer Science. Under submission.
8. Poli, R. (2000). Hyperschema theory for GP with one-point crossover, building blocks, and some new results in GA theory. In Poli, R., et al, editors, Genetic Programming, Proceedings of EuroGP'2000, pages 163-180. Springer-Verlag.
9. Poli, R., Stephens, C., Wright, A., and Rowe, J. (2002). A schema-theory-based extension of Geiringer's theorem for linear GP and variable-length GAs under homologous crossover. In Dejong, K., Poli, R., and Rowe, J. E., editors, Foundations of Genetic Algorithms, volume 7, pages 45-62.
10. Rabani, Y., Rabinovich, Y., and Sinclair, A. (1995). A computational view of population genetics. In Annual ACM Symposium on the Theory of Computing, pages 83-92.
11. Rosenthal, J. (1995). Convergence rates for markov chains. SIAM Review, 37(3):387-405.
12. Rowe, J., Vose, M., and Wright, A. (2002). Group properties of crossover and mutation. Evolutionary Computation, 10(2):151-184.
13. Rowe, J., Vose, M., and Wright, A. (2004). Structural search spaces and genetic operators. Evolutionary Computation, 12(4):461-494.
14. Schmitt, L. (2001). Theory of genetic algorithms. Theoretical Computer Science, 259:1-61.
15. Schmitt, L. (2004). 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. Theoretical Computer Science, 310:181-231.
16. Sinclair, A. (1992). Algorithms for Random Generation and Counting: A Markov Chain Approach. Birkhauser, Boston.
17. Spears, W. (2000). The equilibrium and transient behavior of mutation and recombination. In Martin, W. and Spears, W., editors, Foundations of genetic Algorithms, volume 6, pages 241-260.
18. Vose, M. (1999). The Simple Genetic Algorithm: Foundations and Theory. MIT Press.