The evolution of evolvability in genetic programming
Advances in genetic programming
Non-destructive Depth-Dependent Crossover for Genetic Programming
EuroGP '98 Proceedings of the First European Workshop on Genetic Programming
Evaluating GP schema in context
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Using context-aware crossover to improve the performance of GP
Proceedings of the 8th annual conference on Genetic and evolutionary computation
A less destructive, context-aware crossover operator for GP
EuroGP'06 Proceedings of the 9th European conference on Genetic Programming
Testing the CAX on a Real-World Problem and Other Benchmarks
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Tree-structure-aware GP operators for automatic gait generation of quadruped robot
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
A survey and taxonomy of performance improvement of canonical genetic programming
Knowledge and Information Systems
Semantically-based crossover in genetic programming: application to real-valued symbolic regression
Genetic Programming and Evolvable Machines
DepthLimited crossover in GP for classifier evolution
Computers in Human Behavior
| Hi-index | 0.00 |
Crossover in Genetic Programming is mostly a destructive operator, generally producing children worse than the parents and occasionally producing those who are better. A recently introduced operator, Context-Aware Crossover, which implicitly discovers the best possible crossover site for a subtree has been shown to consistently attain higher fitnesses while processing fewer individuals.It has been observed that context-aware crossover is similar to Brood Crossover in that multiple children are produced during each crossover event. This paper performs a thorough analysis of these crossover operators and compares the performance of the two and demonstrates that, although they do work similarly, context-aware crossover performs a far better sampling of the search space and thus performs much better.We also demonstrate that context-aware crossover benefits from a speed up of almost an order of magnitude when using a simple and very small cache, which is over two orders of magnitute smaller than caches typically used.