Rate the Article: Travelling Salesman Problem (TSP) Using Fuzzy Quantifier, IJSR, Call for Papers, Online Journal
International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
Call for Papers | Fully Refereed | Open Access | Double Blind Peer Reviewed

ISSN: 2319-7064

Downloads: 126 | Views: 399

Research Paper | Mathematics | India | Volume 3 Issue 12, December 2014 | Rating: 6.7 / 10


Travelling Salesman Problem (TSP) Using Fuzzy Quantifier

G. Nirmala, R. Anju


Abstract: In this paper we have preferred the fuzzy quantifier and ranking method for finding the initial solution, also Nearest Neighbour Method (NN-Method) is applied for finding an optimal solution for Travelling Salesman Problem (TSP). This method requires least iterations to reach the optimality. Results are given to check the validity of the proposed method.


Keywords: TSP, Fuzzy quantifier, ranking function, NN-method, optimal solution


Edition: Volume 3 Issue 12, December 2014,


Pages: 184 - 186



Rate this Article


Select Rating (Lowest: 1, Highest: 10)

5

Your Comments (Only high quality comments will be accepted.)

Characters: 0

Your Full Name:


Your Valid Email Address:


Verification Code will appear in 2 Seconds ... Wait

Top