Abstract
We present a central limit theorem for the population process of a simple genetic algorithm. This theory approximates the discrete population process with finite population size by a continuous Gaussian — process. As a special application we consider a search space with only two elements. For this case we present a complete solution of the differential equation arising in the calculation of the Gaussian — process. This analysis gives first insight into the theory of the general case. Some applications of the theory and extensions to the general case are mentioned, too.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Ankenbrandt. An extension to the theory of convergence and a proof of the time complexity of genetic algorithms. In Rawlins, editor, Foundations of Genetic Algorithms, pages 53–68. Morgan Kaufmann Publishers, 1991.
L. Davis. Handbook of Genetic Algorithms. Van Nostrand Rheinold, New York, 1990.
D.E. Goldberg. A note on boltzmann tournament selection for genetic algorithms and population-oriented simulated annealing. Complex Systems, 4:445–460, 1990.
D.E. Goldberg and K. Deb. A comparative analysis of selection schemes used in genetic algorithms. In G.J.E. Rawlins, editor, Foundations of Genetic Algorithms. Morgan Kaufmann Publishers, 1991.
D.E. Goldberg and P. Segrest. Finite markov chain analysis of genetic algorithms. Proc. on Conf. Genetic Algorithms, 2:1–8, 1987.
J.H. Holland. Adaptation in Natural and Artificial Systems. University of Michigan Press, 1975.
H. Kargupta. Drift, diffusion and boltzman distribution in simple genetic algorithm. preprint, 1994.
M. Kimura. Diffusion models in population genetics. J. Appl. Prob, 1:177–232, 1964.
S.W. Mahfoud. An analysis of boltzmann tournament selection. Report 91007, Illinois Genetic Algorithms Laboratory, March 1994.
M.de Maza and B. Tidor. An analysis of selection procedures with particular attention paid to proportional and boltzmann selection. In International Conference on Genetic Algorithms, pages 124–131, 1993.
T. Nagylaki. The gaussian approximation for random genetic drift. In S. Karlin and E. Nevo, editors, Evolutionary Processes and Theory, pages 629–644. Academic Press, 1986.
A.E. Nix and M.D. Vose. Modeling genetic algorithms with markov chains. Annals of Mathematics and Artificial Intelligence, 5:79–88, 1992.
M.F. Norman. A central limit theorem for markov processes that move by small steps. The Annals of Prob., 2(6):1065–1074, 1974.
M.F. Norman. Approximation of stochastic processes by gaussian diffusions, and applications to wright — fisher genetic models. SIAN J. Appl. Math., 29(2):225–242, 1975.
M.T. Tran. Simulated-Annealing: Konstruktion und Analyse einer Auswahl stochastischer Optimierungsverfahren mithilfe inhomogener Markoff-Ketten. PhD thesis, Universitaet Hildesheim, 1995. Cuvillier Verlag, Goettingen.
S. Voget. Aspekte genetischer Optimierungsalgorithmen: mathematische Modellierung und Einsatz in der Fahrplanerstellung. PhD thesis, Universitaet Hildesheim, 1995.
S. Voget. Theoretical analysis of genetic algorithms with infinite population size. Hildesheimer Informatik Berichte, 31/95:1–19, 1995.
S. Voget. A central limit theorem for the population process of genetic algorithms. Complex Systems, 1996. accepted for publication.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Voget, S. (1996). Gaussian diffusion in a simple genetic algorithm. In: Voigt, HM., Ebeling, W., Rechenberg, I., Schwefel, HP. (eds) Parallel Problem Solving from Nature — PPSN IV. PPSN 1996. Lecture Notes in Computer Science, vol 1141. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61723-X_991
Download citation
DOI: https://doi.org/10.1007/3-540-61723-X_991
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61723-5
Online ISBN: 978-3-540-70668-7
eBook Packages: Springer Book Archive