Document - A parallel hybrid heuristic for the TSP

2001

Conference article Open Access

A parallel hybrid heuristic for the TSP

Baraglia R, Hidalgo Pèrez I, Perego R

TSP Hybrid GA LinKernighan algorithm Parallel algorithms Compact genetic algorithm

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.

Metrics

Back to previous page

Cite as

BibTeX entry

@inproceedings{oai:it.cnr:prodotti:91400,
	title = {A parallel hybrid heuristic for the TSP},
	author = {Baraglia R and Hidalgo Pèrez I and Perego R},
	doi = {10.1007/3-540-45365-2_20},
	year = {2001}
}