Paper Info
Title
Parallel Strategies for Harmony Search on CUDA to Solve Traveling Salesman Problem
Abstract
This paper presents parallel strategies applied to Harmony Search (HS) on CUDA for solving Traveling Salesman Problem (TSP), which is an NP-hard problem in combinatorial optimization. The implementations are tested with data instances of varying problem size from TSPLIB to measure speedup attained over serial implementation. In our experiment, HSGPU parallel implementation can acquire 32 times speedup as compared with CPU-based implementation.
Year
DOI
Venue
2015
10.1109/ICITCS.2015.7293008
2015 5th International Conference on IT Convergence and Security (ICITCS)
Keywords
Field
DocType
parallel strategies,harmony search,CUDA,compute unified device architecture,traveling salesman problem,NP-hard problem,HSGPU parallel implementation,CPU-based implementation,graphics processing unit
Algorithm design,CUDA,Computer science,Embarrassingly parallel,Parallel computing,Combinatorial optimization,Theoretical computer science,Travelling salesman problem,General-purpose computing on graphics processing units,Harmony search,Speedup
Conference
ISSN
Citations 
PageRank 
2473-0122
0
0.34
References 
Authors
9
2
Name
Order
Citations
PageRank
Kang Chian Le100.34
Rosni Abdullah215624.82