Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms
Efficient generation of the binary reflected gray code and its applications
Communications of the ACM
Properties of Gray and Binary Representations
Evolutionary Computation
Quad search and hybrid genetic algorithms
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Representation, search and genetic algorithms
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
On the application of linear transformations for genetic algorithms optimization
International Journal of Knowledge-based and Intelligent Engineering Systems
Precision, local search and unimodal functions
Proceedings of the 10th annual conference on Genetic and evolutionary computation
| Hi-index | 0.00 |
This paper looks at proofs concerning Gray codes and the locality of local search; it is shown that in some cases such proofs can be generalized to Binary and real valued encodings, while in other cases such proofs do not hold for Binary encodings. The paper also looks at a modified form of Quad Search that is proven to converge in under 2L evaluations to a global optimum on unimodal 1-D bijective functions and to a local optimum on multimodal 1-D bijective functions. Quad Search directly exploits the locality of the Gray code representation.