Абстрактный

Comparative Analysis of Various Algorithms Used in Travelling Salesman Problem

Suchetha Vijaykumar, Sushma L Shetty , Saniha Maria Menezes

The Travelling Salesman Problem is a well known problem which has becomea comparison benchmark test for different computational methods. Its solution is computationally difficult, although the problem is easily expressed. TSP is one of the most famous combinatorial optimization (CO) problems and which has wide application background. The aim of our work is to compare existing algorithms that are already tested on benchmark problems from TSPLIB. The objective is to determine which algorithm holds good for various Travelling Salesman Problems.