Convergence analysis of genetic algorithms
Tie Liu · 2000
The convergences of several genetic algorithms are studied by using Markovian chain theory in stochastic processes.Six lemmas, three theorems and three corollaries are proposed.It is proved that optimum maintaining simple genetic algorithm and two new genetic algorithms put forword in this paper are global convergent,but simple genetic algorithm is not the case.