Created by W.Langdon from gp-bibliography.bib Revision:1.7970
In GP crossover one child is created from two parents but the root donating parent (mum) contributes far more than the other (dad). The subtree from the father is usually small and can be extracted from each dad and saved before crossover. This gives single parent crossover, which when combined with fitness first, further reduces the number of crossovers. Even in the worst case the reduction is exp(-1) = 37 percent.
With large trees, even in populations of similar fitness, eliminating bachelors and spinsters is feasible and can reduce both runtime and memory consumption. Storage in a (N) multi-threaded implementation for a population M is about 0.63M + N, compared to the usual M+2N, in practice saving > 17percent. We achieve 692 billion GP operations per second, 692 giga GPops, on an Intel i7-9800X 16 thread 3.8GHz desktop (CPU bandwidth 85 GByte/second).",
GECCO-2021 A Recombination of the 30th International Conference on Genetic Algorithms (ICGA-2021) and the 26th Annual Genetic Programming Conference (GP-2021)",
Genetic Programming entries for William B Langdon