Proceedings 1999 29th IEEE International Symposium on Multiple-Valued Logic (Cat. No.99CB36329) (1999)
Freiburg im Breisgau, Germany
May 20, 1999 to May 22, 1999
Genetic Algorithms comprise search and optimization strategies which are inspired by natural evolution: "survival of the fittest". In most best known basic genetic algorithms a binary coding of soultion candidates is used. However for the DNA coding, mother nature uses four purine bases: adenine (A), cytosine (C), guanine (G) and thymine (T). Following this idea, the present paper studies quaternary coded genetic algorithms and, based on high complex test functions, shows that these algorithms have a performance as good as their corresponding binary versions for problems with low dimensions and reach very fast and acceptable good fitness, if not the best, for high dimensional problems. For the first time it is shown, that the performance of genetic algorithms under a Gray code is sensitive to permutation of the columns of the code.
L. Hildebrand, C. Moraga and K. Freitag, "Quaternary Coded Genetic Algorithms," Proceedings 1999 29th IEEE International Symposium on Multiple-Valued Logic (Cat. No.99CB36329)(ISMVL), Freiburg im Breisgau, Germany, 1999, pp. 194.