The Study of Special Encoding in Genetic Algorithms and a Sufficient Convergence Condition of GAs (original) (raw)
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.
This research is supported by the National Natural Science Foundation of China(60374031).
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
- Garai, G., Chaudhuri, B.B.: A novel genetic algorithm for automatic clustering. Pattern Recognition Letters 25, 173–187 (2004)
Article Google Scholar - Baker, B.M., Ayechew, M.A.: A genetic algorithm for the vehicle routing problem. Computers & Operations Research 30, 787–800 (2003)
Article MATH MathSciNet Google Scholar - Cheng, C.-b., Cheng, C.J., Lee, E.s.: Neuro-Fuzzy and Genetic Algorithm in Multiple Response Optimization. Computers and Mathematics with Applications 44, 1503–1514 (2002)
Google Scholar - Alsultanny, Y.A., Aqel, M.M.: Pattern recognition using multiplayer neural-gentic algorithm. Neurocomputing 51, 237–247 (2003)
Article Google Scholar - Meng, Q., Ji, H., Dong, H.: Application of a new Genetic strategy to robot control. In: Proc. of Intl. Conf. IEEE, ICIPS 1997, Beijing, pp. 568–570 (1997)
Google Scholar - Meng, Q., Zhou, C., et al.: Genetic Algorithm with Symmetric Code and Its Application to Dynamic System. ACTA Electronica Sinica 27, 59–63 (1999)
Google Scholar - Bethke, A.D.: Genetic algorithm as function optimizers. Ph. D. Thesis, Dept. Computer and Communication Sciences, University of Michigan (1981)
Google Scholar - Holland, J.H.: Adaptation in natural and artificial systems. University of Michigan press. Ann Ardor, Michigan (1975)
Google Scholar
Author information
Authors and Affiliations
- Computer Department of Ocean University of China, Postfach 26 60 71, Qingdao, China
Bo Yin, Zhiqiang Wei & Qingchun Meng - State Key Lab. of Intelligent Technology & Systems Tsinghua University, Postfach 10 00 84, Beijing, China
Qingchun Meng
Authors
- Bo Yin
- Zhiqiang Wei
- Qingchun Meng
Editor information
Editors and Affiliations
- School of Electrical and Electronic Engineering, Nanyang Technological University, Block S1, Nanyang Avenue, 639798, Singapore
Lipo Wang - School of Software, Sun Yat-Sen University, 510275, Guangzhou, China
Ke Chen - School of Computer Engineering, Nanyang Technological University, BLK N4, 2b-39, Nanyang Avenue, 639798, Singapore
Yew Soon Ong
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yin, B., Wei, Z., Meng, Q. (2005). The Study of Special Encoding in Genetic Algorithms and a Sufficient Convergence Condition of GAs. In: Wang, L., Chen, K., Ong, Y.S. (eds) Advances in Natural Computation. ICNC 2005. Lecture Notes in Computer Science, vol 3611. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539117\_139
Download citation
- .RIS
- .ENW
- .BIB
- DOI: https://doi.org/10.1007/11539117\_139
- Publisher Name: Springer, Berlin, Heidelberg
- Print ISBN: 978-3-540-28325-6
- Online ISBN: 978-3-540-31858-3
- eBook Packages: Computer ScienceComputer Science (R0)Springer Nature Proceedings Computer Science
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.