Skip to main content
SpringerLink
Log in

Linear-Graph GP - A New GP Structure

  • Conference paper
  • First Online:
Genetic Programming (EuroGP 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2278))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. P.J. Angeline. Multiple interacting programs: A representation for evolving complex behaviors. Cybernetics and Systems (in press), 1998.

    Google Scholar 

  3. 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.

    MATH  Google Scholar 

  4. M. Brameier and W. Banzhaf. Evolving teams of mutiple predictors with Genetic Programming. Genetic Programming and Evolvable Maschines, 2(4):381–407, 2001.

    Article  MATH  Google Scholar 

  5. 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 

  6. J. Holland. Adaption in Natural and Artifical Systems. MI:The University of Michigan Press, 1975.

    Google Scholar 

  7. W. Kantschik and W. Banzhaf. Linear-tree GP and its comparison with other GP structures. In J. F. Miller, M. Tomassini, P. Luca Lanzi, C. Ryan, A. G. B. Tettamanzi, and W. B. Langdon, editors, Genetic Programming, Proceedings of EuroGP’2001, volume 2038 of LNCS, pages 302–312, Lake Como, Italy, 18-20 April 2001. Springer-Verlag.

    Chapter  Google Scholar 

  8. J. Koza. Genetic Programming. MIT Press, Cambridge, MA, 1992.

    MATH  Google Scholar 

  9. J. Koza. Genetic Programming II. MIT Press, Cambridge, MA, 1994.

    MATH  Google Scholar 

  10. J. P. Nordin. A Compiling Genetic Programming System that Directly Manipulates the Machine code. MIT Press, Cambridge, 1994.

    Google Scholar 

  11. Riccardo Poli. Evolution of graph-like programs with parallel distributed genetic programming. In Thomas Back, editor, Genetic Algorithms: Proceedings of the Seventh International Conference, pages 346–353, Michigan State University, East Lansing, MI, USA, 19-23 July 1997. Morgan Kaufmann.

    Google Scholar 

  12. 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 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, University of Dortmund, Dortmund, Germany

    Wolfgang Kantschik & Wolfgang Banzhaf

  2. Informatik Centrum Dortmund (ICD), Dortmund, Germany

    Wolfgang Banzhaf

Authors
  1. Wolfgang Kantschik
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wolfgang Banzhaf
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Idaho, 83844-1010, Moscow, ID, USA

    James A. Foster

  2. INRIA Rocquencourt, B.P. 105, 78153, Le Chesnay Cedex, France

    Evelyne Lutton

  3. School of Computer Science, University of Birmingham, B15 2TT, Birmingham, UK

    Julian Miller

  4. Department of Computer Science and Information Systems, University of Limerick, Schuman Building, Limerick, Ireland

    Conor Ryan

  5. Dip. Tecnologie dell’Informazione, Università degli Studi di Milano, Via Bramante 65, 26013, Crema, Italy

    Andrea Tettamanzi

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kantschik, W., Banzhaf, W. (2002). Linear-Graph GP - A New GP Structure. In: Foster, J.A., Lutton, E., Miller, J., Ryan, C., Tettamanzi, A. (eds) Genetic Programming. EuroGP 2002. Lecture Notes in Computer Science, vol 2278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45984-7_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-45984-7_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43378-1

  • Online ISBN: 978-3-540-45984-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation