A Parallel Hybrid Heuristic for the TSP

In this paper we investigate the design of a coarse-grained parallel implementation of Cga-LK, a hybrid heuristic for the Traveling Salesman Problem (TSP). Cga-LK exploits a compact genetic algorithm in order to generate high-quality tours which are then refined by means of an efficient implementati...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Baraglia, Ranieri, Ignacio Hidalgo, José, Perego, Raffaele
Format:	Buchkapitel
Sprache:	eng
Schlagworte:	Applied sciences compact genetic algorithm Exact sciences and technology Flows in networks. Combinatorial problems hybrid GA LinKernighan algorithm Operational research and scientific management Operational research. Management science Parallel algorithms TSP
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	In this paper we investigate the design of a coarse-grained parallel implementation of Cga-LK, a hybrid heuristic for the Traveling Salesman Problem (TSP). Cga-LK exploits a compact genetic algorithm in order to generate high-quality tours which are then refined by means of an efficient implementation of the Lin-Kernighan local search heuristic. The results of several experiments conducted on a cluster of workstations with different TSP instances show the efficacy of the parallelism exploitation.
ISSN:	0302-9743 1611-3349
DOI:	10.1007/3-540-45365-2_20