Article ID Journal Published Year Pages File Type
9662483 Computers & Mathematics with Applications 2005 8 Pages PDF
Abstract
In the past, the fuzzy shortest path problem in a network has attracted attention from many researchers for its importance to various applications. In this paper, we propose a new algorithm to deal with the fuzzy shortest path problem. It is composed of fuzzy shortest path length procedure and similarity measure. The former is presented to determine the fuzzy shortest path length from source node to the destination node in the network, and the latter is used to measure the similarity degree between fuzzy length sets. This algorithm not only can yield shortest length but also can offer the actual shortest path to decision makers. An illustrative example is also included to demonstrate our proposed algorithm.
Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)
Authors
, ,