Back to Search
Start Over
Drift conditions for estimating the first hitting times of evolutionary algorithms.
- Source :
-
International Journal of Computer Mathematics . Jan2011, Vol. 88 Issue 1, p37-50. 14p. - Publication Year :
- 2011
-
Abstract
- For the global optimization problems with continuous variables, evolutionary algorithms (EAs) are often used to find the approximate solutions. The number of generations for an EA to find the approximate solutions, called the first hitting time, is an important index to measure the performance of the EA. However, calculating the first hitting time is still difficult in theory. This paper proposes some new drift conditions that are used to estimate the upper bound of the first hitting times of EAs for finding the approximate solutions. Two case studies are given to show how to apply these conditions to estimate the first hitting times. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00207160
- Volume :
- 88
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- International Journal of Computer Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 56619736
- Full Text :
- https://doi.org/10.1080/00207160903477167