Computational Complexity Analysis of Genetic Programming - Initial Results and Future Directions
The computational complexity analysis of evolutionary algorithmsworking on binary strings has significantly increased the rigorous understanding on how these types of algorithm work. Similar results on the computational complexity of genetic programming would fill an important theoretic gap. They would significantly increase the theoretical understanding on how and why genetic programming algorithms work and indicate, in a rigorous manner, how design choices of algorithm components impact its success. We summarize initial computational complexity results for simple tree-based genetic programming and point out directions for future research.
KeywordsAbstract Expression Grammars Differential Evolution Grammar Template Genetic Programming Genetic Algorithms Particle Swarm Symbolic Regression
Unable to display preview. Download preview PDF.
- Doerr, Benjamin and Happ, Edda (2008). Directed trees: A powerful representation for sorting and ordering problems. In 2008 IEEE World Congress on Computational Intelligence, pages 3606–3613. IEEE Computational Intelligence Society, IEEE Press.Google Scholar
- Durrett,Greg,Neumann, Frank, andO’Reilly,Una-May (2011). Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics. In FOGA ’11: Proceedings of the 11th ACM SIGEVO workshop on Foundations of Genetic Algorithms. ACM. (to appear).Google Scholar
- Goldberg, David E. and O’Reilly, Una-May (1998). Where does the good stuff go, andwhy? howcontextual semantics influence programstructure in simple Computational Complexity Analysis of Genetic Programming 127 genetic programming. In Banzhaf, Wolfgang, Poli, Riccardo, Schoenauer, Marc, and Fogarty, Terence C., editors, Proceedings of the First European Workshop on Genetic Programming, volume 1391 of LNCS, pages 16–36, Paris. Springer-Verlag.Google Scholar
- Koza, John R. (1992). Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA.Google Scholar
- Neumann, Frank and Witt, Carsten (2010). Bioinspired Computation in Combinatorial Optimization – Algorithms and Their Computational Complexity. Springer.Google Scholar
- O’Reilly, Una-May (1995). An Analysis of Genetic Programming. PhD thesis,Google Scholar
- Carleton University, Ottawa-Carleton Institute for Computer Science, Ottawa, Ontario, Canada.Google Scholar
- O’Reilly, Una-May and Oppacher, Franz (1994). Program search with a hierarchical variable length representation: Genetic programming, simulated annealing and hill climbing. In Davidor, Yuval, Schwefel, Hans-Paul, and Manner, Reinhard, editors, Parallel Problem Solving from Nature – PPSN III, number 866 in Lecture Notes in Computer Science, pages 397–406, Jerusalem. Springer-Verlag.Google Scholar
- Scharnow, Jens, Tinnefeld, Karsten, andWegener, Ingo (2004). The analysis of evolutionary algorithms on sorting and shortest paths problems. Journal of Mathematical Modelling and Algorithms, 3:349–366.Google Scholar
- Wagner, Markus and Neumann, Frank (2011). Computational complexity results for genetic programming and the sorting problem. CoRR, abs/1103.5797.Google Scholar