Ant-based crossover for permutation problems

  • Authors:
  • Jürgen Branke;Christiane Barz;Ivesa Behrens

  • Affiliations:
  • Institute AIFB, University of Karlsruhe, Karlsruhe, Germany;Institute AIFB, University of Karlsruhe, Karlsruhe, Germany;Institute AIFB, University of Karlsruhe, Karlsruhe, Germany

  • Venue:
  • GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Crossover for evolutionary algorithms applied to permutation problems is a difficult and widely discussed topic. In this paper we use ideas from ant colony optimization to design a new permutation crossover operator. One of the advantages of the new crossover operator is the ease to introduce problem specific heuristic knowledge. Empirical tests on a travelling salesperson problem show that the new crossover operator yields excellent results and significantly outperforms evolutionary algorithms with edge recombination operator as well as pure ant colony optimization.