A new stochastic analysis of schema processing in genetic algorithms i
s presented in this paper. We have developed a branching process model
for the haploid, binary, fixed-length genetic algorithm with fitness-
proportionate selection, single-point crossover and bitwise mutation.
We provide empirical evidence on a ten-problem test suite.