Abstract
In this paper we study random genetic drift in a finite genetic population. Exact formulae for calculating the mean convergence time of the population are analytically derived and some results of numerical calculations are given. The calculations are compared to the results obtained in population genetics. A new proposition is derived for binary alleles and uniform crossover. Here the mean convergence time τ is almost proportional to the size of the population and to the logarithm of the number of the loci. The results of Monte Carlo type numerical simulations are in agreement with the results from the calculation.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Crow,J.F. and Kimura,M. An Introduction to Population Genetics Theory, Harper and Row, New York, 1970.
Feller,W. An Introduction to Probability Theory and its Applications, vol.1 (3rd ed.), John Wiley & Sons, New York, 1957.
Fisher,R.A. On the dominance ratio. Proc. Roy. Soc. Edinburgh 42, 321–341, 1922.
Goldberg,D.E. Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Readin, 1989.
Hartl,D.L. A Primer of Population Genetics, Sinauer Associates, Sunderland, 1981.
Karlin,S. and Taylor H.M. A First Course in Stochastic Processes. (2nd ed.), Academic Press, New York, 1975.
Kimura,M. Diffusion Models in Population Genetics, J. Appl. Prob. 1, 177–232, 1964.
Kimura,M. The Neutral Theory of Molecular Evolution, Cambridge Univ. Press, 1983.
Mühlenbein,H. Evolutionary algorithms: Theory and applications, in E.Aarts and J.K.Lenstra (eds.) Local Search in Combinatorial Optimization, Wiley, 1993.
Mühlenbein,H.and Schlierkamp-Voosen,D. Predictive models for the Breeder Genetic Algorithm, Evolutionary Comptation 1, 25–49, 1993.
Mühlenbein,H. and Schlierkamp-Voosen,D. The science of breeding and its application to the breeder genetic algorithm BGA, Evolutionary Comptation 1, 335–360, 1994.
Wright,S. Evolution in Mendelian populations, Genetics 16, 97–159, 1931.
Author information
Authors and Affiliations
Corresponding author
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Asoh, H., Mühlenbein, H. (1994). On the mean convergence time of evolutionary algorithms without selection and mutation. In: Davidor, Y., Schwefel, HP., Männer, R. (eds) Parallel Problem Solving from Nature — PPSN III. PPSN 1994. Lecture Notes in Computer Science, vol 866. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58484-6_253
Download citation
DOI: https://doi.org/10.1007/3-540-58484-6_253
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58484-1
Online ISBN: 978-3-540-49001-2
eBook Packages: Springer Book Archive