Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update
Options:








Author, Editor

Author(s):

Doerr, Benjamin
Hebbinghaus, Nils
Neumann, Frank
dblp
dblp
dblp


Editor(s):

Runarsson, Thomas Ph.
Beyer, Hans G.
Burke, Edmund
Merelo-Guervós, Juan J.
Whitley, L. Darrell
Yao, Xin
dblp
dblp
dblp
dblp
dblp
dblp
Not MPII Editor(s):

Runarsson, Thomas Ph.
Beyer, Hans G.
Burke, Edmund
Merelo-Guervós, Juan J.
Whitley, L. Darrell
Yao, Xin

BibTeX cite key*:

Hebbinghaus2006

Title, Booktitle

Title*:

Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators

Booktitle*:

Parallel Problem Solving from Nature - PPSN IX, 9th International Conference

Event, URLs

URL of the conference:

http://ppsn2006.raunvis.hi.is/

URL for downloading the paper:

http://www.springerlink.com/content/p8292hu8357k2737/fulltext.pdf

Event Address*:

Reykjavik, Iceland
Language:

English

Event Date*
(no longer used):


Organization:

Springer-Verlag GmbH

Event Start Date:

9 September 2006
Event End Date:

13 September 2006

Publisher

Name*:

Springer

URL:

http://www.springer.de/

Address*:

Berlin, Germany
Type:


Vol, No, Year, pp.

Series:

Lecture Notes in Computer Science

Volume:

4193
Number:


Month:

October
Pages:

978-987

Year*:

2006
VG Wort Pages:

20

ISBN/ISSN:

978-3-540-38990-3
Sequence Number:


DOI:




Note, Abstract, ©


(LaTeX) Abstract:

We investigate the effect of restricting the mutation operator in evolutionary algorithms with respect to the runtime behavior. For the Eulerian cycle problem; we present runtime bounds on evolutionary algorithms with a restricted operator that are much smaller than the best upper bounds for the general case. It turns out that a plateau that both algorithms have to cope with is left faster by the new algorithm. In addition, we present a lower bound for the unrestricted algorithm which shows that the restricted operator speeds up computation by at least a linear factor.

URL for the Abstract:

http://www.springerlink.com/content/p8292hu8357k2737/

Keywords:

Evolutionary Algorithm, (1+1)-EA, Eulerian Cycle, Random Walk



Download
Access Level:

Internal

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Algorithms and Complexity Group

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort



BibTeX Entry:

@INPROCEEDINGS{Hebbinghaus2006,
AUTHOR = {Doerr, Benjamin and Hebbinghaus, Nils and Neumann, Frank},
 EDITOR = {Runarsson, Thomas Ph. and Beyer, Hans G. and Burke, Edmund and Merelo-Guerv{\"o}s, Juan J. and Whitley, L. Darrell and Yao, Xin},
 TITLE = {Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators},
 BOOKTITLE = {Parallel Problem Solving from Nature - PPSN IX, 9th International Conference},
 PUBLISHER = {Springer},
 YEAR = {2006},
 ORGANIZATION = {Springer-Verlag GmbH},
 VOLUME = {4193},
 PAGES = {978--987},
 SERIES = {Lecture Notes in Computer Science},
 ADDRESS = {Reykjavik, Iceland},
 MONTH = {October},
 ISBN = {978-3-540-38990-3},
}

Entry last modified by Uwe Brahm, 07/07/2007
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Nils Hebbinghaus		Created
01/05/2007 06:25:47 PM
Revisions
4.
3.
2.
1.
0.		Editor(s)
Uwe Brahm
Uwe Brahm
Christine Kiesel
Christine Kiesel
Christine Kiesel		Edit Dates
07/07/2007 00:44:53
2007-04-26 18:53:56
06.02.2007 14:58:40
06.02.2007 14:57:26
01/05/2007 06:25:47 PM