Takeover time in parallel populations with migration

dc.contributor.author	Rudolph, Günter	de
dc.date.accessioned	2009-05-12T16:00:26Z
dc.date.available	2009-05-12T16:00:26Z
dc.date.issued	2006-05	de
dc.description.abstract	The term takeover time regarding selection methods used in evolutionary algorithms denotes the (expected) number of iterations of the selection method until the entire population consists of copies of the best individual, provided that the initial population consists of a single copy of the best individual whereas the remaining individuals are worse. Here, this notion is extended to parallel subpopulations that exchange individuals according to some migration paths modelled by a directed graph. We develop upper bounds for migrations path along uni- and bidirectial rings as well as arbitrary connected graphs where each vertex is reachable from every other vertex.	en
dc.identifier.uri	http://hdl.handle.net/2003/26114
dc.identifier.uri	http://dx.doi.org/10.17877/DE290R-699
dc.language.iso	en	de
dc.relation.ispartofseries	Reihe CI; 206-06	de
dc.subject	migration model	en
dc.subject	spatially structured population	en
dc.subject	takeover time	en
dc.subject.ddc	004	de
dc.title	Takeover time in parallel populations with migration	en
dc.type	Text	de
dc.type.publicationtype	report	de
dcterms.accessRights	open access

Files

Now showing 1 - 1 of 1