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

How to Cite?: G. Nirmala, R. Anju, "Travelling Salesman Problem (TSP) Using Fuzzy Quantifier", Volume 3 Issue 12, December 2014, International Journal of Science and Research (IJSR), Pages: 184-186, https://www.ijsr.net/getabstract.php?paperid=SUB14162, DOI: https://dx.doi.org/10.21275/SUB14162

Download Citation: APA | MLA | BibTeX | EndNote | RefMan