Logarithmic convergence of random heuristic search

A general class of stochastic search algorithms, random heuristic search, is reviewed. A general convergence theorem for this class is proved. Since the simple genetic algorithm is an instance of random heuristic search, a corollary is a result concerning GAs and logarithmic time to convergence.

[1]  Alden H. Wright,et al.  Simple Genetic Algorithms with Linear Fitness , 1994, Evolutionary Computation.