A COMPARATIVE STUDY OF VARIOUS METHODS OF ANN FOR SOLVING TSP PROBLEM

Abstract This paper represents TSP (Travelling Salesman Problem) by using Artificial Neural Networks.A comparative study of various methods of ANN is shown here for solving TSP problem.The Travelling Salesman Problem is a classical combinational optimization problem, which is a simple to state but very difficult to solve. This problem is to find the shortest possible tour through a set of N vertices so that each vertex is visited exactly once. TSP can be solved by Hopfield Network, Self-organization Map, and Simultaneous Recurrent Network. Hopfield net is a fully connected network, where every vertex is connected with each other forwardly and backwardly. So starting the walk from a vertex we can travel all the other vertex exactly once and return to starting vertex again.