Skoči na glavni sadržaj

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 2.879 Kb

str. 107-113

preuzimanja: 1.370

citiraj


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.544 *