UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

Schema Theory for Genetic Programming with One-point Crossover and Point Mutation

Poli, R; Langdon, WB; (1998) Schema Theory for Genetic Programming with One-point Crossover and Point Mutation. Evolutionary Computation , 6 (3) pp. 231-252. 10.1162/evco.1998.6.3.253.

Full text not available from this repository.

Abstract

We review the main results obtained in the theory of schemata in Genetic Programming (GP) emphasising their strengths and weaknesses. Then we propose a new, simpler definition of the concept of schema for GP which is closer to the original concept of schema in genetic algorithms (GAs). Along with a new form of crossover, one-point crossover, and point mutation this concept of schema has been used to derive an improved schema theorem for GP which describes the propagation of schemata from one generation to the next. We discuss this result and show that our schema theorem is the natural counterpart for GP of the schema theorem for GAs, to which it asymptotically converges.

Type: Article
Title: Schema Theory for Genetic Programming with One-point Crossover and Point Mutation
DOI: 10.1162/evco.1998.6.3.253
Publisher version: http://citeseer.ist.psu.edu/334847.html
Additional information: keywords: genetic algorithms, genetic programming, Schema Theorem, One-point Crossover size: 30 pages notes: see also \citepoli:1997:schema
UCL classification: UCL > Provost and Vice Provost Offices
UCL > Provost and Vice Provost Offices > UCL BEAMS
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science
URI: http://discovery.ucl.ac.uk/id/eprint/1327769
Downloads since deposit
0Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item