Exact Schema Theorems for GP with One-Point and Standard Crossover Operating on Linear Structures and their Application to the Study of the Evolution of Size
Created by W.Langdon from
gp-bibliography.bib Revision:1.7975
- @TechReport{Poli00,
-
author = "Riccardo Poli and Nicholas Freitag McPhee",
-
title = "Exact Schema Theorems for {GP} with One-Point and
Standard Crossover Operating on Linear Structures and
their Application to the Study of the Evolution of
Size",
-
institution = "University of Birmingham, School of Computer Science",
-
number = "CSRP-00-14",
-
month = oct,
-
year = "2000",
-
keywords = "genetic algorithms, genetic programming",
-
email = "R.Poli@cs.bham.ac.uk, N.F.McPhee@cs.bham.ac.uk",
-
file = "/2000/CSRP-00-14.ps.gz",
-
URL = "ftp://ftp.cs.bham.ac.uk/pub/tech-reports/2000/CSRP-00-14.ps.gz",
-
size = "17 pages",
-
abstract = "In this paper, firstly we specialise the exact GP
schema theorem for one-point crossover to the case of
linear structures of variable length, for example
binary strings or programs with arity-1 primitives
only. Secondly, we extend this to an exact schema
theorem for GP with standard crossover applicable to
the case of linear structures. Then we study, both
mathematically and numerically, the schema equations
and their fixed points for infinite populations for
both a constant and a length-related fitness function.
This allows us to characterise the bias induced by
standard crossover. This is very peculiar. In the case
of a constant fitness function, at the fixed-point,
structures of any length are present with non-zero
probability. However, shorter structures are sampled
exponentially much more frequently than longer ones.",
- }
Genetic Programming entries for
Riccardo Poli
Nicholas Freitag McPhee
Citations