A new algorithm for the discrete fuzzy shortest path problem in a network

Abstract

In a network, the arc lengths may represent time or cost. In practical situations, it is reasonable to assume that each arc length is a discrete fuzzy set. We called it the discrete fuzzy shortest path problem. There were several methods reported to solve this kind of problem in the open literature. In these methods, they can obtain either the fuzzy shortest length or the shortest path. In this paper, we propose a new algorithm that can obtain both of them. The discrete fuzzy shortest length method is proposed to find the fuzzy shortest length, and the fuzzy similarity measure is utilized to get the shortest path. An illustrative example is given to demonstrate our proposed algorithm.