Abstract
Using deliberately designed primitive sets, we investigate the relationship between context-based expression mechanisms and the size, height and density of genetic program trees during the evolutionary process. We show that contextual semantics influence the composition, location and flows of operative code in a program. In detail we analyze these dynamics and discuss the impact of our findings on micro-level descriptions of genetic programming.
Preview
Unable to display preview. Download preview PDF.
References
D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, MA, 1989.
J. R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, 1992.
Una-May O’Reilly and David E. Goldberg. The impact of fitness structure on sub-solution acquisition. Technical report, University of Illinois, Urbana-Champaign, Illinois, February 1998. Available via ftp from the Illigal WWW site.
D. E. Goldberg, K. Deb, and J. Clark. Genetic algorithms, noise, and the sizing of populations. Complex Systems, 6:333–3624, 1992.
D. E. Goldberg, B. Korb, and K. Deb. Messy genetic algorithms: Motivation, analysis and first results. Complex Systems, 4:415–444, 1989.
D. H. Ackley. Stochastic iterated genetic hill-climbing. Technical Report CMU-CS-87-107, Carnegie-Mellon University, Pittsburgh, PA, 1987.
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.
Peter Nordin, Frank Francone, and Wolfgang Banzhaf. Explicitly defined introns and destructive crossover in genetic programming. In Peter J. Angeline and K. E. Kinnear, Jr., editors, Advances in Genetic Programming 2, chapter 6, pages 111–134. MIT Press, Cambridge, MA, USA, 1996.
W. A. Tackett. Recombination, Selection, and the Genetic Construction of Computer Programs. PhD thesis, University of Southern California, Department of Electrical Engineering Systems, 1994.
Justinian P. Rosca and Dana H. Ballard. Complexity drift in evolutionary computation with tree representations. Technical Report NRL5, University of Rochester, Computer Science Department, Rochester, NY, USA, December 1996.
David Andre and Astro Teller. A study in program response and the negative effects of introns in genetic programming. In John R. Koza, David E. Goldberg, David B. Fogel, and Rick L. Riolo, editors, Genetic Programming 1996: Proceedings of the First Annual Conference, pages 12–20, Stanford University, CA, USA, 28–31 July 1996. MIT Press.
Justinian Rosca and Dana H. Ballard. Causality in genetic programming. In L. Eshelman, editor, Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA95), pages 256–263, Pittsburgh, PA, USA, 15–19 July 1995. Morgan Kaufmann.
Justinian Rosca. Generality versus size in genetic programming. In John R. Koza, David E. Goldberg, David B. Fogel, and Rick L. Riolo, editors, Genetic Programming 1996: Proceedings of the First Annual Conference, pages 381–387, Stanford University, CA, USA, 28–31 July 1996. MIT Press.
Justinian Rosca. Analysis of complexity drift in genetic programming. In John R. Koza, Kalyanmoy Deb, Marco Dorigo, David B. Fogel, Max Garzon, Hitoshi Iba, and Rick L. Riolo, editors, Genetic Programming 1997: Proceedings of the Second Annual Conference, 28–31 July 1997.
Terence Soule and James A. Foster. Code size and depth flows in genetic programming. In John R. Koza, Kalyanmoy Deb, Marco Dorigo, David B. Fogel, Max Garzon, Hitoshi Iba, and Rick L. Riolo, editors, Genetic Programming 1997: Proceedings of the Second Annual Conference, pages 313–320, Stanford University, CA, USA, 13–16 July 1997. Morgan Kaufmann.
D. E. Goldberg. Making genetic algorithms fly: A lesson from the wright brothers. Advanced Technology for Developers, 2:1–8, 1993.
D. E. Goldberg. Toward a mechanics of conceptual machines: Developments in theoretical and applied mechanics. In Proceedings of the Eighteenth Southeastern Conference on Theoretical and Applied Mechanics, volume 18, 1996.
D. E. Goldberg, K. Deb, and B. Korb. Messy genetic algorithms revisited: Studies in mixed size and scale. Complex Systems, 4:415–444, 1990.
J. Horn and D. E. Goldberg. Genetic algorithm difficulty and the modality of fitness landscapes. In L. D. Whitley and M. D. Vose, editors, Foundations of Genetic Algorithms, volume 3, San Mateo, CA, 1995. Morgan Kaufmann. (To appear).
G. Harik, E. CantuÚ-Paz, D.E. Goldberg, and B.L. Miller. The gambler’s ruin problem, genetic algorithms, and the sizing of populations.
D. E. Goldberg, K. Deb, and D. Thierens. Toward a better understanding of mixing in genetic algorithms. Journal of the Society of Instrument and Control Engineers, 32(1):10–16, 1993.
D. Thierens and D. E. Goldberg. Mixing in genetic algorithms. In S. Forrest, editor, Proceedings of the Fifth International Conference on Genetic Algorithms, San Mateo, CA, 1993. Morgan Kaufmann.
D. Thierens. Analysis and design of genetic algorithms. PhD thesis, Katholieke Universiteit Leuven, 1995.
D. E. Goldberg, K. Deb, H. Kargupta, and G. Harik. Rapid, accurate optimization of difficult problems using fast messy genetic algorithms. In S. Forrest, editor, Proceedings of the Fifth International Conference on Genetic Algorithms, pages 56–64, San Mateo, CA, 1993. Morgan Kaufmann.
G. Harik. Learning gene linkage to efficiently solve problems of bounded difficulty using genetic algorithms. PhD thesis, University of Michigan, Ann Arbor, 1997. Unpublished doctoral dissertation (also IlliGAL 97005).
H. Kargupta. Search, evolution, and the gene expression messy genetic algorithm. Technical Report Unclassified Report LA-UR 96-60, Los Alamos National Laboratory, Los Alamos, NM, 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goldberg, D.E., O’Reilly, UM. (1998). Where does the good stuff go, and why? how contextual semantics influences program structure in simple genetic programming. In: Banzhaf, W., Poli, R., Schoenauer, M., Fogarty, T.C. (eds) Genetic Programming. EuroGP 1998. Lecture Notes in Computer Science, vol 1391. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055925
Download citation
DOI: https://doi.org/10.1007/BFb0055925
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64360-9
Online ISBN: 978-3-540-69758-9
eBook Packages: Springer Book Archive