Comparative Analysis on the solution of Travelling Salesman Problem for a Fuzzy Octagonal numbers by different methods
Travelling salesman problem is used to find the shortest route for the salesman with minimum cost (or) time schedule. In this paper, the same is defined under fuzzy environment with eight parameters and is called octagonal fuzzy number. Hungarian method, matrix one's method and branch and bound methods are used to solve the octagonal fuzzy problem by -cut Ranking method. Further the solution by the three methods are compared.