- author = "William B. Langdon",
- title = "Size Fair and Homologous Tree Genetic Programming Crossovers",
- 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 = "
http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/WBL_fairxo.pdf",
-
URL = "
http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/WBL_fairxo.ps.gz",
-
URL = "
https://rdcu.be/cDoM0",
-
DOI = "
doi:10.1023/A:1010024515191",
-
code_url = "http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/gp-code/ntrees.cc",
-
code_url = "http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/gp-code/rand_tree.cc",
- 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 ridge.
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",
