DocumentCode :
2323571
Title :
Transforming the search space with Gray coding
Author :
Mathias, Keith E. ; Whitley, L. Darrell
Author_Institution :
Dept. of Comput. Sci., Colorado State Univ., Fort Collins, CO, USA
fYear :
1994
fDate :
27-29 Jun 1994
Firstpage :
513
Abstract :
Genetic algorithm test functions have typically been designed with properties in numeric space that make it difficult to locate the optimal solution using traditional optimization techniques. The use of Gray coding has been found to enhance the performance of genetic search in some cases. However, Gray coding produces a different function mapping that may have fewer local optima and different relative hyperplane relationships. Therefore, inferences about a function will not necessarily hold when transformed to another search space. In fact, empirical results indicate that some genetic algorithm test functions are significantly altered by Gray coding such that local optimization methods often perform better than genetic algorithms
Keywords :
encoding; genetic algorithms; optimisation; search problems; Gray coding; function mapping; genetic algorithm test functions; genetic search; hyperplane relationships; inference; local optimization methods; optimal solution; optimization techniques; performance; search space; Algorithm design and analysis; Design optimization; Genetic algorithms; Matrix converters; Optimization methods; Performance evaluation; Reflective binary codes; Search methods; Software algorithms; Testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Evolutionary Computation, 1994. IEEE World Congress on Computational Intelligence., Proceedings of the First IEEE Conference on
Conference_Location :
Orlando, FL
Print_ISBN :
0-7803-1899-4
Type :
conf
DOI :
10.1109/ICEC.1994.349897
Filename :
349897
Link To Document :
بازگشت