Travelling salesman problem through fuzzy numbers using dynamic programming

This article presents a method to estimate the minimum cost for a directed network through Travelling salesman problem with dynamic programming.The heptagonal fuzzy number and the hexagonal fuzzy number are being used to take the edge weights of the network. The magnitude measure for the hexagonal and heptagonal fuzzy number are derived . Defuzzification of Hexadecagonal fuzzy number and the heptagonal fuzzy number are done by the magnitude measure. The minimum cost is estimated using Travelling salesman problem with dynamic programming using above said fuzzy numbers.Finally both the results have been compared.