Modification point depth and genome growth in genetic programming

Evolutionary Computation

Volumn 11, Issue 1, 2003, Pages 67-106

  Luke, Sean ^a  

^a George Mason University   (United States)

Author keywords

Code Bloat; Crossover Point; Genetic Programming; Introns; Inviable Code

Indexed keywords

MUTATIONS;

DNA; FINITE AUTOMATA; GENES; GENETIC ALGORITHMS;

GENETIC ENGINEERING;

ALGORITHM; ARTICLE; BIOLOGICAL MODEL; COMPUTER SIMULATION; CROSSING OVER; EVOLUTION; GENOME; INTRON; MUTATION; STATISTICAL MODEL;

ALGORITHMS; COMPUTER SIMULATION; CROSSING OVER, GENETIC; EVOLUTION; GENOME; INTRONS; MODELS, GENETIC; MODELS, STATISTICAL; MUTATION;

EID: 0042879992     PISSN: 10636560     EISSN: None     Source Type: Journal    
DOI: 10.1162/106365603321829014     Document Type: Article

References (72)

1. Andre, D. and Teller, A. (1996). A study in program response and the negative effects of introns in genetic programming. In Koza, J. R., Goldberg, D. E., Fogel, D. B., and Riolo, R. L., editors, Genetic Programming 1996: Proceedings of the First Annual Conference, pages 12-20, Stanford University, CA, USA. MIT Press.
2. Angeline, P. J. (1994). Genetic programming and emergent intelligence. In Kinnear, Jr., K. E., editor, Advances in Genetic Programming, pages 75-98. MIT Press.
3. Angeline, P. J. (1996). Two self-adaptive crossover operators for genetic programming. In Angeline, P. J. and Kinnear, Jr., K. E., editors, Advances in Genetic Programming 2, pages 89-110. MIT Press, Cambridge, MA, USA.
4. Angeline, P. J. (1998). Subtree crossover causes bloat. In Koza, J. R., Banzhaf, W., Chellapilla, K., Deb, K., Dorigo, M., Fogel, D. B., Garzon, M. H., Goldberg, D. E., Iba, H., and Riolo, R., editors, Genetic Programming 1998: Proceedings of the Third Annual Conference, pages 745-752, University of Wisconsin, Madison, Wisconsin, USA. Morgan Kaufmann.
5. Angeline, P. J., Saunders, G. M., and Pollack, J. B. (1994). An evolutionary algorithm that constructs recurrent neural networks. IEEE Transactions on Neural Networks, pages 54-65.
6. Banzhaf, W., Nordin, P., Keller, R. E., and Francone, F. D. (1998). Genetic Programming - An Introduction; On the Automatic Evolution of Computer Programs and its Applications. Morgan Kaufmann.
7. Bassett, J. K. and De Jong, K. A. (2000). Evolving behaviors for cooperating agents. In Ras, Z. W. and Ohsuga, S., editors, Proceedings of the Twelth International Symposium on Methodologies for Intelligent Systems, pages 157-165. Springer-Verlag.
8. Bleuler, S., Brack, M., Thiele, L., and Zitzler, E. (2001). Multiobjective genetic programming: Reducing bloat using SPEA2. In Proceedings of the 2001 Congress on Evolutionary Computation CEC2001, pages 536-543, COEX, World Trade Center, 159 Samseong-dong, Gangnam-gu, Seoul, Korea. IEEE Press.
9. Blickle, T. (1996). Theory of Evolutionary Algorithms and Application to System Synthesis. PhD thesis, Swiss Federal Institute of Technology, Zurich.
10. Blickle, T. and Thiele, L. (1994). Genetic programming and redundancy. In Hopf, J., editor, Genetic Algorithms within the Framework of Evolutionary Computation (Workshop at KI-94, Saarbrücken), pages 33-38, Saarbrücken,Germany. Max-Planck-Institut für Informatik.
11. Boers, E. J. W., Kuiper, H., M., B. L., and Sprinkhuizen-Kuyper, I. G. (1993). Designing modular artificial networks. In Wijshoff, H. A., editor, Proceedings of Computing Science in The Netherlands, pages 154-159, Amsterdam. SION, Stichting Mathematisch Centrum.
12. Brave, S. (1996). Evolving deterministic finite automata using cellular encoding. In Koza, J. R., Goldberg, D. E., Fogel, D. B., and Riolo, R. L., editors, Genetic Programming 1996: Proceedings of the First Annual Conference, pages 39-44, Stanford University, CA, USA. MIT Press.
13. Burke, D., De Jong, K., Grefenstette, J., Ramsey, C., and Wu, A. (1998). Putting more genetics into genetic algorithms. Evolutionary Computation, 6(4).
14. Collins, R. and Jefferson, D. (1991). An artificial neural network representation for artificial organisms. In Schwefel, H. P. and Mäanner, R., editors, Parallel Problem Solving from Nature, pages 269-263, Berlin. Springer-Verlag.
15. De Jong, E. D., Watson, R. A., and Pollack, J. B. (2001). Reducing bloat and promoting diversity using multi-objective methods. In Spector, L., Goodman, E. D., Wu, A., Langdon, W. B., Voigt, H.-M., Gen, M., Sen, S., Dorigo, M., Pezeshk, S., Garzon, M. H., and Burke, E., editors, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), pages 11-18, San Francisco, California, USA. Morgan Kaufmann.
16. De Jong, K. (1989). Using genetic algorithms to learn task programs: the pitt approach. Machine Learning, 2(2-3).
17. Fogel, L. J., Owens, A. J., and Walsh, M. J. (1966). Artificial Intelligence through Simulated Evolution. John Wiley, New York.
18. Fullmer, B. and Miikkulainen, R. (1991). Using marker-based genetic encoding of neural networks to evolve finite-state behavior. In Varela, F. and Bourgine, P., editors, Proceedings of the First European Conference on Artificial Life (ECAL-91), Paris, Cambridge, MA: A bradford Book. MIT Press.
19. Gathercole, C. and Ross, P. (1996). An adverse interaction between crossover and restricted tree depth in genetic programming. In Koza, J. R., Goldberg, D. E., Fogel, D. B., and Riolo, R. L., editors, Genetic Programming 1996: Proceedings of the First Annual Conference, pages 291-296, Stanford University, CA, USA. MIT Press.
20. Goldberg, D. E., Deb, K., Kargupta, H., and Harik, G. (1993). Rapid, accuate optimization of difficult problems using fast messy genetic algorithms. In Proceedings of the Fifth Annual International Conference of Genetic Algorithms (ICGA-93), pages 56-64. Morgan Kaufmann.
21. Gruau, F. (1992). Genetic synthesis of boolean neural networks with a cell rewriting developmental process. In Schaffer, J. D. and Whitley, D., editors, Proceedings of the Workshop on Combinations of Genetic Algorithms and Neural Networks (COGANN92), pages 55-74. The IEEE Computer Society Press.
22. Handley, S. (1994). On the use of a directed acyclic graph to represent a population of computer programs. In Proceedings of the 1994 IEEE World Congress on Computational Intelligence, pages 154-159, Orlando, Florida, USA. IEEE Press.
23. Haynes, T. (1998). Collective adaptation: The exchange of coding segments. Evolutionary Computation, 6(4):311-338.
24. Iba, H., de Garis, H., and Sato, T. (1994). Genetic programming using a minimum description length principle. In Kinnear, Jr., K. E., editor, Advances, in Genetic Programming, pages 265-284. MIT Press.
25. Iba, H. and Terao, M. (2000). Controlling effective introns for multi-agent learning by genetic programming. In Whitley, D., Goldberg, D., Cantú-Paz, E., Spector, L., Parmee, I., and Beyer, H.-G., editors, GECCO-2000: Proceedings of the Genetic and Evolutionary Computation Conference, pages 419-426. Morgan Kaufmann, San Fransisco.
26. Igel, C. and Chellapilla, K. (1999). Investigating the influence of depth and degree of genotypic change on fitness in genetic programming. In Banzhaf, W., Daida, J., Eiben, A. E., Garzon, M. H., Honavar, V., Jakiela, M., and Smith, R. E., editors, Proceedings of the Genetic and Evolutionary Computation Conference, volume 2, pages 1061-1068, Orlando, Florida, USA. Morgan Kaufmann.
27. Ito, T., Iba, H., and Sato, S. (1999). A self-tuning mechanism for depth-dependent crossover. In Spector, L., Langdon, W. B., O'Reilly, U.-M., and Angeline, P. J., editors, Advances in Genetic Programming 3, chapter 16, pages 377-399. MIT Press, Cambridge, MA, USA.
28. Jakobi, N. (1995). Harnessing morphogenesis. In International Conference on Information Processing in Cells and Tissues, pages 29-41. University of Liverpool.
29. Jones, E. A. and Joines, W. T. (1999). Genetic design of electronic circuits. In Brave, S. and Wu, A. S., editors, Late Breaking Papers at the 1999 Genetic and Evolutionary Computation Conference, pages 125-133, Orlando, Florida, USA.
30. Kargupta, H. (1996). The gene expression messy genetic algorithm. In Proceedings of the IEEE International Conference on Evolutionary Computation, pages 814-819. IEEE Press.
31. Keijzer, M. (1996). Efficiently representing populations in genetic programming. In Angeline, P. J. and Kinnear, Jr., K. E., editors, Advances in Genetic Programming 2, pages 259-278. MIT Press, Cambridge, MA, USA.
32. Kitano, H. (1990). Designing neural networks using a genetic algorithm with a graph generation system. Complex Systems, 4:461-476.
33. Koza, J. R. (1992). Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA.
34. Koza, J. R., Bennett III, F. H., Hutchings, J. L., Bade, S. L., Keane, M. A., and Andre, D. (1997a). Evolving sorting networks using genetic programming and rapidly reconfigurable field-programmable gate arrays. In Higuchi, T., editor, Workshop on Evolvable Systems. International Joint Conference on Artificial Intelligence, pages 27-32, Nagoya.
35. Koza, J. R., Bennett III, F. H., Lohn, J., Dunlap, F., Keane, M. A., and Andre, D. (1997b). Automated synthesis of computational circuits using genetic programming. In Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, pages 447-452, Indianapolis. IEEE Press.
36. Koza, J. R. and Rice, J. P. (1991). Genetic generation of both the weights and architecture for a neural network. In International Joint Conference on Neural Networks, IJCNN-91, volume 2, pages 397-404, Washington State Convention and Trade Center, Seattle, WA, USA. IEEE Computer Society Press.
37. Langdon, W. B. (1998). The evolution of size in variable length representations. In 1998 IEEE International Conference on Evolutionary Computation, pages 633-638, Anchorage, Alaska, USA. IEEE Press.
38. Langdon, W. B. (2000). Quadratic bloat in genetic programming. In Whitley, D., Goldberg, D., Cantú-Paz, E., Spector, L., Parmee, I., and Beyer, H.-G., editors, GECCO-2000: Proceedings of the Genetic and Evolutionary Computation Conference, pages 451-458, San Fransisco. Morgan Kaufmann.
39. Langdon, W. B. and Poli, R. (1997a). An analysis of the MAX problem in genetic programming. In Koza, J. R., Deb, K., Dorigo, M., Fogel, D. B., Garzon, M., Iba, H., and Riolo, R. L., editors, Genetic Programming 1997: Proceedings of the Second Annual Conference, pages 222-230, Stanford University, CA, USA. Morgan Kaufmann.
40. Langdon, W. B. and Poli, R. (1997b). Fitness causes bloat. In Chawdhry, P. K., Roy, R., and Pant, R. K., editors, Soft Computing in Engineering Design and Manufacturing, pages 13-22. Springer-Verlag London.
41. Langdon, W. B. and Poli, R. (1997c). Fitness causes bloat: Mutation. In Koza, J., editor, Late Breaking Papers at the GP-97 Conference, pages 132-140, Stanford, CA, USA. Stanford Bookstore.
42. Langdon, W. B. and Poli, R. (1998). Genetic programming bloat with dynamic fitness. In Banzhaf, W., Poli, R., Schoenauer, M., and Fogarty, T. C., editors, Proceedings of the First European Workshop on Genetic Programming, volume 1391 of LNCS, pages 96-112, Paris. Springer-Verlag.
43. Langdon, W. B., Soule, T., Poli, R., and Foster, J. A. (1999). The evolution of size and shape. In Spector, L., Langdon, W. B., O'Reilly, U.-M., and Angeline, P. J., editors, Advances in Genetic Programming 3, pages 163-190. MIT Press, Cambridge, MA, USA.
44. Lanzi, P. L. (1999). Extending the representation of classifier conditions part ii: from messy coding to s-expressions. In Banzhaf, W., Daida, J., Eiben, A. E., Garzon, M. H., Honavar, V., Jakiela, M., and Smith, R. E., editors, Proceedings of the Genetic and Evolutionary Computation Conference, volume 1, pages 345-352, Orlando, Florida, USA. Morgan Kaufmann.
45. Lindgren, K., Nilsson, A., Nordahl, M. G., and Råde, I. (1992). Regular language inference using evolving neural networks. In Schaffer, J. D. and Whitley, D., editors, Proceedings of the Workshop on Combinations of Genetic Algorithms and Neural Networks (COGANN92), pages 55-74, Los alamitos. The IEEE Computer Society Press.
46. Luke, S. (2000a). ECJ: A Java-based evolutionary computation and genetic programming system. Available at http://www.cs.umd.edu/projects/plus/ec/ecj/.
47. Luke, S. (2000b). Issues in Scaling Genetic Programming: Breeding Strategies, Tree Generation, and Code Bloat. PhD thesis, Department of Computer Science, University of Maryland, A. V. Williams Building, University of Maryland, College Park, MD 20742 USA.
48. Luke, S., Hamahashi, S., and Kitano, H. (1999). "Genetic" programming. In Banzhaf, W., Daida, J., Eiben, A. E., Garzon, M. H., Honavar, V., Jakiela, M., and Smith, R. E., editors, Proceedings of the Genetic and Evolutionary Computation Conference, volume 2, pages 1098-1105, Orlando, Florida, USA. Morgan Kaufmann.
49. McPhee, N. F. and Miller, J. D. (1995). Accurate replication in genetic programming. In Eshelman, L., editor, Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA95), pages 303-309, Pittsburgh, PA, USA. Morgan Kaufmann.
50. Nordin, P. (1997). Evolutionary Program Induction of Binary Machine Code and its Applications. PhD thesis, der Universitat Dortmund am Fachereich Informatik.
51. Nordin, P. and Banzhaf, W. (1995). Complexity compression and evolution. In Eshelman, L., editor, Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA95), pages 310-317, Pittsburgh, PA, USA. Morgan Kaufmann.
52. Nordin, P., Francone, F., and Banzhaf, W. (1995). Explicitly defined introns and destructive crossover in genetic programming. In Rosca, J. P., editor, Proceedings of the Workshop on Genetic Programming: From Theory to Real-World Applications, pages 6-22, Tahoe City, California, USA.
53. Nordin, P., Francone, F., and Banzhaf, W. (1996). Explicitly defined introns and destructive crossover in genetic programming. In Angeline, P. J. and Kinnear, Jr., K. E., editors, Advances in Genetic Programming 2, pages 111-134. MIT Press, Cambridge, MA, USA.
54. O'Reilly, U.-M. (1995). An Analysis of Genetic Programming. PhD thesis, Carleton University, Ottawa-Carleton Institute for Computer Science, Ottawa, Ontario, Canada.
55. Price, G. R. (1970). Selection and covariance. Nature, 227:520-521.
56. Radcliffe, N. and George, F. (1993). A study in set recombination. In Proceedings of the Fifth Annual International Conference of Genetic Algorithms (ICGA-93), pages 22-30. Morgan Kaufmann.
57. Rechenberg, I. (1973). Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen evolution ("Evolution strategy: the optimization of technical systems according to the principles of biological evolution"). Frommann-Holzboog Verlag, Stuttgart.
58. Rosca, J. (1996). Generality versus size in genetic programming. In Koza, J. R., Goldberg, D. E., Fogel, D. B., and Riolo, R. L., editors, Genetic Programming 1996: Proceedings of the First Annual Conference, pages 381-387, Stanford University, CA, USA. MIT Press.
59. Rosca, J. and Ballard, D. H. (1995). Causality in genetic programming. In Eshelman, L., editor, Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA95), pages 256-263, Pittsburgh, PA, USA. Morgan Kaufmann.
60. Rosca, J. P. (1997). Analysis of complexity drift in genetic programming. In Koza, J. R., Deb, K., Dorigo, M., Fogel, D. B., Garzon, M., Iba, H., and Riolo, R. L., editors, Genetic Programming 1997: Proceedings of the Second Annual Conference, pages 286-294, Stanford University, CA, USA. Morgan Kaufmann.
61. Rowe, J. E. and McPhee, N. F. (2001). The effects of crossover and mutation operators on variable length linear structures. In Spector, L., Goodman, E. D., Wu, A., Langdon, W. B., Voigt, H.-M., Gen, M., Sen, S., Dorigo, M., Pezeshk, S., Garzon, M. H., and Burke, E., editors, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), pages 535-542, San Francisco, California, USA. Morgan Kaufmann.
62. Smith, P. W. H. and Harries, K. (1998). Code growth, explicitly defined introns, and alternative selection schemes. Evolutionary Computation, 6(4):339-360.
63. Smith, S. F. (1980). A Learning System Based on Genetic Adaptive Algorithms. PhD thesis, Computer Science Department, University of Pittsburgh.
64. Soule, T. and Foster, J. A. (1998). Removal bias: a new cause of code growth in tree based evolutionary programming. In 1998 IEEE International Conference on Evolutionary Computation, pages 781-186, Anchorage, Alaska, USA. IEEE Press.
65. Soule, T., Foster, J. A., and Dickinson, J. (1996). Code growth in genetic programming. In Koza, J. R., Goldberg, D. E., Fogel, D. B., and Riolo, R. L., editors, Genetic Programming 1996: Proceedings of the First Annual Conference, pages 215-223, Stanford University, CA, USA. MIT Press.
66. Stoffel, K. and Spector, L. (1996). High-performance, parallel, stack-based genetic programming. In Koza, J. R., Goldberg, D. E., Fogel, D. B., and Riolo, R. L., editors, Genetic Programming 1996: Proceedings of the First Annual Conference, pages 224-229, Stanford University, CA, USA. MIT Press.
67. Tackett, W. A. (1994). Recombination, Selection, and the Genetic Construction of Computer Programs. PhD thesis, University of Southern California, Department of Electrical Engineering Systems.
68. Teller, A. (1996). Evolving programmers: The co-evolution of intelligent recombination operators. In Angeline, P. J. and Kinnear, Jr., K. E., editors, Advances in Genetic Programming 2, pages 45-68. MIT Press, Cambridge, MA, USA.
69. Teller, A. (1998). Algorithm Evolution with Internal Reinforcement for Signal Understanding. PhD thesis, School of Computer Science, Carnegie Mellon University.
70. Wu, A. and Lindsay, R. (1995). Empirical studies of the genetic algorithm with non-coding segments. Evolutionary Computation, 3(2):121-147.
71. Zhang, B.-T. (2000). Bayesnian methods for effficient genetic programming. Genetic Programming And Evolvable Machines, 1:217-242.
72. Zhang, B.-T. and Mühlenbein, H. (1995). Balancing accuracy and parsimony in genetic programming. Evolutionary Computation, 3(1):17-38.