Abstract
A key property for predicting the effectiveness of
stochastic search techniques, including evolutionary
algorithms, is the existence of a positive correlation
between the form and the quality of candidate
solutions. In this paper we show that when the ordering
of genomic symbols in a genetic algorithm is completely
independent of the fitness function and therefore free
to evolve along with the candidate solutions it
encodes, the resulting genomes self-organise into
self-similar structures that favour this key stochastic
search property.
Users
Please
log in to take part in the discussion (add own reviews or comments).