research-article

Analysis of a High-Performance TSP Solver on the GPU

Authors:

Jeffrey A. Robinson,

Susan V. Vrbsky,

Brian P. EddyAuthors Info & Claims

Journal of Experimental Algorithmics (JEA), Volume 23

Article No.: 1.1, Pages 1 - 22

https://doi.org/10.1145/3154835

Published: 10 January 2018 Publication History

Abstract

Graphical Processing Units have been applied to solve NP-hard problems with no known polynomial time solutions. An example of such a problem is the Traveling Salesman Problem (TSP). The TSP is one of the most commonly studied combinatorial optimization problems and has multiple applications in the areas of engineering, transportation, and logistics. This article presents an improved algorithm for approximating the TSP on fully connected, symmetric graphs by utilizing the GPU. Our approach improves an existing 2-opt hill-climbing algorithm with random restarts by considering multiple updates to the current path found in parallel, and it allows k number of updates per iteration, called k-swap. With our k-swap modification, we show a speed-up over the existing algorithm of 4.5× to 22.9× on data sets ranging from 1,400 to 33,810 nodes, respectively.

References

[1]

David L. Applegate, Robert E. Bixby, Vasek Chvatal, and William J. Cook. 2007. The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics). Princeton University Press, Princeton, NJ.

Digital Library

[2]

Peter Bakkum and Kevin Skadron. 2010. Accelerating SQL database operations on a GPU with CUDA. In Proceedings of the 3rd Workshop on General-Purpose Computation on Graphics Processing Units (GPGPU’10). ACM, New York, NY, 94--103.

Digital Library

[3]

Ian Buck, Tim Foley, Daniel Horn, Jeremy Sugerman, Kayvon Fatahalian, Mike Houston, and Pat Hanrahan. 2004. Brook for GPUs: Stream computing on graphics hardware. ACM Trans. Graph. 23, 3 (Aug. 2004), 777--786.

Digital Library

[4]

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2009. Introduction to Algorithms (3rd ed.). The MIT Press.

Digital Library

[5]

A. Croes. 1958. A method for solving traveling salesman problems. Operat. Res. 5 (1958), 791--812.

Digital Library

[6]

Matthias Englert, Heiko Röglin, and Berthold Vöcking. 2014. Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP. Algorithmica 68, 1 (2014), 190--264.

[7]

David S. Johnson and Lyle A. Mcgeoch. 1997. The Traveling Salesman Problem: A Case Study in Local Optimization. John Wiley and Sons, London.

[8]

Tonci Caric Juraj Fosin, Davor Davidovic. 2013. A GPU implementation of local search operators for symmetric travelling salesman problem. PROMIT—Traffic and Transportation 25, 3 (2013), 225--234.

[9]

E. Scott Larsen and David McAllister. 2001. Fast matrix multiplies using graphics hardware. In Proceedings of the 2001 ACM/IEEE Conference on Supercomputing (SC’01). ACM, New York, NY, 55--55.

Digital Library

[10]

Marek Libura, Edo S. van der Poort, Gerard Sierksma, and Jack A. A. van der Veen. 1998. Stability aspects of the traveling salesman problem based on k-best solutions. Discrete Appl. Math. 87, 13 (1998), 159--185.

Digital Library

[11]

Shen Lin and Brian W. Kernighan. 1973. An effective heuristic algorithm for the travelling-salesman problem. Operat. Res. 21 (1973), 498--516.

Digital Library

[12]

Michael McCool and Stefanus Du Toit. 2004. Metaprogramming GPUs with Sh. AK Peters Ltd.

Digital Library

[13]

NVIDIA Corporation. 2007. NVIDIA CUDA Compute Unified Device Architecture Programming Guide. NVIDIA Corporation.

[14]

Molly A. O’Neil and Martin Burtscher. 2015. Rethinking the parallelization of random-restart hill climbing: A case study in optimizing a 2-opt TSP solver for GPU execution. In Proceedings of the 8th Workshop on General Purpose Processing Using GPUs (GPGPU’15). ACM, New York, NY, 99--108.

Digital Library

[15]

Molly A. O’neil, Dan Tamir, and Martin Burtscher. 2011. A parallel GPU version of the traveling salesman problem. In 2011 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA’11). Las Vegas, NV.

[16]

Gerhard Reinelt. 1991. TSPLIB—Traveling salesman problem library. ORSA J. Comput. 3, 4 (21 Nov. 1991), 376--384.

[17]

Kamil Rocki and Reiji Suda. 2013. High-performance GPU accelerated local optimization in TSP. In Proceedings of the 2013 IEEE 27th International Symposium on Parallel and Distributed Processing Workshops and PhD Forum (IPDPSW’13). IEEE Computer Society, Washington, DC, 1788--1796.

Digital Library

[18]

John E. Stone, David Gohara, and Guochun Shi. 2010. OpenCL: A parallel programming standard for heterogeneous computing systems. IEEE Des. Test 12, 3 (May 2010), 66--73.

[19]

D. Strigl, K. Kofler, and S. Podlipnig. 2010. Performance and scalability of GPU-based convolutional neural networks. In Proceedings of the 2010 18th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP’10). 317--324.

