On the Choice of the Mutation Probability for the (1+1) EA

dc.contributor.author	Jansen, Thomas	de
dc.contributor.author	Wegener, Ingo	de
dc.date.accessioned	2004-12-07T08:20:31Z
dc.date.available	2004-12-07T08:20:31Z
dc.date.created	2000	de
dc.date.issued	2001-10-17	de
dc.description.abstract	When evolutionary algorithms are used for function optimization, they perform a heuristic search that is in fluenced by many parameters. Here,the choice of the mutation probability is investigated. It is shown for a non-trivial example function that the most recommended choice for the mutation probability 1 / n is by far not optimal,i.e., it leads to a superpolynomial running time while another choice of the mutation probability leads to a search algorithm with expected polynomial running time. Furthermore, a simple evolutionary algorithm with an extremely simple dynamic mutation probability scheme is suggested to overcome the difficulty of finding a proper setting for the mutation probability.	en
dc.format.extent	152093 bytes
dc.format.extent	329527 bytes
dc.format.mimetype	application/pdf
dc.format.mimetype	application/postscript
dc.identifier.uri	http://hdl.handle.net/2003/5395
dc.identifier.uri	http://dx.doi.org/10.17877/DE290R-7285
dc.language.iso	en	de
dc.publisher	Universität Dortmund	de
dc.relation.ispartofseries	Reihe Computational Intelligence ; 92	de
dc.subject.ddc	004	de
dc.title	On the Choice of the Mutation Probability for the (1+1) EA	en
dc.type	Text	de
dc.type.publicationtype	report
dcterms.accessRights	open access

Files

Now showing 1 - 2 of 2