Abstract
This paper introduces a random tree generation algorithm for GP (Genetic Programming). Generating random trees is an essential part of GP. However, the recursive method commonly used in GP does not necessarily generate random trees, i.e the standard GP initialization procedure does not sample the space of possible initial trees uniformly. This paper proposes a truly random tree generation procedure for GP. Our approach is grounded upon a bijection method, i.e., a 1–1 correspondence between a tree with n nodes and some simple word composed by letters x and y. We show how to use this correspondence to generate a GP tree and how GP search is improved by using this “randomness”.
Preview
Unable to display preview. Download preview PDF.
References
Alonso,L. and Schott,R., Random Generation of Trees, Kluwer Academic Publishers, 1995
Er,M.C., Enumerating Ordered Trees Lexicographically, in The Computer Journal, vol.28, no.5, pp.538–543, 1985
Iba,H., Generating Random Trees for Genetic Programming, Computers ETL-TR-95-35, 1995
Koza, J. Genetic Programming, On the Programming of Computers by means of Natural Selection, MIT Press, 1992
Lang,K.J., Hill Climbing Beats Genetic Search on a Boolean Circuit Synthesis Problem of Koza's, in Proc. of 12th Machine Learning Workshop, pp.340–344, 1995
Lovasz, L. Combinational problem and exercises, Akademiai Kiado, Budapest, 1979
Montana, D.J., Strongly Typed Genetic Programming, in Evolutionary Computation, vol.3, no.2, pp.199–230, 1995
Oakley, H. Two Scientific Applications of Genetic Programming: Stack Filters and Non-Linear Equation Fitting to Chaotic Data, in Advances in Genetic Programming, (ed. Kenneth E. Kinnear, Jr.), MIT Press, 1994
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Iba, H. (1996). Random tree generation for genetic programming. In: Voigt, HM., Ebeling, W., Rechenberg, I., Schwefel, HP. (eds) Parallel Problem Solving from Nature — PPSN IV. PPSN 1996. Lecture Notes in Computer Science, vol 1141. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61723-X_978
Download citation
DOI: https://doi.org/10.1007/3-540-61723-X_978
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61723-5
Online ISBN: 978-3-540-70668-7
eBook Packages: Springer Book Archive