SOLVING TRAVELLING SALESMAN PROBLEM INVOLVING SYMMETRIC TRAPEZOIDAL FUZZY NUMBER USING BRANCH AND BOUND METHOD

In this article, A branch and bound method is proposed for solving fuzzy travelling salesman problem(TSP). In the proposed method costs of travelling are  represented by symmetric trapezoidal fuzzy numbers(STFNs). The STFNs defuzzified by applying average ranking function and a new algorithm of proposed method is used to solve fuzzy TSP. To illustrate the proposed method, a numerical  example is given and the results are analogized with the results of enduring method.