Abstract
In recent years different genetic programming (GP) structures have emerged. Today, the basic forms of representation for genetic programs are tree, linear and graph structures. In this contribution we introduce a new kind of GP structure which we call Linear-tree. We describe the linear-tree-structure, as well as crossover and mutation for this new GP structure in detail. We compare linear-tree programs with linear and tree programs by analyzing their structure and results on different test problems.
Cite
CITATION STYLE
Kantschik, W., & Banzhaf, W. (2001). Linear-tree GP and its comparison with other GP structures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2038, pp. 302–312). Springer Verlag. https://doi.org/10.1007/3-540-45355-5_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
