Abstract
Current theories regarding code growth (bloat) in genetic programming focus on the presence and growth of introns. In this paper we show for the first time that code growth can occur, albeit quite slowly, even in code that has a significant impact on fitness.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
John R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. Cambridge, MA: The MIT Press, 1992.
Tobias Blickle and Lothar Thiele. Genetic programming and redundancy. In Jorn Hopf, editor, Genetic Algorithms within the Framework of Evolutionary Computation, pages 33–38. Saarbrucken, Germany: Max-Planck-Institut fur Informatik, 1994.
Peter Nordin and Wolfgang Banzhaf. Complexity compression and evolution. In Larry J. Eshelman, editor, Proceedings of the Sixth International Conference on Genetic Algorithms, pages 310–317. San Francisco, CA: Morgan Kaufmann, 1995.
Nicholas Freitag McPhee and Justin Darwin Miller. Accurate replication in genetic programming. In Larry J. Eshelman, editor, Proceedings of the Sixth International Conference on Genetic Algorithms, pages 303–309. San Francisco, CA: Morgan Kaufmann, 1995.
Terence Soule, James A. Foster, and John Dickinson. Code growth in genetic programming. In John R. Koza, David E. Goldberg, David B. Fogel, and Rick R. Riolo, editors, Genetic Programming 1996: Proceedings of the First Annual Conference, pages 215–223. Cambridge, MA: MIT Press, 1996.
Terence Soule. Code Growth in Genetic Programming. PhD thesis, University of Idaho, University of Idaho, 1998.
Sean Luke. Code growth is not caused by introns. In Late Breaking Papers, Proceedings of the Genetic and Evolutionary Computation Conference 2000, pages 228–235, 2000.
Peter Nordin, Wolfgang Banzhaf, and Frank D. Francone. Introns in nature and in simulated structure evolution. In Proceedings Bio-Computing and Emergent Computation. Springer, 1997.
Peter Nordin. Evolutionary Program Induction of Binary Machine Code and its Application. Muenster: Krehl Verlag, 1997.
W. B. Langdon. Fitness causes bloat: Simulated annealing, hill climbing and popualtions. Technical Report CSRP-97-22, The University of Birmingham, Birmingham, UK, 1997.
Julian Miller. What bloat? cartesian genetic programming on boolean problems. In Late Breaking Papers, Proceedings of the Genetic and Evolutionary Computation Conference 2001, pages 295–302, 2001.
Julian Miller. Evolution of program size in cartesian genetic programming. In Lee Spector, Erik D. Goodman, uAnnie Wu, W. B. Langdon, Hans-Michael Voigt, Mitsuo Gen, Sandip Sen, Marco Dorgio, Shahram Pezeshk, Max H. Garzon, and Edmund Burke, editors, Proceedings of the Genetic and Evolutionary Computation Conference 2001, page 184, 2001.
Peter Smith and Kim Harries. Code growth, explicitly defined introns, and alternative selection schemes. Evolutionary Computation, 6(4):339–360, 1998.
Terence Soule and James A. Foster. Removal bias: a new cause of code growth in tree based evolutionary programming. In ICEC 98: IEEE International Conference on Evolutionary Computation 1998. IEEE Press, 1998.
W. B. Langdon, Terence Soule, Riccardo Poli, and James A. Foster. The evolution of size and shape. In Lee Spector, William B. Langdon, Una-May O’Reilly, and Peter J. Angeline, editors, Advances in Genetic Programming III, pages 163–190. Cambridge, MA: The MIT Press, 1999.
W. B. Langdon. Size fair and homologous tree genetic programming crossovers. 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 1999. Morgan Kaufmann, 1999.
Peter Nordin, Frank Francone, and Wolfgang Banzhaf. Explicitly defined introns and destructive crossover in genetic programming. In P. Angeline and Jr._Kenneth E. Kinnear, editors, Advances in Genetic Programming II, pages 111–134. Cambridge, MA: The MIT Press, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Soule, T. (2002). Exons and Code Growth in Genetic Programming. 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_14
Download citation
DOI: https://doi.org/10.1007/3-540-45984-7_14
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