A NEW RANKING METHOD FOR SOLVING NANOGONAL FUZZY TRAVELLING SALESMAN PROBLEM
Nanogonal Fuzzy Number, Ranking Method, Numerical Example
Travelling Salesman Problem is similar to Assignment problem. The objective of travelling salesman problem is to find the shortest possible route and minimizing the total travelling time. In this paper Travelling Salesman problem is considered with Nanogonal Fuzzy numbers. Nanogonal fuzzy numbers are defuzzified using new ranking method. Fuzzy Travelling Salesman problem is transformed into crisp travelling salesman problem and it is solved by Hungarian method. A numerical example is presented and the optimal solution is derived by using Hungarian method.