Parallel Strategies for Harmony Search on CUDA to Solve Traveling Salesman Problem
Kang Chian Le, Rosni Abdullah · 2015
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.