Digital Library

[20]

Akihiro Uchida, Yasuaki Ito, and Koji Nakano. 2012. An efficient GPU implementation of ant colony optimization for the traveling salesman problem. In Proceedings of the 2013 International Conference on Computing, Networking and Communications (ICNC’12), 94--102.

Digital Library

[21]

M. G. A. Verhoeven, E. H. L. Aarts, and P. C. J. Swinkels. 1995. A parallel 2-opt algorithm for the traveling salesman problem. Future Gener. Comput. Syst. 11, 2 (March 1995), 175--182.

Digital Library

[22]

Hongjian Wang, Naiyu Zhang, and Jean-Charles Crput. 2013. A massive parallel cellular GPU implementation of neural network to large scale euclidean TSP. In Advances in Soft Computing and Its Applications, Felix Castro, Alexander Gelbukh, and Miguel Gonzalez (Eds.). Lecture Notes in Computer Science, Vol. 8266. Springer, Berlin, 118--129.

Cited By

Zeng ZCai YWu ZWang HChung K(2023)A Study of Parallel Ant Colony Optimization with CUDA-Based Implementation2023 IEEE 6th International Conference on Electronic Information and Communication Technology (ICEICT)10.1109/ICEICT57916.2023.10245802(869-871)Online publication date: 21-Jul-2023
https://doi.org/10.1109/ICEICT57916.2023.10245802
Zeng ZCai YChung KLin HWu J(2023)A Fast Fully Parallel Ant Colony Optimization Algorithm Based on CUDA for Solving TSPIET Computers & Digital Techniques10.1049/2023/99157692023Online publication date: 1-Jan-2023
https://dl.acm.org/doi/10.1049/2023/9915769
Skinderowicz R(2020)Implementing a GPU-based parallel MAX–MIN Ant SystemFuture Generation Computer Systems10.1016/j.future.2020.01.011106:C(277-295)Online publication date: 1-May-2020
https://dl.acm.org/doi/10.1016/j.future.2020.01.011

Index Terms

Analysis of a High-Performance TSP Solver on the GPU
1. Mathematics of computing
  1. Discrete mathematics
    1. Combinatorics
      1. Combinatorial optimization
    2. Graph theory
      1. Approximation algorithms
2. Theory of computation
  1. Design and analysis of algorithms
    1. Parallel algorithms
      1. Vector / streaming algorithms

Recommendations

Rethinking the parallelization of random-restart hill climbing: a case study in optimizing a 2-opt TSP solver for GPU execution
GPGPU-8: Proceedings of the 8th Workshop on General Purpose Processing using GPUs

Random-restart hill climbing is a common approach to combinatorial optimization problems such as the traveling salesman problem (TSP). We present and evaluate an implementation of random-restart hill climbing with 2-opt local search applied to TSP. Our ...
Accelerating 2-opt and 3-opt Local Search Using GPU in the Travelling Salesman Problem
CCGRID '12: Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)

We are presenting a high-performance GPU implementation of a 2-opt and 3-opt algorithms used to solve the Traveling Salesman Problem. The main idea behind it is to take a route that crosses over itself and reorder it so that it does not. It is a very ...
A GPU-based genetic algorithm for the p-median problem

The p-median problem is a well-known NP-hard problem. Many heuristics have been proposed in the literature for this problem. In this paper, we exploit a GPGPU parallel computing platform to present a new genetic algorithm implemented in CUDA and based ...

Comments

Information & Contributors

Information

Published In

cover image ACM Journal of Experimental Algorithmics

ACM Journal of Experimental Algorithmics Volume 23, Issue

Special Issue ALENEX 2017

2018

368 pages

ISSN:1084-6654

EISSN:1084-6654

DOI:10.1145/3178547

Issue’s Table of Contents

Copyright © 2018 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 January 2018

Accepted: 01 October 2017

Revised: 01 August 2017

Received: 01 March 2017

Published in JEA Volume 23

Author Tags

Qualifiers

Research-article
Research
Refereed

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
775
Total Downloads

Downloads (Last 12 months)25
Downloads (Last 6 weeks)1

Reflects downloads up to 26 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Zeng ZCai YWu ZWang HChung K(2023)A Study of Parallel Ant Colony Optimization with CUDA-Based Implementation2023 IEEE 6th International Conference on Electronic Information and Communication Technology (ICEICT)10.1109/ICEICT57916.2023.10245802(869-871)Online publication date: 21-Jul-2023
https://doi.org/10.1109/ICEICT57916.2023.10245802
Zeng ZCai YChung KLin HWu J(2023)A Fast Fully Parallel Ant Colony Optimization Algorithm Based on CUDA for Solving TSPIET Computers & Digital Techniques10.1049/2023/99157692023Online publication date: 1-Jan-2023
https://dl.acm.org/doi/10.1049/2023/9915769
Skinderowicz R(2020)Implementing a GPU-based parallel MAX–MIN Ant SystemFuture Generation Computer Systems10.1016/j.future.2020.01.011106:C(277-295)Online publication date: 1-May-2020
https://dl.acm.org/doi/10.1016/j.future.2020.01.011

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents