A NEW RANKING METHOD FOR SOLVING NANOGONAL FUZZY TRAVELLING SALESMAN PROBLEM

R.Saravanan; Dr.M.Valliathal

A NEW RANKING METHOD FOR SOLVING NANOGONAL FUZZY TRAVELLING SALESMAN PROBLEM

Authors: R.Saravanan, Dr.M.Valliathal

Unique Paper ID: 149723
Volume: 7
Issue: 1
PageNo: 483-486

Keywords: Nanogonal Fuzzy Number Ranking Method Numerical Example

Abstract:
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.

Download article

email to a friend

Cite This Article

ISSN: 2349-6002
Volume: 7
Issue: 1
PageNo: 483-486

A NEW RANKING METHOD FOR SOLVING NANOGONAL FUZZY TRAVELLING SALESMAN PROBLEM

Available:https://ijirt.org/Article?manuscript=149723

Impact Factor
8.01 (Year 2024)

UGC Approved
Journal no 47859

Join Our IPN

IJIRT Partner Network

Submit your research paper and those of your network (friends, colleagues, or peers) through your IPN account, and receive 800 INR for each paper that gets published.

Join Now