General Schema Theory for Genetic Programming with Subtree-Swapping Crossover: Part I
Authors:
- 1 March 2003
- journal article
- Published by MIT Press in Evolutionary Computation
- Vol. 11 (1) , 53-66
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 N2 and allows one to model the process of selection of the crossover points of subtree-swapping crossovers as a probability distribution over N4. 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 GPKeywords
This publication has 3 references indexed in Scilit:
- Size Fair and Homologous Tree Crossovers for Tree Genetic ProgrammingGenetic Programming and Evolvable Machines, 2000
- Schema Theory for Genetic Programming with One-Point Crossover and Point MutationEvolutionary Computation, 1998
- Strongly Typed Genetic ProgrammingEvolutionary Computation, 1995