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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
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.
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.
J. Holland. Adaption in Natural and Artifical Systems. MI: The University of Michigan Press, 1975.
J. Koza. Genetic Programming. MIT Press, Cambridge, MA, 1992.
J. Koza. Genetic Programming II. MIT Press, Cambridge, MA, 1994.
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.
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.
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.
J.P. Nordin. A Compiling Genetic Programming System that Directly Manipulates the Machine code. MIT Press, Cambridge, 1994.
A. Teller and M. Veloso. Pado: A new learning architecture for object recognition. In Symbolic Visual Learning, pages 81–116. Oxford University Press, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kantschik, W., Banzhaf, W. (2001). Linear-Tree GP and Its Comparison with Other GP Structures. In: Miller, J., Tomassini, M., Lanzi, P.L., Ryan, C., Tettamanzi, A.G.B., Langdon, W.B. (eds) Genetic Programming. EuroGP 2001. Lecture Notes in Computer Science, vol 2038. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45355-5_24
Download citation
DOI: https://doi.org/10.1007/3-540-45355-5_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41899-3
Online ISBN: 978-3-540-45355-0
eBook Packages: Springer Book Archive