ACCELERATING LOCAL SEARCH ALGORITHMS FOR TRAVELLING SALESMAN PROBLEM USING GPU EFFECTIVELY
Industrial Engineering, MSc. Thesis, 2015
Prof. Dr. Bülent ÇATAY (Thesis Advisor), Asst. Prof. Dr. Kamer Kaya
Asst. Prof. Dr. Gürkan Öztürk
Date &Time: 3th of August, 2015 – 14:00
Place: FENS L035
Keywords : GPU computing, parallelization, optimization, GPU architecture, TSP
The main purpose of this study is to demonstrate the advantages of the GPU usage to solve computationally hard optimization problems. Thus, to solve the Travelling Salesman Problem 2-opt and 3-opt methods were implemented in parallel. These search techniques compare every possible valid combination of the certain exchange system. It means that large numbers of calculations and comparing are required. Through the parallelization of these methods via the GPU, performance has increased remarkably compared to performance in the CPU. Because of the distinctive manner of work and the complicated memory structure of GPU, implementations can be tough. Imprecise usage of GPU causes considerable decrease in the performance of the algorithm. Therefore, in addition to comparisons between GPU and CPU performances, the effect of GPU resource allocations on the GPU performance was examined. Allocating resources in different ways several experiments on various sized travelling salesman problems were tested. According to the experiments a technique was specified to utilize GPU resources ideally. Although GPU devices evolve day to day, some resources of them have still quite restricted capacity. For this reason, when it came to large scale problems, a special on-chip memory of the GPU device remained incapable. In order to overcome this issue, some helpful approaches were proposed. Basically, the problem was divided into parts. Parallelism was applied to each part separately. To sum up, the aim of this research is to give some useful insights about effective GPU usage and making researchers in the optimization area familiar with it.