Global convergence of genetic algorithms
Gunar E. Liepins · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 1992
We extend an approach to global convergence for genetic algorithms via a homogeneous Markov chain argument that does not depend on mutation. Our result is a proof of convergence to a set of populations which contain the optimal.