Classical Travelling Salesman Problem (TSP) based Approach to Solve Fuzzy TSP using Yager's Ranking

S. Dhanasekar, S. Hariharan, P. Sekar
2013 International Journal of Computer Applications  
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.
doi:10.5120/12942-9921 fatcat:rbhxat7njfbobm245lckpxkveu