SIMULATED ANNEALING FOR SOLVING THE TRAVELLING SALESMAN PROBLEM

In this paper we considered the use of Simulated Annealing for solving the Travelling Salesman Problem (TSP) which is NP-Complete. The algorithm searches solutions for the global minimum by perturbing existing solutions and replace if the new solution is better than the existing solution. The annealing process is controlled by some algorithmic parameters and thus the solution relies on the parameters set. Different parameters were used to know the best set of parameters. Generally the algorithm was tested and proved to be a good solver of TSP