An asymptotic theory for genetic algorithms

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

Volumn 1063, Issue , 1996, Pages 35-53

  Cerf, Raphaël ^a,b  

^a UNIV MONTPELLIER   (France)

^b UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CHROMOSOMES; DYNAMICAL SYSTEMS; GLOBAL OPTIMIZATION; MARKOV PROCESSES; POPULATION STATISTICS; SIMULATED ANNEALING;

ASYMPTOTIC DYNAMICS; GENERALIZED SIMULATED ANNEALING; NEW GENETIC ALGORITHMS; OPTIMIZATION PROBLEMS; RANDOM PERTURBATIONS OF DYNAMICAL SYSTEMS; SELECTION ALGORITHM; SELECTION MECHANISM; SIMPLE GENETIC ALGORITHM;

GENETIC ALGORITHMS;

EID: 84949216689     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61108-8_29     Document Type: Conference Paper

References (18)

1. E.H.L. Aarts-P.J.M. Van Laarhoven, Simulated annealing: theory and applications, D. Reidel, Dordrecht-Tokyo, 1987.
2. O. Catoni, Large deviations for annealing, PhD Thesis, University Paris XI (1990).
3. O. Catoni, Rough large deviations estimates for simulated annealing, Application to exponential schedules, The Annals of Probability 20 no. 3 (1992), 1109-1146.
4. O. Catoni, Sharp large deviations estimates for simulated annealing algorithms, Ann. Inst. Henri Poincaré Probab. Statist. 27 no. 3 (1991), 291-383.
5. R. Cerf, Asymptotic convergence of genetic algorithms, Preprint, submitted (1993).
6. R. Cerf, The dynamics of mutation-selection algorithms with large population sizes, Ann. Inst. Henri Poincaré Probab. Statist., 1996, to appeal.
7. R. Cerf, A new genetic algorithm, Preprint, submitted (1993). The postscript files of the above three papers are available by anonymous ftp at ftp://blanche.polytechnique.fr/pub/eark/papers/Raphael.Cerf/xxx.ps.gz or with netscape http://blanche.polytechnique.fr/www.eeaax/eeaax.litml.
8. R. Cerf, Une théorie asymptotique des algorithmes génétiques, Thèse, Université Montpellier II (1994). The postscript file of this thesis is available by anonymous ftp at ftp 129.199.96.12, pub/reports/thesis/atga.ps.Z.
9. T.E. Davis-J.C. Principe, A simulated annealing like convergence theory for the simple genetic algorithm, Proceedings of the 4th ICGA, San Diego, Morgan Kaufmann, 174-181, 1991.
10. M.I. Freidlin-A.D. Wentzell, Random perturbations of dynamical systems, Springer-Verlag, New York, 1984.
11. D. Goldberg, Genetic algorithms in search, optimization and machine learning, Addison-Wesley, 1989.
12. C.R. Hwang-SJ. Sheu, Singular perturbed Markov chains and exact behaviours of simulated annealing process, Journal of Theoretical Probability Vol. 5 No. 2 (1992), 223-249.
13. J.H. Holland, Adaptation in natural and artificial systems, The University of Michigan Press, Ann Arbor, 1975.
14. A.E. Nix-M.D. Vose, Modeling genetic algorithms with Markov chains, Annals of Mathematics and AI, 5(1):79-88, 1991.
15. G. Rudolph, Convergence analysis of canonical genetic algorithms, IEEE Trans on Neural Networks 5(1), 96-101, 1994.
16. A. Trouvé, Cycle decompositions and simulated annealing, Preprint (1993).
17. A. Trouvé, Parallélisation massive du recuit simulé, PhD Thesis, University Paris XI (1993).
18. A. Trouvé, Rough large deviation estimates for the optimal convergence speed exponent of generalized simulated annealing algorithms, Ann. Inst. Henri Poincaré Probab. Statist., 1996, to appear.