Genetic algorithms for the travelling salesman problem: A review of representations and operators

P. Larrañaga, Cindy Kuijpers, R.H. Murga, I. Inza, S. Dizdarevic

Research output: Contribution to journalArticleScientificpeer-review

511 Citations (Scopus)

Abstract

This paper is the result of a literature study carried out by the authors. It is a review of the different attempts made to solve the Travelling Salesman Problem with Genetic Algorithms. We present crossover and mutation operators, developed to tackle the Travelling Salesman Problem with Genetic Algorithms with different representations such as: binary representation, path representation, adjacency representation, ordinal representation and matrix representation. Likewise, we show the experimental results obtained with different standard examples using combination of crossover and mutation operators in relation with path representation.
Original languageEnglish
Pages (from-to)129-170
JournalArtificial intelligence review: An international survey and tutorial journal
Volume13
Issue number2
DOIs
Publication statusPublished - Apr 1999
Externally publishedYes

Fingerprint

Dive into the research topics of 'Genetic algorithms for the travelling salesman problem: A review of representations and operators'. Together they form a unique fingerprint.

Cite this