Abstract
We investigate various properties of Genetic Algorithms. We present 1) a result which highlights the potential existence of long-run crossover and mutation bias in a GA, together with a partial avoidance strategy based on mutation operators, 2) an analysis of GA premature convergence, which indicates the advantage of larger populations, 3) an application of the theory of metric spaces which describes an intrinsic smoothness property of GA populations and highlights the safety in numbers principle and 4) a lower bound on the convergence rate of a mutation-crossover GA. The models presented are generally independent of solution encoding and are thus applicable to a wide range of Genetic Algorithms.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Goldberg D.: Genetic Algorithms in Search, Optimization,and Machine Learning, Reading, MA: Addison Wesley 1989.
Mendenhall, W., Wackerly, D.D., Scheaffer,. R.L.: Mathematical Statistics with Applications. Boston: PWS-Kent.
Narayan Bhat, U.: Elements of Applied Stochastic Processes (2nd. Edn.), New York: Wiley 1984.
Pitts C.G.C.: Introduction to Metric Spaces. Edinburgh: Oliver and Boyd 1972
Reynolds, D., Gomatam, J.: Stochastic Modelling of Genetic Algorithms, to appear in Artificial Intelligence Journal.
Suzuki, J.: A Markov Chain Analysis on A Genetic Algorithm, in Proceedings of the Fifth International Conference on Genetic Algorithms, Forrest, S. (ed.), Urbana Illinois. Morgan Kaufmann 1993
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag/Wien
About this paper
Cite this paper
Reynolds, D., Gomatam, J. (1995). Theoretical Bounds for Genetic Algorithms. In: Artificial Neural Nets and Genetic Algorithms. Springer, Vienna. https://doi.org/10.1007/978-3-7091-7535-4_40
Download citation
DOI: https://doi.org/10.1007/978-3-7091-7535-4_40
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-82692-8
Online ISBN: 978-3-7091-7535-4
eBook Packages: Springer Book Archive