DocumentCode :
2800904
Title :
An improved fast-convergent genetic algorithm
Author :
Gao, Wei
Author_Institution :
Wuhan Polytech. Univ., China
Volume :
2
fYear :
2003
fDate :
8-13 Oct. 2003
Firstpage :
1197
Abstract :
As an effective global search method, genetic algorithm has been used in many engineering problems. When it is used in engineering, its slow convergence and poor stability have become the main problems. In order to overcome these problems, from the creation of the initial population, genetic operators, et al., an improved fast-convergent genetic algorithm is proposed. Through the simulation experiments of some hard-optimizing functions, the proposed algorithm shows its faster convergence and better stability than some existing algorithms´.
Keywords :
genetic algorithms; numerical stability; search problems; convergence; fast convergent genetic algorithm; genetic operators; global search method; stability; Computational modeling; Computer science; Convergence; Electronic mail; Genetic algorithms; Genetic engineering; Genetic mutations; Search methods; Stability; Stochastic processes;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Robotics, Intelligent Systems and Signal Processing, 2003. Proceedings. 2003 IEEE International Conference on
Print_ISBN :
0-7803-7925-X
Type :
conf
DOI :
10.1109/RISSP.2003.1285761
Filename :
1285761
Link To Document :
بازگشت