Solution of Travelling Salesman Problem based on Metaheuristic Techniques
Himanshu Kumar Mishra, Pawan Singh, Anil Kumar Tiwari · Journal of Informatics Electrical and Electronics Engineering (JIEEE) · 2021
The traveling salesman problem is a classic problem in combinatorial optimization. This problem is to find the shortest path that a salesman should take to traverse through a list of cities and return to the origin city. The list of cities and the distance between each pair are provided. It is an NP-complete problem i.e., a class of computational problem for which no efficient solution algorithm has been found, presently there is no polynomial solution available. In this paper, we try to solve this very hard problem using various heuristics such as Simulated Annealing, Genetic Algorithm to find a near-optimal solution as fast as possible. We try to escape the local optimum, using these advanced heuristic techniques.