The Study on Convergence and Convergence Rate of Genetic Algorithm Based on an Absorbing Markov Chain

The study on convergence of GA is always one of the most important theoretical issues. This paper analyses the sufficient condition which guarantees the convergence of GA. Via analyzing the convergence rate of GA, the average computational complexity can be implied and the optimization efficiency of GA can be judged. This paper proposes the approach to calculating the first expected hitting time and analyzes the bounds of the first hitting time of concrete GA using the proposed approach.