| Article ID: | iaor19921060 |
| Country: | Netherlands |
| Volume: | 39 |
| Issue: | 1 |
| Start Page Number: | 27 |
| End Page Number: | 41 |
| Publication Date: | Jan 1991 |
| Journal: | Fuzzy Sets and Systems |
| Authors: | Klein Cerry M. |
| Keywords: | programming: mathematical, programming: dynamic, networks: path |
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. This paper presents new models based on fuzzy shortest paths that circumvent this problem and also gives a general algorithm based on dynamic programming to solve the new models. In addition it analyzes 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.