Evolution on Neutral Networks in Genetic Programming
In
. pp. 207–221 (
2006)
Copy
BIBTEX
Abstract
We examine the behavior of an evolutionary search on neutral networks in a simple linear genetic programming system of a Boolean function space problem. To this end we draw parallels between notions in RNA-folding problems and in Genetic Programming, observe parameters of neutral networks and discuss the population dynamics via the occupation probability of network nodes in runs on their way to the optimal solution.