DocumentCode
2914517
Title
Empirical comparison of niching methods on hybrid composition functions
Author
Yu, L. ; Suganthan, P.N.
Author_Institution
Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore
fYear
2008
fDate
1-6 June 2008
Firstpage
2194
Lastpage
2201
Abstract
In this paper, we compare the performance of three popular niching genetic algorithms namely deterministic crowding, restricted tournament selection, and clearing by a set of hybrid composition test functions originally proposed for the special session on real parameter optimization at CEC 2005. The number of function evaluations is used as the main control parameter for an unbiased comparison instead of using the generation count as done frequently in the previous comparative studies. Results are given in tables and graphs to show the searching ability, accuracy, and computation time requirement of each method.
Keywords
genetic algorithms; graph theory; search problems; deterministic crowding; hybrid composition functions; niching genetic algorithms; niching methods; restricted tournament selection; Evolutionary computation;
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.4631090
Filename
4631090
Link To Document