DocumentCode :
1747728
Title :
Complexity analysis of evaluating distances in the genetic algorithm using species conservation
Author :
Li, Jian-Ping ; Balázs, M.E. ; Parks, G.T. ; Clarkson, P.J.
Author_Institution :
Dept. of Manage. Eng., Mech. Inst. of Shijiazhuang, China
Volume :
1
fYear :
2001
fDate :
2001
Firstpage :
52
Abstract :
This paper examines the distributions of the species seeds in the species conservation genetic algorithm and analyzes the complexity of the overhead introduced by species conservation. The results show that the overhead required by the species conservation technique is no worse than that introduced by any other parallel subpopulation technique
Keywords :
genetic algorithms; parallel subpopulation technique; species conservation genetic algorithm; species seed distribution; Algorithm design and analysis; Design engineering; Engineering management; Genetic algorithms; Genetic engineering; Iterative methods; Mechanical engineering; Optimization methods; Performance evaluation; Upper bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Evolutionary Computation, 2001. Proceedings of the 2001 Congress on
Conference_Location :
Seoul
Print_ISBN :
0-7803-6657-3
Type :
conf
DOI :
10.1109/CEC.2001.934370
Filename :
934370
Link To Document :
بازگشت