DocumentCode
2751151
Title
The self-organization genetic algorithm based on the mutation with cycle probabilities
Author
Huang, Baojuan ; Zhuang, Jian ; Yu, DehongYu
Author_Institution
Key Lab. of Educ. Minist. for Modern Design & Rotor Bearing Syst., Xian Jiaotong Univ., Xian
fYear
2008
fDate
13-16 July 2008
Firstpage
1013
Lastpage
1018
Abstract
First, a cycle mutation genetic algorithm (CMGA) is designed by simulating the evolutionary rule of the earth creature found by paleontologists in the paper. Then, according to some phenomena of the population genetics, an improved cycle mutation genetic algorithm (ICMGA) is schemed by mended the selection operator of CMGA. Last, 22 functions are tested by ICMGA and other evolution algorithms in the experiments. The results show that exploration and exploitation of ICMGA are better than those of other algorithms and ICMGA is not sensitive to the initial population distribution. By the statistical analysis of the evolutionary course, it has been found that ICMGA has the self-organization ability which is similar to that discussed in the theory of complex system.
Keywords
genetic algorithms; probability; statistical analysis; cycle mutation genetic algorithm; cycle probability; evolutionary rule; population genetics; selection operator; self-organization genetic algorithm; statistical analysis; Adaptive control; Algorithm design and analysis; Design optimization; Earth; Evolution (biology); Genetic algorithms; Genetic mutations; Laboratories; Programmable control; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Industrial Informatics, 2008. INDIN 2008. 6th IEEE International Conference on
Conference_Location
Daejeon
ISSN
1935-4576
Print_ISBN
978-1-4244-2170-1
Electronic_ISBN
1935-4576
Type
conf
DOI
10.1109/INDIN.2008.4618251
Filename
4618251
Link To Document