TY - JOUR
T1 - Genetic Algorithms for the Travelling Salesman Problem
T2 - A Review of Representations and Operators
AU - Larranaga, P.
AU - Kuipers, C.M.H.
AU - Murga, R.H.
AU - Inza, I.
AU - Dizdarevic, S.
PY - 1999
Y1 - 1999
N2 - 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.
AB - 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.
U2 - 10.1023/A:1006529012972
DO - 10.1023/A:1006529012972
M3 - Article
SN - 0269-2821
VL - 13
SP - 129
EP - 170
JO - Artificial intelligence review
JF - Artificial intelligence review
ER -