Abstract
Schemata and the schema theorem, although criticised, are often used to explain why genetic algorithms (GAs) work. A considerable research effort has been produced recently to extend the GA schema theory to Genetic Programming (GP). In this paper we review the main results available to date in the theory of schemata for GP and some recent experimental work on schemata.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
L. Altenberg. The Schema Theorem and Price’s Theorem. In L. D. Whitley and M. D. Vose, editors, Foundations of Genetic Algorithms 3, pages 23–49, Estes Park, Colorado, USA, 31 July–2 Aug. 1994 1995. Morgan Kaufmann.
P. J. Angeline and K. E. Kinnear, Jr., editors. Advances in Genetic Programming 2. MIT Press, Cambridge, MA, USA, 1996.
D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, Massachusetts, 1989.
J. J. Grefenstette. Deception considered harmful. In L. D. Whitley, editor, Foundations of Genetic Algorithms 2, San Mateo, CA, 1993. Morgan Kaufman.
T. Haynes. Phenotypical building blocks for genetic programming. In E. Goodman, editor, Genetic Algorithms: Proceedings of the Seventh International Conference, Michigan State University, East Lansing, MI, USA, 19–23 July 1997. Morgan Kaufmann.
J. Holland. Adaptation in Natural and Artificial Systems. MIT Press, Cambridge, Massachusetts, second edition, 1992.
K. E. Kinnear, Jr., editor. Advances in Genetic Programming. MIT Press, Cambridge, MA, 1994.
J. R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, 1992.
W. B. Langdon and R. Poli. Why ants are hard. Technical Report CSRP-98-4, University of Birmingham, School of Computer Science, January 1998.
U.-M. O’Reilly. An Analysis of Genetic Programming. PhD thesis, Carleton University, Ottawa-Carleton Institute for Computer Science, Ottawa, Ontario, Canada, 22 Sept. 1995.
U.-M. O’Reilly and F. Oppacher. The troubling aspects of a building block hypothesis for genetic programming. In L. D. Whitley and M. D. Vose, editors, Foundations of Genetic Algorithms 3, pages 73–88, Estes Park, Colorado, USA, 31 July–2 Aug. 1994 1995. Morgan Kaufmann.
R. Poli and W. B. Langdon. An experimental analysis of schema creation, propagation and disruption in genetic programming. In E. Goodman, editor, Genetic Algorithms: Proceedings of the Seventh International Conference, Michigan State University, East Lansing, MI, USA, 19–23 July 1997. Morgan Kaufmann.
R. Poli and W. B. Langdon. Genetic programming with one-point crossover. In P. K. Chawdhry, R. Roy, and R. K. Pant, editors, Second On-line World Conference on Soft Computing in Engineering Design and Manufacturing. Springer-Verlag London, 23–27 June 1997.
R. Poli and W. B. Langdon. A new schema theory for genetic programming with one-point crossover and point mutation. In J. R. Koza, K. Deb, M. Dorigo, D. B. Fogel, M. Garzon, H. Iba, and R. L. Riolo, editors, Genetic Programming 1997: Proceedings of the Second Annual Conference, pages 278–285, Stanford University, CA, USA, 13–16 July 1997. Morgan Kaufmann.
R. Poli, W. B. Langdon, and U.-M. O’Reilly. Short term extinction probability of newly created schemata, and schema variance and signal-to-noise-ratio theorems in the presence of schema creation. Technical Report CSRP-98-6, University of Birmingham, School of Computer Science, January 1998.
N. J. Radcliffe. Forma analysis and random respectful recombination. In Proceedings of the Fourth International Conference on Genetic Algorithms. Morgan Kaufmann, 1991.
J. P. Rosca. Analysis of complexity drift in genetic programming. In J. R. Koza, K. Deb, M. Dorigo, D. B. Fogel, M. Garzon, H. Iba, and R. L. Riolo, editors, Genetic Programming 1997: Proceedings of the Second Annual Conference, pages 286–294, Stanford University, CA, USA, 13–16 July 1997. Morgan Kaufmann.
P. A. Whigham. A schema theorem for context-free grammars. In 1995 IEEE Conference on Evolutionary Computation, volume 1, pages 178–181, Perth, Australia, 29 Nov.–1 Dec. 1995. IEEE Press.
P. A. Whigham. Grammatical Bias for Evolutionary Learning. PhD thesis, School of Computer Science, University College, University of New South Wales, Australian Defence Force Academy, October 1996.
P. A. Whigham. Search bias, language bias, and genetic programming. In J. R. Koza, D. E. Goldberg, D. B. Fogel, and R. L. Riolo, editors, Genetic Programming 1996: Proceedings of the First Annual Conference, pages 230–237, Stanford University, CA, USA, 28–31 July 1996. MIT Press.
D. Whitley. A genetic algorithm tutorial. Technical Report CS-93-103, Department of Computer Science, Colorado State University, August 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Poli, R., Langdon, W.B. (1998). A review of theoretical and experimental results on schemata in genetic programming. In: Banzhaf, W., Poli, R., Schoenauer, M., Fogarty, T.C. (eds) Genetic Programming. EuroGP 1998. Lecture Notes in Computer Science, vol 1391. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055924
Download citation
DOI: https://doi.org/10.1007/BFb0055924
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64360-9
Online ISBN: 978-3-540-69758-9
eBook Packages: Springer Book Archive