Representation, Search and Genetic Algorithms

Wolpert and Macready's No Free Lunch theorem proves that no search algorithm is better than any other over all possible discrete functions. The meaning of the No Free Lunch theorem has, however, been the subject of intense debate. We prove that for local neighborhood search on problems of bounded complexity, where complexity is measured In terms of number of basins of attraction in the search space a Gray coded representation is better than Binary in the sense that on average it induces fewer minima in a Hamming distance 1 search neighborhood.

[1]  Lawrence Davis,et al.  Bit-Climbing, Representational Bias, and Test Suite Design , 1991, ICGA.

[2]  D. Wolpert,et al.  No Free Lunch Theorems for Search , 1995 .

[3]  L. Darrell Whitley,et al.  Changing Representations During Search: A Comparative Study of Delta Coding , 1994, Evolutionary Computation.

[4]  L. Darrell Whitley,et al.  Transforming the search space with Gray coding , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[5]  J. David Schaffer,et al.  Representation and Hidden Bias: Gray vs. Binary Coding for Genetic Algorithms , 1988, ML.