Genetic programming II: automatic discovery of reusable programs
Genetic programming II: automatic discovery of reusable programs
Proceedings of the First European Workshop on Genetic Programming
EuroGP '98 Proceedings of the First European Workshop on Genetic Programming
A Survey And Analysis Of Diversity Measures In Genetic Programming
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Evolving a Generalized Behaviour: Artificial Ant Problem Revisited
EP '98 Proceedings of the 7th International Conference on Evolutionary Programming VII
Strongly typed genetic programming
Evolutionary Computation
Visualizing tree structures in genetic programming
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Adaptable representation in GP
GECCO '05 Proceedings of the 7th annual workshop on Genetic and evolutionary computation
A GP neutral function for the artificial ANT problem
Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
Second order heuristics in ACGP
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Hi-index | 0.00 |
GP uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees, and GP searches the space. Previous research and experimentation show that the choice of the function/terminal set, choice of the initial population, and some other explicit and implicit "design" factors have great influence on both the quality and the speed of the evolution. Such heuristics are valuable simply because they improve GP's performance, or because they enforce some desired properties on the solutions. In this paper, we evaluate the effect of heuristics on GP solving the Santa Fe trail. We concentrate on improving the solution quality, but we also look at efficiency. Various heuristics are tried and mixed by hand, while evaluated with the help of the CGP system. Results show that some heuristics result in very substantial performance improvements, that complex heuristics are usually not decomposable, and that the heuristics generalize to apply to other similar problems, but the applicability reduces with the complexity of the heuristics and the dissimilarity of the new problem to the old one. We also compare such user-mixed heuristics with those generated by the ACGP system which automatically extracts heuristics improving GP performance.