Accessibility and Runtime Between Convex Neutral Networks
Many important fitness functions in Evolutionary Computation (EC) have high degree of neutrality i.e. large regions of the search space with identical fitness. However, the impact of neutrality on the runtime of Evolutionary Algorithms (EAs) is not fully understood. This work analyses the impact of the accessibility between neutral networks on the runtime of a simple randomised search heuristic. The runtime analysis uses a connection between random walks on graphs and electrical resistive networks.
Unable to display preview. Download preview PDF.
- 6.Lehre, P.K., Haddow, P.C.: Phenotypic Complexity and Local Variations in Neutral Degree. In: Proceedings of the Sixth International Workshop on Information Processing in Cells and Tissues (2005) to appear in BioSystems JournalGoogle Scholar
- 9.Barnett, L.: Evolutionary Search on Fitness Landscapes with Neutral Networks. PhD thesis, CCNR & COGS, University of Sussex (2002)Google Scholar
- 10.Doyle, P.G., Snell, J.L.: Random Walks and Electric Networks. Mathematical Association of America (1984)Google Scholar