General schema theory for genetic programming with subtree-swapping crossover: Part I

Riccardo Poli, Nicholas Freitag McPhee

    Research output: Contribution to journalArticlepeer-review

    52 Scopus citations

    Abstract

    This is the first part of a two-part paper which introduces a general schema theory for genetic programming (GP) with subtree-swapping crossover. The theory is based on a Cartesian node reference system which makes it possible to describe programs as functions over the space ℕ2 and allows one to model the process of selection of the crossover points of subtree-swapping crossovers as a probability distribution over ℕ4. In Part I, we present these notions and models and show how they can be used to calculate useful quantities. In Part II we will show how this machinery, when integrated with other definitions, such as that of variable-arity hyperschema, can be used to construct a general and exact schema theory for the most commonly used types of GP.

    Original languageEnglish (US)
    Pages (from-to)53-66
    Number of pages14
    JournalEvolutionary Computation
    Volume11
    Issue number1
    DOIs
    StatePublished - Mar 2003

    Keywords

    • Genetic Programming
    • Models of Crossover
    • Node Reference Systems
    • Schema Theory

    Fingerprint Dive into the research topics of 'General schema theory for genetic programming with subtree-swapping crossover: Part I'. Together they form a unique fingerprint.

    Cite this