Branching process analysis of linear ranking and binary tournament selection in genetic algorithms
Mandira Chakraborty, Uday Kumar Chakraborty · University of Zagreb University Computing Centre (SRCE) · 1999
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.