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

dc.contributor.author	Droste, Stefan	de
dc.contributor.author	Jansen, Thomas	de
dc.contributor.author	Wegener, Ingo	de
dc.date.accessioned	2004-12-07T08:20:32Z
dc.date.available	2004-12-07T08:20:32Z
dc.date.created	2000	de
dc.date.issued	2001-10-17	de
dc.description.abstract	Evolutionary 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.extent	156025 bytes
dc.format.extent	352125 bytes
dc.format.mimetype	application/pdf
dc.format.mimetype	application/postscript
dc.identifier.uri	http://hdl.handle.net/2003/5396
dc.identifier.uri	http://dx.doi.org/10.17877/DE290R-5223
dc.language.iso	en	de
dc.publisher	Universität Dortmund	de
dc.relation.ispartofseries	Reihe Computational Intelligence ; 93	de
dc.subject.ddc	004	de
dc.title	A Natural and Simple Function Which is Hard For All Evolutionary Algorithms	en
dc.type	Text	de
dc.type.publicationtype	report
dcterms.accessRights	open access

Files

Now showing 1 - 2 of 2