Parallel GPU Implementation of Iterated Local Search for the Travelling Salesman Problem
CReSTIC, Universite de Reims Champagne-Ardenne, Reims, France
Learning and Intelligent OptimizatioN conference (LION), 2012
@article{delevacq2012parallel,
title={Parallel GPU Implementation of Iterated Local Search for the Travelling Salesman Problem},
author={Del{‘e}vacq, A. and Delisle, P. and Krajecki, M.},
year={2012}
}
The purpose of this paper is to propose effective parallelization strategies for the Iterated Local Search (ILS) metaheuristic on Graphics Processing Units (GPU). We consider the decomposition of the 3-opt Local Search procedure on the GPU processing hardware and memory structure. Two resulting algorithms are evaluated and compared on both speedup and solution quality on a state-of-the-art Fermi GPU architecture. We report speedups of up to 6.02 with solution quality similar to the original sequential implementation on instances of the Travelling Salesman Problem ranging from 100 to 3038 cities.
August 4, 2012 by hgpu
