Computational Complexity Analysis of Multi-Objective Genetic Programming

  title={Computational Complexity Analysis of Multi-Objective Genetic Programming},
  author={Frank Neumann},
The computational complexity analysis of genetic programming (GP) has been started recently in [7] by analyzing simple (1+1) GP algorithms for the problems ORDER and MAJORITY. In this paper, we study how taking the complexity as an additional criteria influences the runtime behavior. We consider generalizations of ORDER and MAJORITY and present a computational complexity analysis of (1+1) GP using multi-criteria fitness functions that take into account the original objective and the complexity… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS
17 Citations
0 References
Similar Papers


Publications citing this paper.

Similar Papers

Loading similar papers…