We present a novel approach for computing a shortest path in a mixed fuzzy network, network having various fuzzy arc lengths. First, we develop a new technique for the addition of various fuzzy numbers in a path
using a -cuts. Then, we present a dynamic programming method for finding a shortest path in the network.
For this, we apply a recently proposed distance function for comparison of fuzzy numbers. Four examples
are worked out to illustrate the applicability of the proposed approach as compared to two other methods in
the literature as well as demonstrate the novel feature offered by our algorithm to find a fuzzy shortest path
in mixed fuzzy networks with various settings for the fuzzy arc lengths.
کلید واژگان :
Fuzzy Numbers, a -Cut; Shortest Path, Dynamic Programming
