Review of different heuristic algorithms for solving Travelling Salesman Problem

Abstract

Travelling Salesperson Problem (TSP) is one of the leading problems that are considered as an NP-hard. To tackle with this problem we don’t have any best suitable algorithm that solves it in polynomial time. Although we have certain algorithms that gave better results. This paper reviews the heuristic algorithms which are used to solve the problem & account for optimal solution in case of smaller problem size & give sub-optimal solution for bigger problem size. A survey for each & every strategy used for solving TSP i.e. how they are modified with time & corresponding results obtained as per the modification. Here we take into account well recognized heuristic algorithms which are genetic algorithm, ant colony optimization, particle swarm optimization.