Takeover Times and Probabilities of Non-Generational Selection Rules

dc.contributor.author	Rudolph, Günter	de
dc.date.accessioned	2004-12-07T08:20:14Z
dc.date.available	2004-12-07T08:20:14Z
dc.date.created	1999	de
dc.date.issued	2001-10-16	de
dc.description.abstract	The takeover time is the expected number of iterations of some selection method until a population consists entirely of copies of the best individual under the assumption that only one best individual is contained in the initial population. This quantity is often used to assess the behavior of selection methods in evolutionary algorithms. Here, takeover times and probabilities are analytically determined for some popular non-generational selection rules. Moreover, a novel classification number that aggregates additional information about the selection method is proposed.	en
dc.format.extent	144797 bytes
dc.format.extent	249397 bytes
dc.format.mimetype	application/pdf
dc.format.mimetype	application/postscript
dc.identifier.uri	http://hdl.handle.net/2003/5382
dc.identifier.uri	http://dx.doi.org/10.17877/DE290R-15299
dc.language.iso	en	de
dc.publisher	Unversität Dortmund	de
dc.relation.ispartofseries	Reihe Computational Intelligence ; 78	de
dc.subject.ddc	004	de
dc.title	Takeover Times and Probabilities of Non-Generational Selection Rules	en
dc.type	Text	de
dc.type.publicationtype	report
dcterms.accessRights	open access

Files

Now showing 1 - 2 of 2