LION 2012: Learning and Intelligent Optimization pp 372-377 | Cite as
Parallel GPU Implementation of Iterated Local Search for the Travelling Salesman Problem
Abstract
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.
Keywords
TSP ILS Parallel Metaheuristics 3-opt GPU CUDAPreview
Unable to display preview. Download preview PDF.
References
- 1.Delévacq, A., Delisle, P., Gravel, M., Krajecki, M.: Parallel ant colony optimization on graphics processing units. In: PDPTA 2010, pp. 196–202. CSREA Press (2010)Google Scholar
- 2.Hong, I., Kahng, A., Moon, B.: Improved large-step markov chain variants for the symmetric tsp. Journal of Heuristics 3, 63–81 (1997)MATHCrossRefGoogle Scholar
- 3.Johnson, D., McGeoch, L.: The Travelling Salesman Problem: A Case Study in Local Optimization. In: Aarts, E.H.L., Lenstra, J.K. (eds.) Local Search in Combinatorial Optimization, pp. 215–310. John Wiley & Sons (1997)Google Scholar
- 4.Lin, S.: Computer solutions of the traveling salesman problem. Bell System Technical Journal 44, 2245–2269 (1965)MATHMathSciNetCrossRefGoogle Scholar
- 5.Lourenço, H., Martin, O., Stützle, T.: Iterated local search: framework and applications. In: Handbook of Metaheuristics, pp. 363–397. Springer (2010)Google Scholar
- 6.Luong, T., Loukil, L., Melab, N., Talbi, E.: A gpu-based iterated tabu search for solving the quadratic 3-dimensional assignment problem. In: AICCSA, pp. 1–8 (2010)Google Scholar
- 7.Luong, T., Melab, N., Talbi, E.: Neighborhood structures for gpu-based local search algorithms. Parallel Processing Letters 20(4), 307–324 (2010)MathSciNetCrossRefGoogle Scholar
- 8.Martin, O., Otto, S.: Combining simulated annealing with local search heuristics. Annals of Operations Research 63, 57–75 (1996)MATHCrossRefGoogle Scholar
- 9.NVIDIA Corporation: CUDA : Computer Unified Device Architecture Programming Guide 4.0 (2011), http://www.nvidia.com
- 10.Stützle, T., Hoos, H.: Analysing the run-time behaviour of iterated local search for the traveling salesman problem. In: Essays and Surveys in Metaheuristics, pp. 21–43. Springer (2001)Google Scholar
- 11.Verhoeven, M., Aarts, E.: Parallel local search. J. Heuristics 1, 43–65 (1995)MATHCrossRefGoogle Scholar