On the Analysis of the (1 + 1) Evolutionary Algorithm

dc.contributor.author	Droste, Stefan	de
dc.contributor.author	Jansen, Thomas	de
dc.contributor.author	Wegener, Ingo	de
dc.date.accessioned	2004-12-07T08:19:30Z
dc.date.available	2004-12-07T08:19:30Z
dc.date.created	1998	de
dc.date.issued	1998-11-08	de
dc.description.abstract	Many experimental results are reported on all types of Evolutionary Algorithms but only few results have been proved. A step towards a theory on Evolutionary Algorithms, in particular, the socalled (1+1) Evolutionary Algorithm is performed. Linear functions are proved to be optimized in expected time O(n ln n) but only mutation rates of size O (1=n) can ensure this behaviour. For some polynomial of degree 2 the optimization needs exponential time. The same is proved for a unimodal function. Both results were not expected by several other authors. Finally, a hierarchy result is proved. Moreover, methods are presented to analyze the behaviour of the (1 + 1) Evolutionary Algorithm.	en
dc.format.extent	370997 bytes
dc.format.extent	924563 bytes
dc.format.mimetype	application/pdf
dc.format.mimetype	application/postscript
dc.identifier.uri	http://hdl.handle.net/2003/5340
dc.identifier.uri	http://dx.doi.org/10.17877/DE290R-8024
dc.language.iso	en	de
dc.publisher	Universität Dortmund	de
dc.relation.ispartofseries	Reihe Computational Intelligence ; 21	de
dc.subject.ddc	004	de
dc.title	On the Analysis of the (1 + 1) Evolutionary Algorithm	en
dc.type	Text	de
dc.type.publicationtype	report
dcterms.accessRights	open access

Files

Now showing 1 - 2 of 2