The Travelling Salesman Problem (TSP) is one of the most studied combinatorial optimization problem which is significant in many practical applications in transportation problems. The TSP problem is NP-hard problem and requires large computation power to be solved by the exact algorithms. In the past few years, fast development of general-purpose Graphics Processing Units (GPUs) has brought huge improvement in decreasing the applications’ execution time. In this paper, we implement 2-opt and 3-opt local search operators for solving the TSP on the GPU using CUDA. The novelty presented in this paper is a new parallel iterated local search approach with 2-opt and 3-opt operators for symmetric TSP, optimized for the execution on GPUs. With our implementation large TSP problems (up to 85,900 cities) can be solved using the GPU. We will show that our GPU implementation can be up to 20x faster without losing quality for all TSPlib problems as well as for our CRO TSP problem.


    Access

    Download


    Export, share and cite



    Title :

    A GPU Implementation of Local Search Operators for Symmetric Travelling Salesman Problem


    Contributors:


    Publication date :

    2013




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown




    THE TRAVELLING SPACE SALESMAN PROBLEM

    Gaur, Deepak | TIBKAT | 2022


    On the Discretized Dubins Travelling Salesman Problem

    Epstein, C. / Cohen, I. / Shima, T. et al. | British Library Conference Proceedings | 2014


    Intuitionistic Fuzzy Modeling to Travelling Salesman Problem

    Garai, Arindam / Roy, Tapan Kumar | BASE | 2013

    Free access


    Hybrid ABC/PSO to solve travelling salesman problem

    Yang, Weihong / Pei, Zhili | British Library Online Contents | 2013