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.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call