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

Mandira Chakraborty, Uday K. Chakraborty


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.


genetic algorithm, branching process, linear ranking selection, binary tournament selection

Full Text:


Creative Commons License
This work is licensed under a Creative Commons Attribution-NoDerivatives 4.0 International License.

Crossref Similarity Check logo

Crossref logologo_doaj

 Hrvatski arhiv weba logo