In this paper we investigate the likely severity of the Permutation Problem on a standard Genetic Algorithm used for the evolutionary optimisation of Neural Networks. We present a method for calculating the expected number of permutations in an initial population given a particular representation and show that typically this number is very low. This low expectation coupled with the empirical evidence suggests that the severity of the Permutation Problem is low in general, and so not a common cause of poor performance in Neuroevolutionary algorithms.
CITATION STYLE
Haflidason, S., & Neville, R. (2010). Quantifying the Severity of the Permutation Problem in Neuroevolution (pp. 149–156). https://doi.org/10.1007/978-4-431-53868-4_17
Mendeley helps you to discover research relevant for your work.