Pessimistic GP Schema Theories

  • William B. Langdon
  • Riccardo Poli


In Chapter 3 we described early schema theories for genetic programming These are based on the idea of schemata as components within the program tree. In this chapter we will consider two GP schema theories of a different kind. These schemata have the advantage that not only can they be considered as parts of programs but, also that they are true subsets of the search space. In Section 4.1 we summarise the schema theory proposed by Justinian Rosca [Rosca, 1997a] that is applicable to GP with standard crossover. How ever, the main focus of the chapter is on our schema theory. This is based on a concept of schema which is much closer to the original concept of schema in genetic algorithms and it is applicable to GP (and to different kinds of GAs) when one-point crossover is used This is a generalisation of the corresponding GA operator in which the same crossover point is selected in both parents.


Crossover Point Initialisation Method Schema Definition Schema Disruption Standard Crossover 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • William B. Langdon
    • 1
  • Riccardo Poli
    • 2
  1. 1.Computer ScienceUniversity College, LondonLondonUK
  2. 2.Department of Computer ScienceThe University of EssexColchesterUK

Personalised recommendations