PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Baraglia R., Hidalgo P., Perego R. A Parallel Hybrid Heuristic for the TSP. In: Applications of Evolutionary Computing : EvoWorkshops 2001: EvoCOP, EvoFlight, EvoIASP, EvoLearn, and EvoSTIM (Como, 18–20 april 2001). Proceedings, pp. 193 - 202. G. Goos, J. Hartmanis and J. van Leeuwen (eds.). Springer, 2001.
 
 
Abstract
(English)
No abstract available.
Abstract
(Italiano)
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.
DOI: 10.1007/3-540-45365-2_20
Subject Parallel algorithms
TSP
Compact genetic algorithm
LinKernighan algorithm
Hybrid GA


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional