Sorry, I don't understand your search. ×
Back to Search Start Over

Genetic Algorithms for the Travelling Salesman Problem: a review of representations and operators

Authors :
Larrañaga Múgica, Pedro María
Kuijpers, C.M.H.
Murga Gandasegui, Roberto Hugo
Inza Cano, Iñaki
Dizdarevic, S.
Larrañaga Múgica, Pedro María
Kuijpers, C.M.H.
Murga Gandasegui, Roberto Hugo
Inza Cano, Iñaki
Dizdarevic, S.
Source :
Artificial Intelligence Review, ISSN 0269-2821, 1999-04, Vol. 13, No. 2
Publication Year :
1999

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.

Details

Database :
OAIster
Journal :
Artificial Intelligence Review, ISSN 0269-2821, 1999-04, Vol. 13, No. 2
Notes :
application/pdf, English
Publication Type :
Electronic Resource
Accession number :
edsoai.on1393059847
Document Type :
Electronic Resource