English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  More Effective Crossover Operators for the All-pairs Shortest Path Problem

Doerr, B., Johannsen, D., Kötzing, T., Neumann, F., & Theile, M. (2010). More Effective Crossover Operators for the All-pairs Shortest Path Problem. In R. Schaefer, C. Cotta, J. Kolodziej, & G. Rudolph (Eds.), Parallel Problem Solving from Nature, PPSN XI (pp. 184-193). Berlin: Springer. doi:10.1007/978-3-642-15844-5_19.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-168A-7 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-2B48-F
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Doerr, Benjamin1, Author           
Johannsen, Daniel1, Author           
Kötzing, Timo1, Author           
Neumann, Frank1, Author           
Theile, Madeleine2, Author
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2External Organizations, ou_persistent22              

Content

show
hide
Free keywords: -
 Abstract: The All-Pairs Shortest Path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorithm. Recently, the analysis of this algorithm was refined and it was shown to have an expected optimization time of $\Theta(n^{3.25}(\log n)^{0.25})$. In this work, we study two variants of the algorithm. These are based on two central concepts in recombination, \emph{repair mechanisms} and \emph{parent selection}. We show that repairing infeasible offspring leads to an improved expected optimization time of $\mathord{O}(n^{3.2}(\log n)^{0.2})$. Furthermore, we prove that choosing parents that guarantee feasible offspring results in an optimization time of $\mathord{O}(n^{3}\log n)$.

Details

show
hide
Language(s): eng - English
 Dates: 20102010
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 536748
DOI: 10.1007/978-3-642-15844-5_19
URI: http://dx.doi.org/10.1007/978-3-642-15844-5_19
Other: Local-ID: C1256428004B93B8-DAF9F353F1E3426CC12577FA003CEE2F-Doe-Joh-Koe-Neu-The:c:10:APSPCrossover
 Degree: -

Event

show
hide
Title: 11th International Conference on Parallel Problem Solving from Nature
Place of Event: Krakow, Poland
Start-/End Date: 2010-09-11 - 2010-09-15

Legal Case

show

Project information

show

Source 1

show
hide
Title: Parallel Problem Solving from Nature, PPSN XI
  Subtitle : 11th International Conference, Kraków, Poland, September 11-15, 2010, Proceedings, Part I
  Abbreviation : PPSN 2010
Source Genre: Proceedings
 Creator(s):
Schaefer, Robert1, Editor
Cotta, Carlos1, Editor
Kolodziej, Joanna1, Editor
Rudolph, Günter1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Berlin : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 184 - 193 Identifier: ISBN: 978-3-642-15843-8

Source 2

show
hide
Title: Lecture Notes in Computer Science
  Abbreviation : LNCS
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 6238 Sequence Number: - Start / End Page: - Identifier: -