Crossover can provably be useful in evolutionary computation

We show that the 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.

• Type: Conference
• Year: 2008
• Where: GECCO
• Authors: Benjamin Doerr, Edda Happ, Christian Klein
• Keywords: All-pairs Shortest Path Problem, Crossover Operator, GECCO 2008, Optimization, first Theoretical Analysis