International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 74 - Number 13 |
Year of Publication: 2013 |
Authors: S. Dhanasekar, S. Hariharan, P. Sekar |
10.5120/12942-9921 |
S. Dhanasekar, S. Hariharan, P. Sekar . Classical Travelling Salesman Problem (TSP) based Approach to Solve Fuzzy TSP using Yager’s Ranking. International Journal of Computer Applications. 74, 13 ( July 2013), 1-4. DOI=10.5120/12942-9921
Travelling salesman problem (TSP) is a classical and most widely studied problem in both operation research and computer science. If in the TSP the cost or time or distance is not certain then it is said to be Fuzzy TSP. We propose a new algorithm to solve the fuzzy TSP and also implemented the same and the results are discussed.