| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 438887 | Theoretical Computer Science | 2012 | 17 Pages |
Abstract
We show that a natural evolutionary algorithm for the all-pairs shortest path problem is significantly faster with a crossover operator than without. This is the first theoretical analysis proving the usefulness of crossover for a non-artificial problem.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
