Size Fair and Homologous Tree Crossovers

Created by W.Langdon from gp-bibliography.bib Revision:1.4504

  author =       "W. B. Langdon",
  title =        "Size Fair and Homologous Tree Crossovers",
  institution =  "Centrum voor Wiskunde en Informatica",
  year =         "1999",
  number =       "SEN-R9907",
  address =      "CWI, P.O. Box 94079, Kruislaan 413, NL-1090 GB
                 Amsterdam, The Netherlands",
  month =        "11 " # apr,
  keywords =     "genetic algorithms, genetic programming, bloat
                 reduction, evolution of shape, sub-quadratic length
                 growth, linear depth growth, uniform initialisation,
                 binary tree search spaces",
  URL =          "",
  URL =          "",
  abstract =     "Size fair and homologous crossover genetic operators
                 for tree based genetic programming are described and
                 tested. Both produce considerably reduced increases in
                 program size (i.e. less bloat) and no detrimental
                 effect on GP performance.

                 GP search spaces are partitioned by the ridge in the
                 number of program v. their size and depth. While search
                 efficiency is little effected by initial conditions,
                 these do strongly influence which half of the search
                 space is searched. However a ramped uniform random
                 initialisation is described which straddles the

                 With subtree crossover trees increase about one level
                 per generation leading to sub-quadratic bloat in
                 program length.",
  notes =        "CWI technical report",
  ISSN =         "1386-369X",
  size =         "23 pages",

Genetic Programming entries for William B Langdon