Traveling Salesman Problem Using Metaheuristics
Anand Kumar Yadav · International Journal for Research in Applied Science and Engineering Technology · 2018
within today world there are many NP hard problem some of these are subset sum problem, halting problem, traveling salesman issue.The Travelling Salesman issue (TSP) is very famous connective optimization problem of actual world.Its aim is to search out a direct possible direction travelled by a salesman while visited every city once and back to the source city.Some attempts have been done to determine it by common approach.Out of that approach one is metaheuritic.These are nature inspirited algorithm like Genetic Algorithm (GA), Simulated Annealing (SA), Ant Colony Optimizations (ACO).In this paper, we have studies these three algorithms and compared them.On this behalf of comparison, implemented traditional ACO and improved its performance for TSP.ACO is taken as one of the high performance computing methods for TSP.Traditional ACO has some drawbacks such as stagnation behavior, long computational time problem on TSP.We improved its performance in solving TSP.