Scans as Primitive Parallel Operations
IEEE Transactions on Computers
Vector models for data-parallel computing
Vector models for data-parallel computing
An introduction to parallel algorithms
An introduction to parallel algorithms
Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator
Proceedings of the 3rd International Conference on Genetic Algorithms
A Comparison of Parallel and Sequential Niching Methods
Proceedings of the 6th International Conference on Genetic Algorithms
Stochastic Local Search: Foundations & Applications
Stochastic Local Search: Foundations & Applications
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
Applying adaptive algorithms to epistatic domains
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
ACO with tabu search on a GPU for solving QAPs using move-cost adjusted thread assignment
Proceedings of the 13th annual conference on Genetic and evolutionary computation
An efficient GPU implementation of a multi-start TSP solver for large problem instances
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Large scale parallel iterated local search algorithm for solving traveling salesman problem
Proceedings of the 2012 Symposium on High Performance Computing
Parallel CHC algorithm for solving dynamic traveling salesman problem using many-core GPU
AIMSA'12 Proceedings of the 15th international conference on Artificial Intelligence: methodology, systems, and applications
Parallel neighbourhood search on many-core platforms
International Journal of Computational Science and Engineering
| Hi-index | 0.00 |
The traveling salesman problem (TSP) is probably the most widely studied combinatorial optimization problem and has become a standard testbed for new algorithmic ideas. Recently the use of a GPU (Graphics Processing Unit) to accelerate non-graphics computations has attracted much attention due to its high performance and low cost. This paper presents a novel method to solve TSP with a GPU based on the CUDA architecture. The proposed method highly parallelizes a serial metaheuristic algorithm which is a genetic algorithm with the OX (order crossover) operator and the 2-opt local search. The experiments with an NVIDIA GeForce GTX285 GPU and a single core of 3.0 GHz Intel Core2 Duo E6850 CPU show that our GPU implementation is about up to 24.2 times faster than the corresponding CPU implementation.