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. © Springer Science+Business Media, LLC 2010.
Poli, R., Vanneschi, L., Langdon, W., Mcphee, N. (2010). Theoretical results in genetic programming: The next ten years?. GENETIC PROGRAMMING AND EVOLVABLE MACHINES, 11(3-4), 285-320 [10.1007/s10710-010-9110-5].
Theoretical results in genetic programming: The next ten years?
VANNESCHI, LEONARDO;
2010
Abstract
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. © Springer Science+Business Media, LLC 2010.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.