Parallelization techniques for tabu search

Authors:
Jacek Dąbrowski
Affiliations:
Gdańsk University of Technology, Gdańsk, Poland
Venue:
PARA'06 Proceedings of the 8th international conference on Applied parallel computing: state of the art in scientific computing
Year:
2006

Citing 3
Cited 0

Using tabu search techniques for graph coloring

Computing
New methods to color the vertices of a graph

Communications of the ACM
A survey of local search methods for graph coloring

Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search

Quantified Score

Hi-index	0.01

Visualization

Abstract

Tabu search is a simple, yet powerful meta-heuristic based on local search. This paper presents current taxonomy of parallel tabu search algorithms and compares three parallel TS algorithms based on Tabucol, an algorithm for graph coloring. The experiments were performed on two different high performance architectures: an Itanium-based cluster and a shared-memory Sun server. The results are based on graphs available from the DIMACS benchmark suite.