Techniques for bounding the convergence rate of genetic algorithms

Random Structures and Algorithms

Volumn 14, Issue 2, 1999, Pages 111-138

  Rabinovich, Yuri ^b   Wigderson, Avi ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033476660     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199903)14:2<111::AID-RSA1>3.0.CO;2-6     Document Type: Article

References (14)

1. E. Baum, D. Boneh, and C. Garrett, On genetic algorithms, Proc COLT, 1995, pp. 230-239.
2. E. Carlen and M. Carvalho, Strict entropy production bounds and stability of the rate of convergence to equilibrium for the Boltzmann equation, preprint, 1992.
3. R. Cerf, "An asymptotic theory for genetic algorithms," Artificial evolution: Lecture notes in computer science, Springer-Verlag, Berlin/New York, 1996, Vol. 1063, pp. 37-53.
4. W. Hoeffding, Probability inequalities for sums of bounded random variables, Amer Stat Assoc 27 (1963), 13-29.
5. J. Holland, Adaptation in natural and artificial systems, University of Michigan Press, Ann Arbor, MI, 1975.
6. J.R. Koza, Genetic programming, MIT Press, Cambridge, MA, 1992.
7. Y. Rabani, Y. Rabinovich, and A. Sinclair, A computational view of population genetics, Random Structures Algorithms 12 (1998), 313-334.
8. Y. Rabinovich, Ph.D. Thesis, Quadratic dynamical systems and theoretical properties of genetic algorithms, Hebrew University, Jerusalem, Dec. 1993.
9. Y. Rabinovich, A. Sinclair, and A. Wigderson, Quadratic dynamical systems, Proc 33rd IEEE FOCS, 1992, pp. 304-313.
10. Y. Rabinovich and A. Wigderson, Analysis of a simple genetic algorithm, Proc 4th Int Conf Genetic Algorithms, 1991, pp. 215-221.
11. G.J.E. Raulings, Ed., Foundation of genetic algorithms, Morgan Kaufmann, San Mateo, CA, 1991.
12. R.L. Riolo, Survival of the fittest bits, Scientific American 267, July 1992.
13. A.L. Samuel, "Some studies in machine learning using the game of checkers," Computers and thought, McGraw-Hill, New York, 1963.
14. D.W. Walkup, Polya sequences, binomial convolution and unions of random sets, J Appl Probab 13 (1976), 76-85.