On the stationary distribution of GAz with fixed crossover probability

GECCO 2005 - Genetic and Evolutionary Computation Conference

Volumn , Issue , 2005, Pages 1147-1151

  Chandimal De Silva, U ^a   Suzuki, Joe ^a  

^a OSAKA UNIVERSITY   (Japan)

Author keywords

Crossover; Genetic algorithms; Stationary distribution

Indexed keywords

MARKOV PROCESSES; MATHEMATICAL MODELS; PROBABILITY; THEOREM PROVING;

CROSSOVER; MUTATION PROBABILITY; STATIONARY DISTRIBUTION;

GENETIC ALGORITHMS;

EID: 32444432283     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. Albuquerque, P. and Mazza, C.,(2000) Foundations of Genetic Algorithms-6, San Francisco, CA. Morgan Kaufmann.
2. Banzhaf, W. and Reeves, C., editors,(1999) Foundations of Genetic algorithms-5, San Francisco, CA. Morgan Kaufmann.
3. Belew, R., editor,(1997) Foundations of Genetic Algorithms-4, San Francisco, CA. Morgan Kaufmann.
4. Cerf, R. (1996) The dynamics of mutation-selection algorithms with large population sizes. Annles de l'Institut Henri Poincare, 32(4):455-508
5. Davis, T. (1991) Toward an extrapolation of the simulated annealing convergence theory for the simple genetic algorithm. Ph.D. dissertation, University of Florida, Gainsville.
6. Davis, T. and Principe, J.C. (1991) A simulated annealing like convergence theory for the simple genetic algorithm. In Belew, R. and Bookers, L., editors, Proc. of the Fourth International Conference on genetic Algorithms, pages 174-181, San Mateo, CA. Morgan Kaufmann.
7. Francois, O.(2002) Global Optimization with Exploration/Selection Algorithms and Simulated Annealing. The Annals of Applied Probability, 12(1):248-271
8. De Jong, K¿, A. (1975) An analysis of the behaviour of a class of genetic adoptive systems. Ph.D. dissertation, University of Michigan.
9. Freidlin, M. and Wentzell, A.(1984) Random perturbations of dynamical systems. Springer-Verlag, New-York.
10. Nix, A. and Vose, M. (1999) Modeling Genetic Algorithms with Markov chains. Ann. Math, Art. Intell, 5(1):79-88.
11. Rudolph, G. (1994) Convergence analysis of canonical genetic algorithms. IEEE Trans. on Neural Networks, special issue on Evolutionary Computation, 5(1):96-101
12. Schmitt, Lothar M. (2001) Theory of genetic algorithms. Theoretical Computer Science, 259(1-2):1-61
13. Suzuki, J. (1998) A further result on the Markov chain model of genetic algorithms and its application to a simulated annealing-like strategy. IEEE Transactions on Systems, Man and Cybernatics, 28(1)
14. Vose, M. D. (1999) The Simple Genetic Algorithm, Foundations and Theory. The MIT Press.
15. Whitley, D., editor, (1993) Foundations of Genetic Algorithms-2, San Mateo, CA. Morgan Kaufmann.
16. Whitley, D., editor, (1995) Foundations of Genetic Algorithms-3, San Francisco, CA. Morgan Kaufmann.