More effective crossover operators for the all-pairs shortest path problem

  • Authors:

  • Benjamin Doerr;Daniel Johannsen;Timo Kötzing;Frank Neumann;Madeleine Theile

  • Affiliations:

  • Department 1: Algorithms and Complexity, Max-Planck-Institut für Informatik, 66123 Saarbrücken, Germany;School of Mathematical Sciences, Tel Aviv University, Tel Aviv 69978, Israel;Institut für Informatik, Friedrich-Schiller-Jena Universität, 07743 Jena, Germany;School of Computer Science, The University of Adelaide, Adelaide, SA 5005, Australia;Institut für Mathematik, Technische Universität Berlin, 10623 Berlin, Germany

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2013

Quantified Score

Hi-index 5.23

Visualization

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 (w. r. t. the number of fitness evaluations) of @Q(n^3^.^2^5(logn)^0^.^2^5). In contrast to this simple algorithm, evolutionary algorithms used in practice usually employ refined recombination strategies in order to avoid the creation of infeasible offspring. We study extensions of the basic algorithm by two such concepts which are central in recombination, namely repair mechanisms and parent selection. We show that repairing infeasible offspring leads to an improved expected optimization time of O(n^3^.^2(logn)^0^.^2). As a second part of our study we prove that choosing parents that guarantee feasible offspring results in an optimization time of O(n^3logn). Both results show that already simple adjustments of the recombination operator can asymptotically improve the runtime of evolutionary algorithms.