Article Dans Une Revue Computers and Operations Research Année : 2010

A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem

Résumé

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.

Fichier principal
Vignette du fichier
bontoux_artigues_feillet.pdf (201.24 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Loading...

Dates et versions

hal-00238472 , version 1 (04-02-2008)
hal-00238472 , version 2 (25-05-2009)

Licence

Identifiants

Citer

Boris Bontoux, Christian Artigues, Dominique Feillet. A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem. Computers and Operations Research, 2010, 37 (11), pp.1844-1852. ⟨10.1016/j.cor.2009.05.004⟩. ⟨hal-00238472v2⟩
506 Consultations
1181 Téléchargements

Altmetric

Partager

  • More