FUZZY SHORTEST PATHS

Shortest Paths are one of the simplest and most widely used concepts in nonfuzzy networks. Fuzzy shortest paths also have a variety of applications but are hampered by the possibility that the fuzzy shortest length may not correspond to an actual path in the network. In this paper we present new models based on fuzzy shortest paths that circumvent this problem and we also give a general algorithm based on dynamic programming to solve the new models. In addition we analyze the fuzzy shortest path algorithms in terms of submodular functions. The analysis concepts developed for fuzzy shortest paths are also discussed in terms of general fuzzy mathematical programming.