Authors: Droste, Stefan
Title: Analysis of the (1+1) EA for a Dynamically Changing Objective Function
Language (ISO): en
Abstract: Evolutionary algorithms (EAs) are a class of randomized search heuristics, that are often successfully used for black-box optimization. Nevertheless, there are only few theoretical results about EAs, which are furthermore limited to static objective functions, i. e. functions that do not change over time, despite of the practical relevance of dynamic optimization. Here, the runtime of a simple EA, the (1+1) EA, is theoretically analyzed for a dynamically changing objective function. The main focus lies on determining the degree of change of the fitness funcion, where the expected runtime of the (1+1) EA changes from polynomially to super-polynomially. The proofs presented show methods how to analyze EAs with dynamically changing objective functions.
Issue Date: 2001-10-30
Provenance: Universität Dortmund
Appears in Collections:Sonderforschungsbereich (SFB) 531

Files in This Item:
File Description SizeFormat 
ci113.pdfDNB143.57 kBAdobe PDFView/Open
ci113.ps321.09 kBPostscriptView/Open

This item is protected by original copyright

If no CC-License is given, pleas contact the the creator, if you want to use thre resource other than only read it.