Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

ICALP

2003

Springer

2003

Springer

Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime are limited to discrete search spaces, yet EAs are mostly applied to continuous optimization problems. So far results on the runtime of EAs for continuous search spaces rely on validation by experiments/simulations since merely a simplifying model of the respective stochastic process is investigated. Here a ﬁrst algorithmic analysis of the expected runtime of a simple, but fundamental EA for the search space n is presented. Namely, the socalled (1+1) Evolution Strategy ((1+1) ES) is investigated on unimodal functions that are monotone with respect to the distance between search point and optimum. A lower bound on the expected runtime is proven under the only assumption that isotropic distributions are used to generate the random mutation vectors. Consequently, this bound holds for any mutation adaptation m...

Related Content

Added |
06 Jul 2010 |

Updated |
06 Jul 2010 |

Type |
Conference |

Year |
2003 |

Where |
ICALP |

Authors |
Jens Jägersküpper |

Comments (0)