Combinatorial Optimization of Type-l Fuzzy Travelling Salesman Problem

In the classical travelling salesman problem, the objective to visit
$n$
cities from home city and return to the same with minimum cost, time, distance. In this study, travelling time is presented in the form of Triangular fuzzy number, which is de-fuzzified by using linear ranking function. Comparative analysis is performed for Type-I fuzzy optimization of travelling salesman problem using Revised Assignment algorithm, Two Optimal method, Branch and Bound method and modified Kruskal algorithm. Numerical problems are solved to validate the com-parison and potentiality of the work. Optimal solution ob-tained by Branch and Bound method was found more suit-able for the application point of view.