A Natural and Simple Function Which is Hard For All Evolutionary Algorithms

dc.contributor.authorDroste, Stefande
dc.contributor.authorJansen, Thomasde
dc.contributor.authorWegener, Ingode
dc.date.accessioned2004-12-07T08:20:32Z
dc.date.available2004-12-07T08:20:32Z
dc.date.created2000de
dc.date.issued2001-10-17de
dc.description.abstractEvolutionary algorit ms (EAs)are randomized search strategies which have turned out to be efficient for optimization problems of quite different kind. In order to understand the behavior of EAs, one also is interested in examples where EAs need exponential time to find an optimal solution. Until now only artificial examples of this kind were known. Here an example with a clear and simple structure is presented. It can be described by a short formula, it is a polynomial of degree 3, and it is an instance of a wellknown problem, the theoretically and practically important MAXSAT problem.en
dc.format.extent156025 bytes
dc.format.extent352125 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.identifier.urihttp://hdl.handle.net/2003/5396
dc.identifier.urihttp://dx.doi.org/10.17877/DE290R-5223
dc.language.isoende
dc.publisherUniversität Dortmundde
dc.relation.ispartofseriesReihe Computational Intelligence ; 93de
dc.subject.ddc004de
dc.titleA Natural and Simple Function Which is Hard For All Evolutionary Algorithmsen
dc.typeTextde
dc.type.publicationtypereport
dcterms.accessRightsopen access

Files

Original bundle
Now showing 1 - 2 of 2
Loading...
Thumbnail Image
Name:
ci93.pdf
Size:
152.37 KB
Format:
Adobe Portable Document Format
Description:
DNB
No Thumbnail Available
Name:
ci93.ps
Size:
343.87 KB
Format:
Postscript Files