Approach of drift analysis in evolutionary algorithms

Pan Hao

doi:10.1117/12.601444

28 March 2005 Approach of drift analysis in evolutionary algorithms

Pan Hao

Proceedings Volume 5803, Intelligent Computing: Theory and Applications III; (2005) https://doi.org/10.1117/12.601444
Event: Defense and Security, 2005, Orlando, Florida, United States

Abstract

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.

Citation Download Citation

Pan Hao "Approach of drift analysis in evolutionary algorithms", Proc. SPIE 5803, Intelligent Computing: Theory and Applications III, (28 March 2005); https://doi.org/10.1117/12.601444

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available