Linear-Tree GP and Its Comparison with Other GP Structures

Wolfgang Kantschik, Wolfgang Banzhaf

Published: 2001, Last Modified: 28 Feb 2026EuroGP 2001EveryoneRevisionsBibTeXCC BY-SA 4.0
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.
Loading