DocumentCode :
319533
Title :
An analysis of linear ranking and binary tournament selection in genetic algorithms
Author :
Chakraborty, Mandira ; Chakraborty, Uday K.
Author_Institution :
Dept. of Comput. Sci. & Eng., Jadavpur Univ., Calcutta, India
Volume :
1
fYear :
1997
fDate :
9-12 Sep 1997
Firstpage :
407
Abstract :
The present paper extends the branching process model proposed by Chakraborty (1995) to cover linear ranking selection and binary tournament selection in genetic algorithms. Simulation results are presented
Keywords :
genetic algorithms; Chakraborty model; binary tournament selection; branching process model; genetic algorithms; linear ranking selection; Algorithm design and analysis; Biological information theory; Biological system modeling; Biology; Computational modeling; Ear; Encoding; Genetic algorithms; Genetic engineering; Random variables;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information, Communications and Signal Processing, 1997. ICICS., Proceedings of 1997 International Conference on
Print_ISBN :
0-7803-3676-3
Type :
conf
DOI :
10.1109/ICICS.1997.647128
Filename :
647128
Link To Document :
بازگشت