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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Hong, I., Kahng, A., Moon, B.: Improved large-step markov chain variants for the symmetric tsp. Journal of Heuristics 3, 63–81 (1997)
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)
Lin, S.: Computer solutions of the traveling salesman problem. Bell System Technical Journal 44, 2245–2269 (1965)
Lourenço, H., Martin, O., Stützle, T.: Iterated local search: framework and applications. In: Handbook of Metaheuristics, pp. 363–397. Springer (2010)
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)
Luong, T., Melab, N., Talbi, E.: Neighborhood structures for gpu-based local search algorithms. Parallel Processing Letters 20(4), 307–324 (2010)
Martin, O., Otto, S.: Combining simulated annealing with local search heuristics. Annals of Operations Research 63, 57–75 (1996)
NVIDIA Corporation: CUDA : Computer Unified Device Architecture Programming Guide 4.0 (2011), http://www.nvidia.com
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)
Verhoeven, M., Aarts, E.: Parallel local search. J. Heuristics 1, 43–65 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Delévacq, A., Delisle, P., Krajecki, M. (2012). Parallel GPU Implementation of Iterated Local Search for the Travelling Salesman Problem. In: Hamadi, Y., Schoenauer, M. (eds) Learning and Intelligent Optimization. LION 2012. Lecture Notes in Computer Science, vol 7219. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34413-8_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-34413-8_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34412-1
Online ISBN: 978-3-642-34413-8
eBook Packages: Computer ScienceComputer Science (R0)