DocumentCode
2909861
Title
The performance of genetic algorithms in dynamic optimization problems
Author
Li, Hang ; Li, Minqiang ; Wang, Jiezhi
Author_Institution
Dept. of Manage., Civil Aviation Univ. of China, Tianjin
fYear
2008
fDate
1-6 June 2008
Firstpage
364
Lastpage
369
Abstract
In dynamic optimization problems, both the falls and the attraction basins of local optima are time-varying. By the infinite population model and the further experiments, the influence of the dynamic environment on the performance of genetic algorithms is analyzed. The results show that genetic algorithms should keep dynamic balance between the exploitation capacity and the exploration capacity so as to keep excellent performance in the dynamic optimization problems.
Keywords
genetic algorithms; dynamic optimization problems; exploitation capacity; exploration capacity; genetic algorithms; infinite population model; Evolutionary computation; Genetic algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2008. CEC 2008. (IEEE World Congress on Computational Intelligence). IEEE Congress on
Conference_Location
Hong Kong
Print_ISBN
978-1-4244-1822-0
Electronic_ISBN
978-1-4244-1823-7
Type
conf
DOI
10.1109/CEC.2008.4630823
Filename
4630823
Link To Document