Abstract
We discuss the problem of finding the shortest paths from a fixed origin to all nodes on a network not necessarily acyclic, with each arc length represented as positive fuzzy quantity with finite support. At first we show that the only existing paper on this problem, Klein's algorithm, in some cases will lead to a dominated path in the sense of extension principle and then we introduce a new algorithm for the problem. The proposed algorithm is on the basis of the multiple labeling method of Hansen and Dijkstra's shortest path algorithm.
Original language | English |
---|---|
Pages | 664-669 |
Number of pages | 6 |
DOIs | |
State | Published - 2005 |
Event | NAFIPS 2005 - 2005 Annual Meeting of the North American Fuzzy Information Processing Society - Detroit, MI, United States Duration: 26 Jun 2005 → 28 Jun 2005 |
Conference
Conference | NAFIPS 2005 - 2005 Annual Meeting of the North American Fuzzy Information Processing Society |
---|---|
Country/Territory | United States |
City | Detroit, MI |
Period | 26/06/05 → 28/06/05 |
Keywords
- Fuzzy network
- Fuzzy quantity
- Shortest path