examined in relation to genetic algorithm (GA) performance. In many cases, this correlation
can be used to predict the performance of a GA on problems with known global maxima. It
correctly classifies easy deceptive problems as easy and difficult non-deceptive problems as
difficult, indicates when Gray coding will prove better than binary coding, and is consistent
with the surprises encountered when GAs were used on the Tanese and royal road …