Modified Method on Shortest Path in a Fuzzy Network using Triangular Fuzzy Number

This paper propose a shortest path problem with Triangular fuzzy numbers based onBellman Dynamic Programming algorithm .At the first ,we introduce a fuzzydistance by using graded mean integration representation of generalized fuzzynumber.Then, we use the nearest point with respect to a fuzzy numbers.Here,we compute the shortest path problem(SPP) from a specified vertex to all other verticsin a network .The method is illustrated by numerical example.

کلیدواژه ها:

Shortest path ، Triangular fuzzy number ، Fuzzy network