Size Fair and Homologous Tree Crossovers for Tree Genetic Programming

@article{Langdon2000SizeFA,
  title={Size Fair and Homologous Tree Crossovers for Tree Genetic Programming},
  author={William B. Langdon},
  journal={Genetic Programming and Evolvable Machines},
  year={2000},
  volume={1},
  pages={95-119}
}
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… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 46 CITATIONS

Prudent alignment and crossover of decision trees in genetic programming

  • Matej Sprogar
  • Computer Science
  • Genetic Programming and Evolvable Machines
  • 2015
VIEW 12 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Genetic and Evolutionary Computation — GECCO 2003

VIEW 18 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

What Makes a Problem GP-Hard? Validating a Hypothesis of Structural Causes

VIEW 6 EXCERPTS
CITES BACKGROUND & RESULTS
HIGHLY INFLUENCED

Effectiveness of Multi-step Crossover in Extrapolation Domain for Genetic Programming

VIEW 1 EXCERPT
CITES BACKGROUND

Understanding grammatical evolution: initialisation

  • Miguel Nicolau
  • Computer Science
  • Genetic Programming and Evolvable Machines
  • 2017