Linear-Tree GP and its comparison with other GP structures

Created by W.Langdon from gp-bibliography.bib Revision:1.3872

  author =       "Wolfgang Kantschik and Wolfgang Banzhaf",
  title =        "Linear-Tree GP and its comparison with other GP
  booktitle =    "Genetic Programming, Proceedings of EuroGP'2001",
  year =         "2001",
  editor =       "Julian F. Miller and Marco Tomassini and 
                 Pier Luca Lanzi and Conor Ryan and Andrea G. B. Tettamanzi and 
                 William B. Langdon",
  volume =       "2038",
  series =       "LNCS",
  pages =        "302--312",
  address =      "Lake Como, Italy",
  publisher_address = "Berlin",
  month =        "18-20 " # apr,
  organisation = "EvoNET",
  publisher =    "Springer-Verlag",
  keywords =     "genetic algorithms, genetic programming, Linear tree
                 structure, GP representation, Crossover: Poster",
  ISBN =         "3-540-41899-7",
  URL =          "",
  DOI =          "doi:10.1007/3-540-45355-5_24",
  size =         "11 pages",
  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.",
  notes =        "EuroGP'2001, part of \cite{miller:2001:gp}",

Genetic Programming entries for Wolfgang Kantschik Wolfgang Banzhaf