This paper introduces drift analysis approach in studying the convergence and hitting times of evolutionary algorithms. First the methodology of drift analysis is introduced, which links evolutionary algorithms with Markov chains or supermartingales. Then the drift conditions which guarantee the convergence of evolutionary algorithms are described. Finally the drift conditions which are used to estimate the hitting times of evolutionary algorithms are presented.

Date Published: 28 March 2005
PDF: 7 pages
Proc. SPIE 5803, Intelligent Computing: Theory and Applications III, (28 March 2005); doi: 10.1117/12.601444

Published in SPIE Proceedings Vol. 5803:
Intelligent Computing: Theory and Applications III
Kevin L. Priddy, Editor(s)