Abstract
We study the asymptotic behavior of two mutation-selection genetic algorithms in random environments. First, the state space is a supercritical Galton-Watson tree conditioned upon non-extinction and the objective function is the distance from the root. In the second case, the state space is a regular tree and the objective function is a sample of a tree-indexed random walk. We prove that, after n steps, the algorithms find the maximum possible value of the objective function up to a finite random constant.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Aldous, D.: A Metropolis-type optimization algorithm on the infinite tree. Algorithmica 22, 388–412 (1998)
Bérard, J., Bienvenüe, A.: Convergence of a genetic algorithm with finite population. In: D. Gardy, A. Mokkadem (eds.), Mathematics and Computer Science. Algorithms, Trees, Combinatorics and Probabilities. Trends in Mathematics, Basel, 2000. Birkhäuser Verlag, pp. 155–163
Bérard, J., Bienvenüe, A.: Un principe d’invariance pour un algorithme génétique en population finie. C. R. Acad. Sci. Paris Sér. I Math. 331, 469–474 October (2000)
Cerf, R.: Asymptotic convergence of genetic algorithms. Adv. Appl. Probab. 30 (2), 521–550 (1998)
Del Moral, P., Kallel, L., Rowe, J.: Modelling Genetic Algorithms with Interacting Particle Systems. In: L. Kallel, B. Naudts, A. Rogers (eds.), Natural Computing Series: Theoretical Aspects of Evolutionary Computing, Springer Verlag, Berlin, 2001, pp. 10–67
Dembo, A., Gantert, N., Peres, Y., Zeitouni, O.: Large Deviations for Random Walks on Galton-Watson Trees: Averaging and Uncertainty. Probab. Theory Relat. Fields 122 (2), 241–288 (2002)
Durrett, R.: Probability: theory and examples. Duxbury Press, Belmont, CA, second edition, 1996
Holland, J.H.: Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, Mich., 1975. An introductory analysis with applications to biology, control, and artificial intelligence
Hughes, B.: Random walks and Random environments. Vol. 2. Random environments. The Clarendon Press, Oxford University Press, New York, 1996
Lyons, R., Pemantle, R., Peres, Y.: Biased random walks on Galton-Watson trees, Probab. Theory Relat. Fields 106, 249–264 (1996)
Mazza, C., Piau, D.: On the effect of selection in genetic algorithms. Random Structures and Algorithms 18, 185–200 (2001)
Pemantle, R.: Tree-indexed processes. Statist. Sci. 10, 200–213 (1995)
Rabinovich, Y., Wigderson, A.: Techniques for bounding the convergence rate of genetic algorithms. Random Structures and Algorithms 14 (2), 111–138 (1999)
Rudolph, G.: Convergence Properties of Evolutionary Algorithms. Hamburg: Kovac, 1997
Vose, M.: The Simple Genetic Algorithm. Foundations and theory. MIT Press, Cambridge MA, 1999
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bérard, J. Genetic algorithms in random environments: two examples. Probab. Theory Relat. Fields 133, 123–140 (2005). https://doi.org/10.1007/s00440-004-0419-y
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00440-004-0419-y