Linear-Tree GP and Its Comparison with Other GP Structures

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.

• Type: Conference
• Year: 2001
• Where: EUROGP
• Authors: Wolfgang Kantschik, Wolfgang Banzhaf
• Keywords: Different Genetic Programming, EUROGP 2001, Genetic Programs, GP Structure, Optimization