International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 74 - Issue 13 |
Published: July 2013 |
Authors: S. Dhanasekar, S. Hariharan, P. Sekar |
![]() |
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
@article{ 10.5120/12942-9921, author = { S. Dhanasekar,S. Hariharan,P. Sekar }, title = { Classical Travelling Salesman Problem (TSP) based Approach to Solve Fuzzy TSP using Yager’s Ranking }, journal = { International Journal of Computer Applications }, year = { 2013 }, volume = { 74 }, number = { 13 }, pages = { 1-4 }, doi = { 10.5120/12942-9921 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2013 %A S. Dhanasekar %A S. Hariharan %A P. Sekar %T Classical Travelling Salesman Problem (TSP) based Approach to Solve Fuzzy TSP using Yager’s Ranking%T %J International Journal of Computer Applications %V 74 %N 13 %P 1-4 %R 10.5120/12942-9921 %I Foundation of Computer Science (FCS), NY, USA
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.