Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

25

GECCO
2008
Springer

favoriteEmaildiscussreport

110views Optimization» more GECCO 2008»

Crossover can provably be useful in evolutionary computation

13 years 12 months ago

Crossover can provably be useful in evolutionary computation

Download www.mpi-inf.mpg.de

We show that the natural evolutionary algorithm for the all-pairs shortest path problem is signiﬁcantly faster with a crossover operator than without. This is the ﬁrst theoretical analysis proving the usefulness of crossover for a non-artiﬁcial problem.

Benjamin Doerr, Edda Happ, Christian Klein

Real-time Traffic

All-pairs Shortest Path Problem | Crossover Operator | GECCO 2008 | Optimization | ﬁrst Theoretical Analysis |

claim paper

Related Content

» Adaptive enlargement of state spaces in evolutionary designing

» Can a Parser be Generated from Examples

» Backwardchaining evolutionary algorithms

» Distribution TreeBuilding RealValued Evolutionary Algorithm

» Automatic Concept Evolution

» Differential Evolution Algorithm with Ensemble of Parameters and Mutation and Crossover St...

» An Improved Quantum Evolutionary Algorithm with 2Crossovers

» An Extension of Geiringers Theorem for a Wide Class of Evolutionary Search Algorithms

» CODA CrossOver Distribution Analyzer quantitative characterization of crossover position p...

Post Info
More Details (n/a)

Added	09 Nov 2010
Updated	09 Nov 2010
Type	Conference
Year	2008
Where	GECCO
Authors	Benjamin Doerr, Edda Happ, Christian Klein

Comments (0)