Tabu Search on GPU
Adam Janiak (Wroclaw University of Technology, Poland)
Wladyslaw Janiak (Wroclaw University of Technology, Poland)
Maciej Lichtenstein (Wroclaw University of Technology, Poland)
Abstract: Nowadays Personal Computers (PCs) are often equipped with powerful, multi-core CPU. However, the processing power of the modern PC does not depend only of the processing power of the CPU and can be increased by proper use of the GPGPU, i.e. General-Purpose Computation Using Graphics Hardware. Modern graphics hardware, initially developed for computer graphics generation, appeared to be flexible enough for general-purpose computations. In this paper we present the implementation of two optimization algorithms based on the tabu search technique, namely for the traveling salsesman problem and the flow shop scheduling problem. Both algorithms are implemented in two versions and utilize, respectively, multi-core CPU, and GPU. The extensive numerical experiments confirm the high computation power of GPU and show that tabu search algorithm run on modern GPU can be even 16 times faster than run on modern CPU.
Keywords: flow shop, graphics hardware, tabu search, traveling salesman
Categories: I.3.6, I.3.m