Theoretical results in genetic programming: the next ten years?

Research output: Contribution to journalArticlepeer-review

38 Citations (Scopus)


We consider the theoretical results in GP so far and prospective areas for the future. We begin by reviewing the state of the art in genetic programming (GP) theory including: schema theories, Markov chain models, the distribution of functionality in program search spaces, the problem of bloat, the applicability of the no-free-lunch theory to GP, and how we can estimate the difficulty of problems before actually running the system. We then look at how each of these areas might develop in the next decade, considering also new possible avenues for theory, the challenges ahead and the open issues.
Original languageUnknown
Pages (from-to)285-320
JournalGenetic Programming And Evolvable Machines
Issue number3-4
Publication statusPublished - 1 Jan 2010

Cite this