Abstract
In this paper we shall give a mathematical description of a general evolutionary heuristic search algorithm which allows to see a very special property which slightly generalized binary genetic algorithms have comparing to other evolutionary computation techniques. It turns out that such a generalized genetic algorithm, which we call a binary semi-genetic algorithm, is capable of encoding virtually any other reasonable evolutionary heuristic search technique.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
Antonisse, J., “A new interpretation of Schema Notation that Overturns the Binary Encoding Constraint”, Proceedings of the Third International Conference on Genetic Algorithms (J. Schaffer ed.), Morgan Kaufmann (1989), 86–97.
Michalewicz, Z., Genetic Algorithms + Data Structures = Evolution Programs, Springer-Verlag (1996).
Vose, M., “Generalizing the Notion of a Schema in Genetic Algorithms”, Artificial Intelligence 50(3) (1991), 385–396.
Dummit, D., Foote, R., Abstract Algebra, Prentice-Hall, Inc. (1991).
Mitavskiy, B., “Crossover Invariant Subsets of the Search Space for Evolutionary Algorithms”, Evolutionary Computation 12(1) (2004), 19–46.
Radcliffe, N., “The Algebra of Genetic Algorithms”, Annals of Math and Artificial Intelligence 10 (1994), 339–384.
Watson, R., “Recombination Without Respect: Schema Combination and Disruption in Genetic Algorithm Crossover”, Proceedings of the 2000 Genetic and Evolutionary Computation Conference (D. Whitly ed.), Morgan Kaufmann (2000), 112–119.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 NECSI Cambridge, Massachusetts
About this paper
Cite this paper
Mitavskiy, B. (2008). Invariant Subsets of the Search Space, and the Universality of a Generalized Genetic Algorithm. In: Minai, A.A., Bar-Yam, Y. (eds) Unifying Themes in Complex Systems IV. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73849-7_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-73849-7_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73848-0
Online ISBN: 978-3-540-73849-7
eBook Packages: Physics and AstronomyPhysics and Astronomy (R0)