Affiliations: [a] School of Mathematics and Statistics, Xidian University, Xi’an, Shaanxi, P.R. China | [b] School of Computer Science, Xi’an Shiyou University, Xi’an, Shaanxi, P.R. China
Correspondence:
[*]
Corresponding author. Dandan Yan, School of Mathematics and Statistics, Xidian University, 266 Xinglong Section of Xifeng Road, Xi’an, Shaanxi 710126, P.R. China. Tel./Fax: +18509243087; E-mail: [email protected].
Abstract: In real-world problems, the shortest path might contain more edges which may be full of uncertainty and risk of potential data loss. In this paper, we propose a novel algorithm, solving the fuzzy reliable shortest path problem in a mixed network with various fuzzy arc lengths, for dealing with reliability and safety in the presence of uncertainty. For this purpose, it makes us try to avoid the path containing lots of edges. Here, we first present a R
s
path selection approach for computing the fuzzy reliable shortest path in a network with several types of fuzzy arc lengths by defining a distance function for fuzzy weight of edge using α − cut. Finally, examples are worked out to illustrate the application of the fuzzy reliable shortest path. Extensive experiments using fuzzy networks and the results of statistical tests have shown that the proposed method has an appropriate trade-off both the reliable path and the shortest path.
Keywords: The fuzzy reliable shortest path, fuzzy arc length, α − cut and Dp,q distance function, fuzzy number, communication network
