A Parallel GPU Version of the Traveling Salesman Problem
The attached code is described in the paper "A Parallel GPU Version of the Traveling Salesman Problem", available here: http://www.cs.txstate.edu/~burtscher/papers/pdpta11b.pdf.
For up-to-date code, compilation instructions and command-line examples, please refer to: http://www.cs.txstate.edu/~burtscher/research/TSP_GPU/
TSP_GPU is a GPU-based heuristic solver for the symmetric Traveling Salesman Problem with up to 110 cities, based on iterative hill climbing with 2-opt local search.
The executable accepts 2 arguments: the first is an input database for the symetric traveling salesman problem (sample inputs can be downloaded from the TSPLIB library at http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/), the second is a number of climbers. The executable approximately solves the traveling salesman problem represented by the input database using x climbers.
The minimal tour and its cost are printed to standard output.
Code available at:
Or in attachment below.