The study of special encoding in genetic algorithms and a sufficient convergence condition of GAs

Authors:
Bo Yin;Zhiqiang Wei;Qingchun Meng
Affiliations:
Computer Department of Ocean University of China, Qingdao, China;Computer Department of Ocean University of China, Qingdao, China;Computer Department of Ocean University of China, Qingdao, China
Venue:
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part II
Year:
2005

Citing 3
Cited 0

A genetic algorithm for the vehicle routing problem

Computers and Operations Research
Genetic algorithms as function optimizers

Genetic algorithms as function optimizers
A novel genetic algorithm for automatic clustering

Pattern Recognition Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, the encoding techniques of Genetic Algorithms are studied and a sufficient convergence condition on genetic encoding is presented. Some new categories of codes are defined, such as Uniform code, Bias code, Tri-sector code and Symmetric codes etc. Meanwhile, some new definitions on genetic encoding as well as some operations are presented, so that a sufficient convergence condition of GAs is inducted. Based on this study, a new genetic strategy, GASC(Genetic Algorithm with Symmetric Codes), is developed and applied in robot dynamic control and path planning. The experimental results show that the special genetic encoding techniques enhance the performance of Genetic Algorithms. The convergence speed of GASC is much faster than that of some traditional genetic algorithms. That is very significant for finding more application of GAs, as, in many cases, Genetic Algorithms' applications are limited by their convergence speed.