A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Neutrality and the Evolvability of Boolean Function Landscape
[chapter]
2001
Lecture Notes in Computer Science
This work is a study of neutrality in the context of Evolutionary Computation systems. In particular, we introduce the use of explicit neutrality with an integer string coding scheme to allow neutrality to be measured during evolution. We tested this method on a Boolean benchmark problem. The experimental results indicate that there is a positive relationship between neutrality and evolvability: neutrality improves evolvability. We also identify four characteristics of adaptive/neutral
doi:10.1007/3-540-45355-5_16
fatcat:4ktwnukzpfb5tk4phqpr3yos6u