Exploiting quotients of Markov chains to derive properties of the stationary distribution of the Markov chain associated to an evolutionary algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4247 LNCS, Issue , 2006, Pages 726-733

  Mitavskiy, Boris ^a   Rowe, Jonathan E ^b   Wright, Alden ^c   Schmitt, Lothar M ^d  

^a UNIVERSITY OF SHEFFIELD   (United Kingdom)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^c UNIVERSITY OF MONTANA   (United States)

^d UNIVERSITY OF AIZU   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; EVOLUTIONARY ALGORITHMS; PROBABILITY; STATE SPACE METHODS;

ARBITRARY EQUIVALENCE RELATION; MUTATION RATE; STATIONARY DISTRIBUTION; SUITABLE QUOTIENT CONSTRUCTION;

MARKOV PROCESSES;

EID: 33751357525     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11903697_91     Document Type: Conference Paper

References (11)

1. Aldous, D. and Fill, J. (2001) Reversible Markov Chains and Random Walks on Graphs (unpublished book) http://www.stat.berkeley.edu/aldous/RWG/book.html
2. Coffey, S. (1999) An Applied Probabilist's Guide to Genetic Algorithms. A Thesis Submitted to The University of Dublin for the degree of Master in Science.
3. Davis, T. and Principe, J. (1991) A Simulated Annealing Like Convergence Theory for the Simple Genetic Algorithm. In R. Belew, and L. Bookers, editors, Proceedings of the Fourth International Confemence on Genetic Algorithms, pages 174-181, Morgan Kaufmann.
4. Mitavskiy, B., Rowe, J. (to appear). An Extension of Geiringer Theorem for a wide class of evolutionary search algorithms. Evolutionary Computation.
5. Mitavskiy, B. (2005) A schema-based version of Geiringer's Theorem for nonlinear Genetic Programming with homologous crossover. Foundations of Genetic Algorithms 8, pages 156-175, Springer-Verlag.
6. Mitavskiy, B., Rowe, J. (accepted) Some Results about the Markov Chains Associated to GPs and General EAs. Theoretical Computer Science
7. Schmitt, L. (2001) "Theory of Genetic Algorithms." Theor. Computer Science, 259: 1-61.
8. 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.
9. Radcliffe, N. (1994). The algebra of genetic algorithms. Annals of Mathematics and Artificial Intelligence, 10:339-384. http://users.breathemail. net/njr/papers/amai94.pdf
10. Suzuki, J. (1998). A Further Result on the Markov Chain Model of Genetic Algorithm and Its application to Simulated Annealing-Like strategy. IEEE Transactions on Systems, Man and Cybernatics, 28(1).
11. Vose, M. (1999). The simple genetic algorithm: foundations and theory. MIT Press.