A Free Lunch Proof for Gray versus Binary Encodings
暂无分享,去创建一个
A measure of complexity is proposed that counts the number of local minima in any given problem representation. A special class of functions with the maximum possible number of optima is also deened. A proof is given showing that reeected Gray code induce more optima than Binary over this special class of functions; by the No Free Lunch principle, reeected Gray codes therefore induces fewer optima over all other remaining functions.
[1] J. David Schaffer,et al. Representation and Hidden Bias: Gray vs. Binary Coding for Genetic Algorithms , 1988, ML.
[2] 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.
[3] David H. Wolpert,et al. No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..
[4] L. Darrell Whitley,et al. Representation, Search and Genetic Algorithms , 1997, AAAI/IAAI.