hrcak mascot   Srce   HID

Journal of computing and information technology, Vol. 7 No. 2, 1999.

Izvorni znanstveni članak

Branching Process Analysis of Linear Ranking and Binary Tournament Selection in Genetic Algorithms

Mandira Chakraborty ; Department of Computer Science & Engineering, Jadavpur University, Calcutta, India
Uday K. Chakraborty ; Department of Computer Science & Engineering, Jadavpur University, Calcutta, India

Puni tekst: engleski, pdf (3 MB) str. 107-113 preuzimanja: 1.262* citiraj
APA 6th Edition
Chakraborty, M. i Chakraborty, U.K. (1999). Branching Process Analysis of Linear Ranking and Binary Tournament Selection in Genetic Algorithms. Journal of computing and information technology, 7 (2), 107-113. Preuzeto s https://hrcak.srce.hr/166134
MLA 8th Edition
Chakraborty, Mandira i Uday K. Chakraborty. "Branching Process Analysis of Linear Ranking and Binary Tournament Selection in Genetic Algorithms." Journal of computing and information technology, vol. 7, br. 2, 1999, str. 107-113. https://hrcak.srce.hr/166134. Citirano 28.02.2021.
Chicago 17th Edition
Chakraborty, Mandira i Uday K. Chakraborty. "Branching Process Analysis of Linear Ranking and Binary Tournament Selection in Genetic Algorithms." Journal of computing and information technology 7, br. 2 (1999): 107-113. https://hrcak.srce.hr/166134
Harvard
Chakraborty, M., i Chakraborty, U.K. (1999). 'Branching Process Analysis of Linear Ranking and Binary Tournament Selection in Genetic Algorithms', Journal of computing and information technology, 7(2), str. 107-113. Preuzeto s: https://hrcak.srce.hr/166134 (Datum pristupa: 28.02.2021.)
Vancouver
Chakraborty M, Chakraborty UK. Branching Process Analysis of Linear Ranking and Binary Tournament Selection in Genetic Algorithms. Journal of computing and information technology [Internet]. 1999 [pristupljeno 28.02.2021.];7(2):107-113. Dostupno na: https://hrcak.srce.hr/166134
IEEE
M. Chakraborty i U.K. Chakraborty, "Branching Process Analysis of Linear Ranking and Binary Tournament Selection in Genetic Algorithms", Journal of computing and information technology, vol.7, br. 2, str. 107-113, 1999. [Online]. Dostupno na: https://hrcak.srce.hr/166134. [Citirano: 28.02.2021.]

Sažetak
The present paper extends the branching process model [4] to cover linear ranking selection and binary tournament selection in genetic algorithms. Under certain simplifying assumptions, we derive the probability that a given class would vanish from the population by a given generation. No crossover or mutation is considered. Simulation results are presented.

Ključne riječi
genetic algorithm; branching process; linear ranking selection; binary tournament selection

Hrčak ID: 166134

URI
https://hrcak.srce.hr/166134

Posjeta: 1.337 *