Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
 
 
DownloadE-Mail
 Lokale TagsFreigabegeschichteDetailsÜbersicht
  Speeding up Evolutionary Algorithms Through Asymmetric Mutation Operators

Doerr, B., Hebbinghaus, N., & Neumann, F. (2007). Speeding up Evolutionary Algorithms Through Asymmetric Mutation Operators. Evolutionary Computation, 15(4), 401-410. doi:10.1162/evco.2007.15.4.401.

Item is

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-20C3-9 Versions-Permalink: https://hdl.handle.net/11858/00-001M-0000-0029-C231-A
Genre: Zeitschriftenartikel

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Doerr, Benjamin1, Autor           
Hebbinghaus, Nils1, Autor           
Neumann, Frank1, Autor           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: Successful applications of evolutionary algorithms show that certain variation operators can lead to good solutions much faster than other ones. We examine this behavior observed in practice from a theoretical point of view and investigate the effect of an asymmetric mutation operator in evolutionary algorithms with respect to the runtime behavior. Considering the Eulerian cycle problem we present runtime bounds for evolutionary algorithms using an asymmetric operator which are much smaller than the best upper bounds for a more general one. In our analysis it turns out that a plateau which both algorithms have to cope with changes its structure in a way that allows the algorithm to obtain an improvement much faster. In addition, we present a lower bound for the general case which shows that the asymmetric operator speeds up computation by at least a linear factor.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2008-02-2820072007
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: -
 Inhaltsverzeichnis: -
 Art der Begutachtung: Expertenbegutachtung
 Identifikatoren: eDoc: 356721
DOI: 10.1162/evco.2007.15.4.401
Anderer: Local-ID: C12573CC004A8E26-DDC530A1959FF539C125729F00350A5E-EulerECJ07
 Art des Abschluß: -

Veranstaltung

einblenden:

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: Evolutionary Computation
Genre der Quelle: Zeitschrift
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: Cambridge, MA : MIT Press
Seiten: - Band / Heft: 15 (4) Artikelnummer: - Start- / Endseite: 401 - 410 Identifikator: -