Abstract
This tutorial describes the basic theory of the simple genetic algorithm, as developed by Michael Vose. The mathematical framework is established in which the actions of proportionate selection, mutation and crossover can be analysed. The results are illustrated through simple examples. The recently discovered connections between the mathematical form of the genetic operators and the Walsh transform are briefly described. Some current outstanding conjectures are also presented.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
P. Del Moral and Miclo. Asymptotic results for genetic algorithms with applications to nonlinear estimation. In this volume, page 439.
J. E. Rowe. Population fixed-points for functions of unitation. In W. Banzhaf and C. R. Reeves, editors, Foundations of Genetic Algorithms 5, pages 69–84. Morgan Kaufmann, San Francisco, 1998.
E. van Nimwegen, J. P. Crutchfield, and M. Mitchell. Statistical dynamics of the Royal Road genetic algorithm. Theoretical Computer Science, 229(1–2):41–102, 1999.
M. D. Vose. Logarithmic convergence of random heuristic search. Evolutionary Computation, 4(4):395–404, 1997.
M. D. Vose. Random heuristic search. Theoretical Computer Science, 229(1–2):103–142, 1999.
M. D. Vose. The Simple Genetic Algorithm. MIT Press, Cambridge, MA, 1999.
M. D. Vose and A. H. Wright. Simple genetic algorithms with linear fitness. Evolutionary Computation, 2(4):347–368, 1995.
M. D. Vose and A. H. Wright. The Walsh transform and the theory of the simple genetic algorithm. In S. Pal and P. Wang, editors, Genetic Algorithms for Pattern Recognition, pages 25–43. CRC Press, 1996.
A. H. Wright and G. Bidwell. A search for counterexamples to two conjectures on the simple genetic algorithm. In R. K. Belew and M. D. Vose, editors, Foundations of Genetic Algorithms 4, pages 73–81. Morgan Kaufmann, San Francisco, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Rowe, J.E. (2001). The Dynamical Systems Model of the Simple Genetic Algorithm. In: Kallel, L., Naudts, B., Rogers, A. (eds) Theoretical Aspects of Evolutionary Computing. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04448-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-662-04448-3_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08676-2
Online ISBN: 978-3-662-04448-3
eBook Packages: Springer Book Archive