Logarithmic convergence of random heuristic search

Authors:
Michael D. Vose
Affiliations:
Computer Science Department, 107 Ayres Hall The University of Tennessee Knoxville, TN 37996-1301 e-mail: vose@cs.utk.edu
Venue:
Evolutionary Computation
Year:
1996

Citing 3
Cited 3

The Simple Genetic Algorithm: Foundations and Theory

The Simple Genetic Algorithm: Foundations and Theory
Simple genetic algorithms with linear fitness

Evolutionary Computation
Modeling simple genetic algorithms

Evolutionary Computation

Simple genetic algorithms with linear fitness

Evolutionary Computation
General cardinality genetic algorithms

Evolutionary Computation
Convergence analysis and improvements of quantum-behaved particle swarm optimization

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper speaks to the inherent emergent behavior of genetic search. For completeness and generality, a class of stochastic search algorithms, random heuristic search, is reviewed. A general convergence theorem for this class is then proved. Since the simple genetic algorithm (GA) is an instance of random heuristic search, a corollary is a result concerning GAs and time to convergence.