Fuzzy Shortest-Path Network Problems with Uncertain Edge Weights

文化大學機構典藏 CCUR > 理工學院 > 理學院 > 應數系 > 期刊論文 > Item 987654321/32502

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://irlib.pccu.edu.tw/handle/987654321/32502

题名:	Fuzzy Shortest-Path Network Problems with Uncertain Edge Weights
作者:	姚景星林豐澤
贡献者:	應數系
关键词:	triangular fuzzy number level (1-β, 1-α) interval-valued fuzzy number shortest-path network problem fuzzy shortest-path network problem signed-distance ranking
日期:	2003-03
上传时间:	2016-04-07 10:25:32 (UTC+8)
摘要:	This paper presents two new types of fuzzy shortest-path network problems. We consider the edge weight of the network as uncertain, which means that it is either imprecise or unknown. Thus, the first type of fuzzy shortest-path problem uses triangular fuzzy numbers for the imprecise problem. The second type uses level (1-β, 1-α) interval-valued fuzzy numbers, which are based on past statistical data corresponding to the confidence intervals of the edge weights for the unknown problem. The main results obtained from this study are: (1) using triangular fuzzy numbers and a signed distance ranking method to obtain Theorem 1, and (2) using level (1-β, 1-α) interval-valued fuzzy numbers, combining statistics with fuzzy sets and a signed distance ranking method to obtain Theorem 2. We conclude that the shortest paths in the fuzzy sense obtained from Theorems 1 and 2 correspond to the actual paths in the network, and the fuzzy shortest-path problem is an extension of the crisp case.
關聯:	Journal of Information Science and Engineering ； 19卷2期 (2003 / 03 / 01) ， P329 - 351
显示于类别:	[應數系] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	204	检视/开启

检视Licence

在CCUR中所有的数据项都受到原著作权保护.