Comparative Analysis of the optimal solutions of Travelling Salesman Problem

摘要

Assignment problem is the special case of the transportation problem. In this paper we have discussed about a travelling salesman problem using Kruskal's Algorithm, Branch and Bound Method, Revised Assignment and a new method of solving Warshall's Algorithm. Finally, we compare the optimal solutions among the methods.