Linear-Tree GP and Its Comparison with Other GP Structures

  • Wolfgang Kantschik
  • Wolfgang Banzhaf
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2038)


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.


Genetic Programming Crossover Operation Result Register Left Child Linear Genetic Programming 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Ang97.
    P.J. Angeline. Subtree crossover: Building block engine or macromutation? In Genetic Programming 1997: Proceedings of the Second Annual Conference, pages 9–17, San Francisco, CA, 1997. Morgan Kaufmann.Google Scholar
  2. BB01.
    M. Brameier and W. Banzhaf. Evolving teams of mutiple predictors with Genetic Programming. Technical report, Universitt Dortmund SFB 531, 2001. Data available from the authors.Google Scholar
  3. BDKB98.
    M. Brameier, P. Dittrich, W. Kantschik, and W. Banzhaf. SYSGP-A C++ library of different GP variants. Technical Report Internal Report of SFB 531,ISSN 1433-3325, Fachbereich Informatik, Universität Dortmund, 1998.Google Scholar
  4. BNKF98.
    W. Banzhaf, P. Nordin, R.E. Keller, and F.D. Francone. Genetic Programming-An Introduction On the Automatic Evolution of Computer Programs and its Applications. Morgan Kaufmann, San Francisco und dpunkt verlag, Heidelberg, 1998.zbMATHGoogle Scholar
  5. Hol75.
    J. Holland. Adaption in Natural and Artifical Systems. MI: The University of Michigan Press, 1975.Google Scholar
  6. Koz92.
    J. Koza. Genetic Programming. MIT Press, Cambridge, MA, 1992.zbMATHGoogle Scholar
  7. Koz94.
    J. Koza. Genetic Programming II. MIT Press, Cambridge, MA, 1994.zbMATHGoogle Scholar
  8. LP98.
    W.B. Langdon and R. Poli. Genetic programming bloat with dynamic fitness. In Wolfgang Banzhaf, Riccardo Poli, Marc Schoenauer, and Terence C. Fogarty, editors, Proceedings of the First European Workshop on Genetic Programming, volume 1391 of LNCS, pages 96–112, Paris, 14-15 April 1998. Springer-Verlag.Google Scholar
  9. MH99.
    Nicholas Freitag McPhee and Nicholas J. Hopper. Analysis of genetic diversity through population history. In Wolfgang Banzhaf, Jason Daida, Agoston E. Eiben, Max H. Garzon, Vasant Honavar, Mark Jakiela, and Robert E. Smith, editors, Proceedings of the Genetic and Evolutionary Computation Conference, volume 2, pages 1112–1120, Orlando, Florida, USA, 13-17 July 1999. Morgan Kaufmann.Google Scholar
  10. MM95.
    Nicholas Freitag McPhee and Justin Darwin Miller. Accurate replication in genetic programming. In L. Eshelman, editor, Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA95), pages 303–309, Pittsburgh, PA, USA, 15-19 July 1995. Morgan Kaufmann.Google Scholar
  11. Nor94.
    J.P. Nordin. A Compiling Genetic Programming System that Directly Manipulates the Machine code. MIT Press, Cambridge, 1994.Google Scholar
  12. TV96.
    A. Teller and M. Veloso. Pado: A new learning architecture for object recognition. In Symbolic Visual Learning, pages 81–116. Oxford University Press, 1996.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Wolfgang Kantschik
    • 1
  • Wolfgang Banzhaf
    • 1
    • 2
  1. 1.Dept. of Computer ScienceUniversity of DortmundDortmundGermany
  2. 2.Informatik Centrum Dortmund (ICD)DortmundGermany

Personalised recommendations