Abstract
Genetic Programming (GP) is gradually being accepted as a promising variant of Genetic Algorithm (GA) that evolves dynamic hierarchical structures, often described as programs. In other words GP seemingly holds the key to attain the goal of “automated program generation”. However one of the serious problems of GP lies in the “code growth” or “size problem” that occurs as the structures evolve, leading to excessive pressure on system resources and unsatisfying convergence. Several researchers have addressed the problem. However, absence of a general framework and physical constraints, viz, infinitely large resource requirements have made it difficult to find any generic explanation and hence solution to the problem. This paper surveys the major research works in this direction from a critical angle. Overview of a few other major GP concerns is covered in brief. We conclude with a general discussion on “code growth” and other critical aspects of GP techniques, while attempting to highlight on future research directions to tackle such problems.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
Byoung-Tak Zhang and Heinz Muhlenbein. Balancing Accuracy and Parsimony in Genetic Programming. Evolutionary Computation, 3(1): 17–38, 1995.
Chris Gathercole and Peter Ross. An Adverse Interaction Between Crossover and Restricted Tree Depth in Genetic Programming-presented at GP 96
John R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection.MIT Press, 1992.
Justinian P. Rosca. Generality Versus Size in Genetic Programming. Proceedings of the Genetic Programming 1996 Conference (GP-96), The MIT Press.
Justinian P. Rosca. Analysis of Complexity Drift in Genetic Programming. Proceedings of the Second Annual Conference on Genetic Programming, 1997.
Lee Altenberg. Emergent Phenomena in Genetic Programming. Evolutionary Programming-Proceedings of the Third Annual Conference, pp233–241. World Scientific Publishing, 1994.
Nicholas F. McPhee and J. D. Miller. Accurate Replication in Genetic Programming. Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA95), pp303–309. Morgan Kaufmann.1995.
Peter J. Angeline. Subtree Crossover Causes Bloat. Genetic Programming 1998: Proceedings of the Third Annual Conference, pp745–752, Wisconsin. Morgan Kaufmann.1998.
Peter Nordin and Wolfgang Banzhaf. Complexity Compression and Evolution. ICGA95, pp310–317, Morgan Kaufmann. 1995.
Peter Nordin, Frank Francone, and Wolfgang Banzhaf. Explicitly Defined Introns and Destructive Crossover in Genetic Programming. Advances in Genetic Programming 2, pp111–134. MIT Press, 1996.
Peter Nordin. Evolutionary Program Induction of Binary Machine Code and Its Applications. PhD thesis, der Universitat Dortmund am Fachereich Informatik, 1997.
Tobias Blickle and L. Thiele. Genetic Programming and Redundancy. Proc. Genetic Algorithms within the Framework of Evolutionary Computation (Workshop at KI-94), Saarbrücken, Germany, 1994.
Terence Soule, J. A. Foster, and J. Dickinson. Code Growth in Genetic Programming. Genetic Programming 1996: Proceedings of the First Annual Conference, pp215–223, Stanford. MIT Press.1996.
Terence Soule and James A. Foster. Code Size and Depth Flows in Genetic Programming. Genetic Programming 1997, pp313–320. Morgan Kaufmann.1997.
Terence Soule. Code Growth in Genetic Programming. PhD. Dissertation. University of Idaho. May 15, 1998.
Tobias Blickle. Evolving Compact Solutions in Genetic Programming: A Case Study. Parallel Problem Solving From Nature IV. LNCS 1141, pp564–573. Springer.1996.
Sean Luke. Issues in Scaling Genetic Programming: Breeding Strategies, Tree Generation, and Code Growth. PhD. Thesis, 2000.
William. B. Langdon, T. Soule, R. Poli, and J. A. Foster. The Evolution of Size and Shape. Advances in Genetic Programming 3, pp163–190. MIT Press.
William. B. Langdon and R. Poli. Fitness Causes Bloat: Mutation. EuroGP’ 98, Springer-Verlag.1998.
Willam. B. Langdon. Quadratic Bloat in Genetic Programming. Presented at GECCO’2000.
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
Bhattacharya, M., Nath, B. (2001). Genetic Programming: A Review of Some Concerns. In: Alexandrov, V.N., Dongarra, J.J., Juliano, B.A., Renner, R.S., Tan, C.J.K. (eds) Computational Science - ICCS 2001. ICCS 2001. Lecture Notes in Computer Science, vol 2074. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45718-6_109
Download citation
DOI: https://doi.org/10.1007/3-540-45718-6_109
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42233-4
Online ISBN: 978-3-540-45718-3
eBook Packages: Springer Book Archive