Abstract
We are interested in schema disruption behavior when chromosomes are structured as binary trees. We give the definition of the disruption probability dp(H) of a schema H, and also the relative diameter relΔ(H) of H. We show that in the general case that dp(H) can far exceed relΔ(H), but when the chromosome is a complete binary tree then the inequality dp(H) ≤ relΔ(H) holds almost always. Thus the more compactly the tree chromosome is structured, the better is the behavior to be expected from geneticism.
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.
Similar content being viewed by others
References
Holland, J.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley Publishing, Reading (1989)
Greene, W.A.: A Non-Linear Schema Theorem for Genetic Algorithms. In: Whitley, D. (ed.) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2000), pp. 189–194. Morgan Kaufmann Publishers, San Francisco (2000)
Koza, John, R. (eds.): Genetic Programming: On the Programming of Computers by Natural Selection. MIT Press, Cambridge (1992)
Una-May, O.: An Analysis of Genetic Programming. PhD thesis, Carleton University, Ottawa-Carleton Institute for Computer Science, Ottawa, Ontario, Canada, September 22 (1995)
Una-May, O., Oppacher, F.: The Troubling Aspects of a Building Block Hypothesis for Genetic Programming. In: Whitley, D., Vose, M.D. (eds.) Foundations of Genetic Algorithms 3, Morgan Kaufmann Publishers, San Francisco (1995)
Whigham, Peter, A.: A Schema Theorem for Context-Free Grammars’. In: 1995 IEEE Conference on Evolutionary Computation, vol. 1, pp. 178–181. IEEE Computer Society Press, Los Alamitos (1995)
Rosca, Justinian, P.: Analysis of Complexity Drift in Genetic Programming. In: Koza, John, R., et al. (eds.) Genetic Programming 1997: Proceedings of the Second Annual Conference, pp. 286–294. Morgan Kaufmann Publishers, San Francisco (1997)
Riccardo, P., Langdon, W.: Schema Theory for Genetic Programming with One-Point Crossover and Point Mutation. In: Evolutionary Computation, vol. 6(3), pp. 231–252. MIT Press, Cambridge (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Greene, W.A. (2004). Schema Disruption in Chromosomes That Are Structured as Binary Trees. In: Deb, K. (eds) Genetic and Evolutionary Computation – GECCO 2004. GECCO 2004. Lecture Notes in Computer Science, vol 3102. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24854-5_116
Download citation
DOI: https://doi.org/10.1007/978-3-540-24854-5_116
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22344-3
Online ISBN: 978-3-540-24854-5
eBook Packages: Springer Book Archive