Back close

A new approach for solving travelling salesman problem with fuzzy numbers using dynamic programming

Publisher : International Journal of Mechanical Engineering and Technology

Year : 2018

Abstract : pTravelling 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./p

Admissions Apply Now