Created by W.Langdon from gp-bibliography.bib Revision:1.8098
From analysis of sub-tree components making up successful and unsuccessful programs it was noted that a small number of particular components were almost always present in successful programs, and that these components were often absent from unsuccessful programs. Also a variety of components appeared in unsuccessful programs that were never present in successful ones. Evidence from runs suggests that these components represent paths leading to optimal and sub-optimal branches in the evolutionary search space. Additionally, results suggest that if sub-optimal components (which mirror the concept of deception in genetic algorithms) are relatively greater in number than the optimal components for the problem, then the chances of GP finding a successful solution are reduced.",
Genetic Programming entries for Thomas Loveard Victor Ciesielski