Properties of gray and binary representations

Evolutionary Computation

Volumn 12, Issue 1, 2004, Pages 47-76

  Rowe, Jonathan ^a   Whitley, Darrell ^b   Barbulescu, Laura ^b   Watson, Jean Paul ^b  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^b Colorado State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; BIOLOGICAL MODEL; COMPUTER SIMULATION; MOLECULAR EVOLUTION;

ALGORITHMS; COMPUTER SIMULATION; EVOLUTION, MOLECULAR; MODELS, GENETIC;

EID: 85047693251     PISSN: 10636560     EISSN: 15309304     Source Type: Journal    
DOI: 10.1162/evco.2004.12.1.47     Document Type: Article

References (17)

1. Barbulescu, L., Watson, J. P., and Whitley, D. (2000). Dynamic representations and escaping local optima. In Proceedings of the Seventeenth National Conference on Artificial Intelligence.
2. Bitner, J. R., Ehrlich, G., and Reingold, E. M. (1976). Efficient Generation of the Binary Reflected Gray Code and Its Applications. Communications of the ACM, 19(9):517-521.
3. Davis, L. (1991). Order-Based Genetic Algorithms and the Graph Coloring Problem. In Davis, L., editor, Handbook of Genetic Algorithms, pages 72-90, Van Nostrand Reinhold.
4. Eshelman, L. (1991). The CHC Adaptive Search Algorithm: How to Have Safe Search When Engaging in Nontraditional Genetic Recombination. In Rawlins, G., editor, FOGA-1, pages 265-283, Morgan Kaufmann.
5. Harary, F. (2000). The Automorphism Group of a Hypercube. Journal of Computer Science, 6(1):136-138.
6. Horn, J., Goldberg, D., and Deb, K. (1994). Long Path Problems. In Schwefel, H.-P. et al., editors, Parallel Problem Solving from Nature, 3, pages 149-158.
7. Radcliffe, N. J. and Surry, P. D. (1995). Fundamental limitations on search algorithms: Evolutionary computing in perspective. In van Leeuwen, J., editor, Lecture Notes in Computer Science 1000, Springer-Verlag.
8. Rana, S. and Whitley, D. (1997). Bit Representations with a Twist. In Back, T., editor, Proceedings of the Seventh International Conference on Genetic Algorithms, pages 188-195. Morgan Kaufmann.
9. Whitley, D. (2000). Functions as Permutations: Regarding No Free Lunch, Walsh Analysis and Summary Statistics. In Schoenauer, M. et al., editors, Parallel Problem Solving from Nature, 6, pages 169-178, Springer.
10. Whitley, D., Garrett, D., and Watson, J.P. (2003). Genetic Quad Search. In GECCO 2003. pages 1469-1480. Springer.
11. Whitley, D. and Rana, S. (1997). Representation, search and genetic algorithms. In Proceedings of the Fourteenth National Conference on Artificial Intelligence.
12. Whitley, D., Barbulescu, L., and Watson, J. P. (2001). Local Search and High Precision Gray Codes. In Foundations of Genetic Algorithms (FOGA)-6. Morgan Kaufmann.
13. Whitley, D., Mathias, K., Rana, S., and Dzubera, J. (1995). Building Better Test Functions. In Eshelman, L., editor, Proceedings of the Sixth International Conference on Genetic Algorithms, Morgan Kaufmann.
14. Whitley, D., Mathias, K., Rana, S., and Dzubera, J. (1996). Evaluating Evolutionary Algorithms. Artificial Intelligence Journal, 85:1-32.
15. Winston, P. (1984). Artificial Intelligence (2nd ed). Addison-Wesley.
16. Wolpert, D. H. and Macready, W. G. (1995). No free lunch theorems for search. Technical Report SFI-TR-95-02-010, Santa Fe Institute.
17. Wolpert, D. H. and Macready, W G. (1997). No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 4:67-82.