Abstract
Numerous articles have focused on the fuzzy shortest path problem in a network since it is central to various applications. It purposes to provide a decision maker with the shortest path length and the shortest path in a fuzzy network. In this paper, we propose a dynamic programming approach for fuzzy shortest path problem in a network where each arc length is represented as a discrete fuzzy set. This approach can be used to treat discrete fuzzy shortest path problem without some shortcomings existing in other related researches. A classic example is also included to demonstrate our proposed approach.