.png){kind=icon}
返回
Dijkstra algorithm for shortest path problem under interval-valued Pythagorean fuzzy environment
.png){kind=icon}
OA
AI
DOI：10.1007/s40747-018-0083-y.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Pythagorean fuzzy set as an extension of fuzzy set has been presented to handle the uncertainty in real-world decision-making problems. In this work, we formulate a shortest path (SP) problem in an interval-valued Pythagorean fuzzy environment. Here, the costs related to arcs are taken in the form of interval-valued Pythagorean fuzzy numbers (IVPFNs). The main contributions of this paper are fourfold: (1) the interval-valued Pythagorean fuzzy optimality conditions in directed networks are described to design of solution algorithm. (2) To do this, an improved score function is used to compare the costs between different paths with their arc costs represented by IVPFNs. (3) Based on these optimality conditions and the improved score function, the traditional Dijkstra algorithm is extended to find the cost of interval-valued Pythagorean fuzzy SP (IVPFSP) and corresponding IVPFSP. (4) Finally, a small sized telecommunication network is provided to illustrate the potential application of the proposed method.
Keyword:
Shortest path problem
Pythagorean fuzzy numbers
Score function
Dijkstra algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.6
论文数:
2.1K
被引数:
6.6K
机构
引用论文
.png){kind=icon}
分享收藏Linguistic Pythagorean fuzzy sets and its applications in multiattribute decision-making processOAAI
OAAI分享收藏
分享收藏
查看更多内容