Size Fair and Homologous Tree Genetic Programming Crossovers

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

  author =       "William B. Langdon",
  title =        "Size Fair and Homologous Tree Genetic Programming
  journal =      "Genetic Programming and Evolvable Machines",
  year =         "2000",
  volume =       "1",
  number =       "1/2",
  pages =        "95--119",
  month =        apr,
  keywords =     "genetic algorithms, genetic programming, bloat
                 reduction, evolution of shape, subquadratic length
                 growth, linear depth growth, uniform initialisation,
                 binary tree search spaces",
  ISSN =         "1389-2576",
  URL =          "",
  URL =          "",
  DOI =          "doi:10.1023/A:1010024515191",
  size =         "29 pages",
  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 (ie less bloat) and no detrimental effect
                 on GP performance.

                 GP search spaces are partitioned by the ridge in the
                 number of program versus 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 =        "Improved version of \cite{langdon:1999:fairxTR} See
                 also \cite{langdon:1999:fairxo}, langdon:1999:fairxo2p
                 Article ID: 253706",

Genetic Programming entries for William B Langdon