Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Wegener, Ingo | de |
dc.contributor.author | Witt, Carsten | de |
dc.date.accessioned | 2004-12-07T08:20:37Z | - |
dc.date.available | 2004-12-07T08:20:37Z | - |
dc.date.created | 2000 | de |
dc.date.issued | 2001-10-17 | de |
dc.identifier.uri | http://hdl.handle.net/2003/5400 | - |
dc.identifier.uri | http://dx.doi.org/10.17877/DE290R-15410 | - |
dc.description.abstract | Evolutionary algorithms are randomized search heuristics, which are often used as function optimizers. In this paper the well-known (1+1)Evolutionary Algorithm ((1+1)EA)and its multistart variants are studied. Several results on the expected runtime of the (1+1)EA on linear or unimodal functions have already been presented by other authors. This paper is focused on quadratic pseudo-boolean functions, i.e., functions of degree 2. Whereas quadratic pseudoboolean functions without negative coefficients can be optimized efficiently by the (1+1)EA, there are quadratic functions for which the expected runtime is exponential. However, multistart variants of the (1+1)EA are very efficient for many of these functions. This is not the case with a special quadratic function for which the (1+1)EA requires exponential time with a probability exponentially close to 1. At last, some necessary conditions for exponential runtimes are examined, and an 'easy' subclass within the class of quadratic functions is presented. | en |
dc.format.extent | 251434 bytes | - |
dc.format.extent | 520500 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.format.mimetype | application/postscript | - |
dc.language.iso | en | de |
dc.publisher | Universität Dortmund | de |
dc.relation.ispartofseries | Reihe Computational Intelligence ; 97 | de |
dc.subject | boolean functions | en |
dc.subject | complexity analysis | en |
dc.subject | evolutionary algorithms | en |
dc.subject | evolution strategies | en |
dc.subject | quadratic functions | en |
dc.subject.ddc | 004 | de |
dc.title | On the Behavior of the (1+1) Evolutionary Algorithm on Quadratic Pseudo-Boolean Functions | en |
dc.type | Text | de |
dc.type.publicationtype | report | - |
dcterms.accessRights | open access | - |
Appears in Collections: | Sonderforschungsbereich (SFB) 531 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
ci97.pdf | DNB | 245.54 kB | Adobe PDF | View/Open |
ci97.ps | 508.3 kB | Postscript | View/Open |
This item is protected by original copyright |
This item is protected by original copyright
rightsstatements.org