A rigorous proof of a fundamental theorem in the drift analysis of evolutionary algorithms

A fundamental theorem in the drift analysis of EAs was initially presented in Jun He and Xin Yao's paper(Artificial Intelligence 127(1) (2001) 57-85). However, the theorem remained defective in spite of its successful applications in some specific cases. This paper points out those defects, the...

Full description

Saved in:
Bibliographic Details
Published in2010 2nd International Conference on Future Computer and Communication Vol. 2; pp. V2-805 - V2-807
Main Authors Yu-Shan Zhang, Zhi-Feng Hao, Han Huang
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.05.2010
Subjects
Algorithm design and analysis
Application software
Computational intelligence
Computer science
Drift analysis
Evolutionary Algorithms
Evolutionary computation
Helium
Mathematics
Runtime
Software engineering
Solids
Time complexity
Online AccessGet full text

Cover

More Information
Summary:A fundamental theorem in the drift analysis of EAs was initially presented in Jun He and Xin Yao's paper(Artificial Intelligence 127(1) (2001) 57-85). However, the theorem remained defective in spite of its successful applications in some specific cases. This paper points out those defects, then suggests some modifications on the theorem and introduces a new and rigorous proof. This work is expected to contribute to the solid foundation of runtime analysis of Evolutionary Algorithms.
ISBN:9781424458219
1424458218
DOI:10.1109/ICFCC.2010.5497633