Header menu link for other important links
A new approach for solving travelling salesman problem with fuzzy numbers using dynamic programming
V. Mythili, S. Hariharan, ,
Published in IAEME Publication
Volume: 9
Issue: 11
Pages: 954 - 966
Travelling Salesman Problem (TSP) is to detect the shortest closed tour such the teach city is visited exactly on ceinan n-city. The TSP problem is a special kind of an assignment model that eliminates sub-tours. In Dynamic Programming the optimum solution of a multivariable problem is obtained by decomposing sub-problem of a single variable. In this paper, Dynamic programming technique is applied to solve a Fuzzy Travelling Salesman Problem (FTSP) and MATLAB program is developed. © IAEME Publication.
About the journal
JournalInternational Journal of Mechanical Engineering and Technology
PublisherIAEME Publication