Comparative Study on Travelling Salesman Problem

Travelling Salesman Problem (TSP) is a kind of LPP to find a minimum cost sequence in order to travel in each set of cities in a way that starting as well as ending should be on the same city and each city is visited exactly one time. In this paper, we will compare different optimization algorithms working principles, and we will also discuss the advantages and limitations of all the optimization techniques.