 |
Journal articles
A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem
Abstract : The Generalized Traveling Salesman Problem (GTSP) is a generalization of the well-known Traveling Salesman Problem (TSP), in which the set of nodes is divided into mutually exclusive clusters. The objective of the GTSP consists in visiting each cluster exactly once in a tour, while minimizing the sum of the routing costs. This paper addresses the solution of the GTSP using a Memetic Algorithm procedure. The originality of our approach rests on the crossover procedure that uses a large neighborhood search. This algorithm is compared with other algorithms on a set of 41 standard test problems with up to 442 nodes. The obtained results show that our algorithm is efficient in both solution quality and computation time.
Cited literature [34 references]
https://hal.archives-ouvertes.fr/hal-00238472
Contributor : Christian Artigues <>
Submitted on : Monday, May 25, 2009 - 12:51:50 PM
Last modification on : Tuesday, January 14, 2020 - 10:38:05 AM
Document(s) archivé(s) le : Wednesday, September 22, 2010 - 1:09:39 PM
Contributor : Christian Artigues <>
Submitted on : Monday, May 25, 2009 - 12:51:50 PM
Last modification on : Tuesday, January 14, 2020 - 10:38:05 AM
Document(s) archivé(s) le : Wednesday, September 22, 2010 - 1:09:39 PM
File
bontoux_artigues_feillet.pdf
Files produced by the author(s)
