Campus Event Calendar
Event Entry
What and Who
Minisymposium Evolutionary Algorithms: Crossover is Provably Useful in Evolutionary Computation
Edda Happ
Max-Planck-Institut für Informatik - D1
Talk
AG 1, AG 3, AG 5, RG2, AG 2, AG 4, RG1, SWS
MPI Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Tuesday, 12 June 2007
14:30
-- Not specified --
E1 4
021
Saarbrücken
Abstract
We present a genetic algorithm for the all-pairs shortest path problem that uses both mutation and crossover. A rigorous runtime analysis shows that the use of crossover significantly improves the optimization time of the algorithm from $\Theta(n4)$ to $O(n^{3.5+\epsilon})$. This is the first rigorous analysis showing the usefulness of crossover for a non-artificial problem.
Contact
Frank Neumann
--email hidden
passcode not visible
logged in users only
Frank Neumann, 06/05/2007 14:40
Frank Neumann, 05/29/2007 12:36 -- Created document.
Frank Neumann, 05/29/2007 12:36 -- Created document.