Redundancy and computational efficiency in cartesian genetic programming

IEEE Transactions on Evolutionary Computation

Volumn 10, Issue 2, 2006, Pages 167-174

  Miller, Julian F ^a   Smith, Stephen L ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

Cartesian genetic programming (CGP); Code bloat; Genetic programming; Graph based representations; Introns

Indexed keywords

EVOLUTIONARY ALGORITHMS; GRAPH THEORY; MATHEMATICAL OPERATORS;

CARTESIAN GENETIC PROGRAMMING (GCP); CODE BLOAT; GENETIC PROGRAMMING; GENOTYPE REPRESENTATION; GRAPH-BASED REPRESENTATIONS; MUTATION OPERATORS;

MATHEMATICAL PROGRAMMING;

EID: 33645575181     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2006.871253     Document Type: Article

References (59)

1. L. Altenberg, "Emergent phenomena in genetic programming," in Evolutionary Programming: Proc. 3rd Annu. Conf., A. V. Sebald and L. J. Fogel, Eds. Singapore, 1994, pp. 233-241.
2. P. J. Angeline, "Subtree crossover causes bloat," in Genetic Programming 1998: Proc. 3rd Annu. Conf., J. R. Koza et al., Eds. San Mateo, CA: Morgan Kaufmann, 1998, pp. 745-752.
3. L. Ashmore. (2000) An investigation into Cartesian genetic programming within the field of evolutionary art. Dept. Computer Science, Univ. Birmingham. [Online]. Available: http://www.gaga.demon.co.uk/evoart.htm
4. W. Banzhaf, P. Nordin, R. E. Keller, and F. D. Francone, Genetic Programming: An Introduction. San Mateo, CA: Morgan Kaufmann, 1998.
5. W. Banzhaf, "Genotype-phenotype-mapping and neutral variation: A case study in genetic programming," in Proc. Conf. Parallel Problem Solving from Nature III. New York, 1994, pp. 322-332.
6. W. Banzhaf and W. B. Langdon, "Some considerations on the reason for bloat," Genetic Programming Evolvable Machines, vol. 3, no. 1, pp. 81-91, 2002.
7. L. Barnett, "Ruggedness and neutrality - The NKp family of fitness landscapes," in Proc. 6th Int. Conf. Artif. Life, C. Adami, R. Belew, H. Kitano, and C. Taylor, Eds. Cambridge, MA, 1998, pp. 18-27.
8. T. Blickle and L. Thiele, "Genetic programming and redundancy," in Genetic Algorithms Within Framework Evolutionary Computation, J. Hopf, Ed: Max-Planck-Institut für Informatik (MPI-I-94-241), 1994, pp. 33-38. (Workshop KI-94), Saarbrücken).
9. D. S. Burke, K. A. De Jong, J. J. Grefenstette, C. L. Ramsey, and A. S. Wu, "Putting more genetics into genetic algorithms," Evol. Comput., vol. 6, no. 4, pp. 387-410, 1998.
10. M. Ebner, P. Langguth, J. Albert, M. Shackleton, and R. Shipman, "On neutral networks and evolvability," Proc. Congr. Evol. Comput., pp. 1-8, 2001.
11. S. Forrest and M. Mitchell, "Relative building-block fitness and the building-block hypothesis," in Foundations of Genetic Programming 2, D. Whitley, Ed. San Mateo, CA: Morgan Kaufmann, 1993, pp. 109-126.
12. A. B. Garmendia-Doval, D. S. Morley, and S. Juhos, "Post docking filtering using cartesian genetic programming," in Proc. 6th Int. Conf. Artificial Evolution, P. Liardet, Ed., 2003, pp. 435-446.
13. A. B. Garmendia-Doval and J. F. Miller, "Cartesian genetic programming and the post docking filtering problem," in Genetic Programming Theory Practice II, U.-M. O'Reilly, Ed., 2004, pp. 225-244.
14. M. A. Huynen, "Exploring phenotype space through neutral evolution," J. Molecular Evol., vol. 43, pp. 165-169, 1996.
15. M. A. Huynen, P. F. Stadler, and W. Fontana, "Smoothness within ruggedness: The role of neutrality in adaptation," Proc. Nat. Acad. Sci., vol. 93, pp. 397-401, 1996.
16. M. Kimura, "Evolutionary rate at the molecular level," Nature, vol. 217, pp. 624-626, 1968.
17. J. D. K. Richard and A. Watson, "On the utility of redundant encodings in mutation-based evolutionary search," in Parallel Problem Solving from Nature - Proc. PPSN VII, 7th Int. Conf., H.-P. Schwefel et al., Eds.. New York, 2002, pp. 7-11. Lecture Notes in Computer Science.
18. J. R. Koza, Genetic Programming: On the Programming of Computers by Means of Natural Selection. Cambridge, MA: MIT Press, 1992.
19. W. B. Langdon, "The evolution of size in variable length representations," in Proc. IEEE Int. Conf. Evol. Comput.. Piscataway, NJ, 1998, pp. 633-638.
20. W. B. Langdon and R. Poli, "Fitness causes bloat: Mutation," in Proc. EuroGP'98: First European Workshop on Genetic Programming, W. Banzhaf, R. Poli, M. Schoenauer, and T. C. Fogarty, Eds. New York, 1998, pp. 37-48.
21. W. B. Langdon and R. Poli, "Why ants are hard," in GP'98: Proc. 3rd Annual Genetic Programming Conf., J. R. Koza et al., Eds.. San Mateo, CA, 1998, pp. 193-201.
22. W. B. Langdon, T. Soule, R. Poli, and J. Foster, "The evolution of size and shape," in Advances in Genetic Programming, L. Spector, W. B. Langdon, U.-M. O'Reilly, and P. J. Angeline, Eds. Cambridge, MA: MIT Press, 1999, vol. 3, pp. 163-190.
23. W. B. Langdon, "Quadratic bloat in genetic programming," in Proc. Genetic Evol. Comput. Conf., D. Whitley, D. Goldberg, E. Cantú-Paz, L. Spector, I. Parmee, and H.-G. Beyer, Eds. San Mateo, CA, 2000, pp. 451-458.
24. J. R. Levenick, "Inserting introns improves genetic algorithm success rate: Taking a cue from biology," in Proc. 4th Int. Conf. Genetic Algorithms, R. K. Belew and L. B. Booker, Eds. San Mateo, CA, 1991, pp. 123-127.
25. S. Luke, S. Hamahashi, and H. Kitano, "Genetic programming," in Proc. Genetic Evol. Comput. Conf., W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. Jakiela, and R. E. Smith, Eds. San Mateo, CA, 1999, pp. 1098-1105.
26. S. Luke, "Code growth is not caused by introns," Proc. Genetic Evol. Comput. Conf.: Late Breaking Papers, pp. 228-235, 2000.
27. N. F. McPhee and J. D. Miller, "Accurate replication in genetic programming," in Genetic Algorithms: Proc. 6th Int. Conf., L. Eshelman, Ed.. San Mateo, CA, 1995, pp. 303-309.
28. N. F. McPhee and N. J. Hopper, "Analysis of genetic diversity through population history," in Proc. Genetic Evol. Comput. Conf., W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. Jakiela, and R. E. Smith, Eds. San Mateo, CA, 1999, pp. 1112-1120.
29. J. F. Miller, P. Thomson, and T. C. Fogarty, "Designing electronic circuits using evolutionary algorithms - Arithmetic circuits: A case study," in Genetic Algorithms and Evolution Strategies in Engineering and Computer Science: Recent Advancements and Industrial Applications, D. Quagliarella, J. Periaux, C. Poloni, and G. Winter, Eds. New York: Wiley, 1997, ch. 6, pp. 105-131.
30. J. F. Miller, "An empirical study of the efficiency of learning Boolean functions using a cartesian genetic programming approach," in Proc. Genetic Evol. Comput. Conf., W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. Jakiela, and R. E. Smith, Eds. San Mateo, CA, 1999, pp. 1135-1142.
31. J. F. Miller, "Evolution of digital filters using a gate array model," in Proc. 1st Eur. Workshops Evolutionary Image Analysis, Signal Processing Telecommun., vol. 1596, R. Poli et al., Eds.. New York, 1999, pp. 17-30. Lecture Notes in Computer Science, vol. 1596.
32. J. F. Miller and P. Thomson, "Cartesian genetic programming," in Proc. 3rd Eur. Conf. Genetic Programming, vol. 1802, R. Poli, W. Banzhaf, W. B. Langdon, J. F. Miller, P. Nordin, and T. C. Fogarty, Eds., 2000, pp. 121-132. Lecture Notes in Computer Science.
33. J. F. Miller, D. Job, and V. K. Vassilev, "Principles in the evolutionary design of digital circuits - Part I," in J. Genetic Programming Evolvable Machines, 2000, vol. 1, pp. 8-35.
34. J. F. Miller, D. Job, and V. K. Vassilev, "Principles in the evolutionary design of digital circuits - Part II," in J. Genetic Programming Evolvable Machines, 2000, vol. 1, pp. 259-288.
35. J. Miller, "What bloat? Cartesian genetic programming on boolean problems," in Proc. Genetic Evol. Comput. Conf.: Late Breaking Papers, E. D. Goodman, Ed., 2001, pp. 295-302.
36. J. F. Miller and P. Thomson, "A developmental method for growing graphs and circuits," in Evolvable Systems: From Biology to Hardware, Proc. 5th Int. Conf. ICES 2003, vol. 2606, A. M. Tyrrell et al., Eds.. New York, 2003, pp. 93-104. Lecture Notes in Computer Science.
37. J. F. Miller and W. Banzhaf, "Evolving the program for a cell: From French flags to Boolean circuits," in On Growth, Form and Computers, S. J. Kumar and P. J. Bentley, Eds. New York: Academic, 2003, pp. 278-301.
38. J. F. Miller, "Evolving developmental programs for adaptation, morphogenesis, and self-repair," in Advances in Artificial Life, Proc. ECAL, W. Banzhaf et al., Eds. New York: Springer-Verlag, 2003, vol. 2801, pp. 256-265. Lecture Notes in Artificial Intelligence.
39. P. Nordin, "A compiling genetic programming system that directly manipulates the machine code," in Advances in Genetic Programming, K. E. Kinnear, Jr., Ed. Cambridge, MA: MIT Press, 1994, ch. 14, pp. 311-331.
40. P. Nordin, F. Francone, and W. Banzhaf, "Explicity defined introns and destructive crossover in genetic programming," in Advances in Genetic Programming, P. J. Angeline and K. E. Kinnear, Jr., Eds. Cambridge, MA: MIT Press, 1995, vol. 2, pp. 111-134.
41. P. Nordin and W. Banzhaf, "Complexity compression and evolution," in Genetic Algorithms: Proc. 6th Int. Conf., L. Eshelman, Ed.. San Mateo, CA, 1995, pp. 310-317.
42. R. Poli, "Evolution of graph-like programs with parallel distributed genetic programming," in Genetic Algorithms: Proc. 7th Int. Conf., T. Bäck, Ed.. San Mateo, CA, 1996, pp. 346-353.
43. J. Rosca et al., "Generality versus size in genetic programming," in Genetic Programming 1996: Proc. 1st Annu. Conf., J. R. Koza et al., Eds.. Cambridge, MA, 1996, pp. 381-387.
44. J. Rothermich, F. Wang, and J. F. Miller, "Adaptivity in cell based optimization for information ecosystems," in Proc. Congr. Evol. Comput.. Piscataway, NJ, 2003, pp. 490-497.
45. J. A. Rothermich and J. F. Miller, "Studying the emergence of multicellularity with cartesian genetic programming in artificial life," in Proc. Genetic Evol. Comput. Conf.: Late Breaking Papers, E. Cantu-Paz, Ed., 2002, pp. 397-403. AAAI.
46. F. Rothlauf and D. Goldberg, "Redundant representations in evolutionary computation," Evol. Comput., vol. 11, no. 4, pp. 381-415, 2003.
47. H. P. Schwefel, "Kybernetische evolution als strategie der experimentelen forschung in der stromungstechnik," M.S. thesis, Technical Univ. Berlin, 1965.
48. L. Sekanina, Evolvable Components: From Theory to Hardware Implementations. New York: Springer Verlag, 2004.
49. P. W. Smith and K. Harries, "Code growth, explicitly defined introns, and alternative selection schemes," Evol. Comput., vol. 6, no. 4, pp. 339-360, 1998.
50. T. Soule, J. A. Foster, and J. Dickinson, "Code growth in genetic programming," in Genetic Programming: Proc. 1st Annu. Conf., J. R. Koza et al., Eds.. Cambridge, MA, 1996, pp. 215-223.
51. T. Soule, "Code growth in genetic programming," Ph.D. dissertation, Univ. Idaho, 1998.
52. T. Soule and R. B. Heckendorn, "An analysis of the causes of code growth in genetic programming," Genetic Programming Evolvable Machines, vol. 3, pp. 283-309, 2002.
53. W. A. Tackett, "Recombination, selection, and the genetic construction of computer programs," Ph.D. dissertation, Univ. Southern California, 1994.
54. V. K. Vassilev and J. F. Miller, "The advantages of landscape neutrality in digital circuit evolution," in Proc. 3rd Int. Conf. Evolvable Systems: From Biology to Hardware, vol. 1801, J. F. Miller, A. Thompson, P. Thomson, and T. C. Fogarty, Eds. New York, 2000, pp. 252-263. Lecture Notes in Computer Science.
55. M. S. Voss, "Social programming using functional swarm optimization," in Proc. IEEE Swarm Intelligence Symp. (SIS03), 2003.
56. J. A. Walker and J. F. Miller, "Evolution and acquisition of modules in Cartesian genetic programming," in Proc. 7th Eur. Conf. Genetic Programming, vol. 3003, M. Keijzer et al., Eds.. New York, 2004, pp. 187-197. Lecture Notes in Computer Science.
57. S. Wu and R. K. Lindsay, "Empirical studies of the genetic algorithm with noncoding segments," Evol. Comput., vol. 3, pp. 121-148, 1995.
58. T. Yu and J. F. Miller, "Neutrality and evolvability of a boolean function landscape," in Proc. 4th Eur. Conf. Genetic Programming, vol. 2038, J. F. Miller, M. Tomassini, and W. Langdon, Eds. New York, 2001, pp. 204-217. Lecture Notes in Computer Science.
59. T. Yu and J. Miller, "Finding needles in haystacks is not hard with neutrality," in Proc. Eur. Conf. Genetic Programming, 2002, pp. 13-25.