TY - JOUR
T1 - Fuzzy shortest path problem with finite fuzzy quantities
AU - Moazeni, Somayeh
PY - 2006/12/1
Y1 - 2006/12/1
N2 - We discuss the shortest path problem from a specified node to every other nodes on a network in which a positive fuzzy quantity with finite support is assigned to each arc as its arc length. We define an order relation between fuzzy quantities with finite supports. Then by applying Hansen's multiple labeling method and Dijkstra's shortest path algorithm, we propose a new algorithm for finding the set of non-dominated paths with respect to the extension principle. Moreover, we show that the only existing approach for this problem, Klein's algorithm, may lead to a dominated path in the sense of extension principle.
AB - We discuss the shortest path problem from a specified node to every other nodes on a network in which a positive fuzzy quantity with finite support is assigned to each arc as its arc length. We define an order relation between fuzzy quantities with finite supports. Then by applying Hansen's multiple labeling method and Dijkstra's shortest path algorithm, we propose a new algorithm for finding the set of non-dominated paths with respect to the extension principle. Moreover, we show that the only existing approach for this problem, Klein's algorithm, may lead to a dominated path in the sense of extension principle.
KW - Fuzzy network
KW - Fuzzy quantity
KW - Shortest path problem
UR - http://www.scopus.com/inward/record.url?scp=33845444413&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33845444413&partnerID=8YFLogxK
U2 - 10.1016/j.amc.2006.05.067
DO - 10.1016/j.amc.2006.05.067
M3 - Article
AN - SCOPUS:33845444413
SN - 0096-3003
VL - 183
SP - 160
EP - 169
JO - Applied Mathematics and Computation
JF - Applied Mathematics and Computation
IS - 1
ER -