Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Solving traveling salesman problems by combining global and local search mechanisms
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
A highly-parallel TSP solver for a GPU computing platform
NMA'10 Proceedings of the 7th international conference on Numerical methods and applications
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Solving the traveling salesman problem with annealing-based heuristics: a computational study
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
A Kohonen-like decomposition method for the Euclidean traveling salesman problem-KNIES_DECOMPOSE
IEEE Transactions on Neural Networks
| Hi-index | 0.00 |
In this paper, we present a parallel implementation of a solution for the Traveling Salesman Problem (TSP). TSP is a classical problem in computer science. For a given number of cities N, find the shortest path that visits all N cities exactly once. This problem is classified as NP-hard. We show an effective way of parallelizing Iterative Local Search using inter-thread and inter-process communication. Our speedup when solving different instances of TSPLIB ranged from 524 to 5810 times using 256 nodes of 2 CPUs (3072 cores) using the TSUBAME 2.0 supercomputer.