Representation, Search and Genetic Algorithms
Abstract
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.
Cite
Text
Whitley and Rana. "Representation, Search and Genetic Algorithms." AAAI Conference on Artificial Intelligence, 1997.Markdown
[Whitley and Rana. "Representation, Search and Genetic Algorithms." AAAI Conference on Artificial Intelligence, 1997.](https://mlanthology.org/aaai/1997/whitley1997aaai-representation/)BibTeX
@inproceedings{whitley1997aaai-representation,
title = {{Representation, Search and Genetic Algorithms}},
author = {Whitley, L. Darrell and Rana, Soraya B.},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {1997},
pages = {497-502},
url = {https://mlanthology.org/aaai/1997/whitley1997aaai-representation/}
}