Anzeige
Erschienen in:
1996 | OriginalPaper | Buchkapitel
The Clustered Traveling Salesman Problem: A Genetic Approach
verfasst von : Jean-Yves Potvin, François Guertin
Erschienen in: Meta-Heuristics
Verlag: Springer US
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The Clustered Traveling Salesman Problem is an extension of the classical Traveling Salesman Problem, where the set vertices is partitioned into clusters. The goal is to find the shortest tour in such a way that all vertices of each cluster are visited contiguously. In this paper, a genetic algorithm is proposed to solve this problem. Computational results are reported on a set of Euclidean problems, and comparisons are provided with another recent heuristic.