Original scientific paper
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
Abstract
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.
Keywords
genetic algorithm; branching process; linear ranking selection; binary tournament selection
Hrčak ID:
166134
URI
Publication date:
30.6.1999.
Visits: 1.839 *