Abstract: In recent years different genetic programming (GP) structures have emerged. Today, the basic forms of representation for genetic programs are tree, linear and graphstructures. In this contribution we introduce a new kind of GP structure which we call linear-graph. This is a further development to the linear-tree structure that we developed earlier. We describe the linear-graph structure, as well as crossover and mutation for this new GP structure in detail. We compare linear-graph programs withlinear and tree programs by analyzing their structure and results on different test problems.
External IDs:dblp:conf/eurogp/KantschikB02
Loading