.png){kind=icon}
返回
Fuzzy Dijkstra algorithm for shortest path problem under uncertain environment
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2011.11.011.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A common algorithm to solve the shortest path problem (SPP) is the Dijkstra algorithm. In this paper, a generalized Dijkstra algorithm is proposed to handle SPP in an uncertain environment. Two key issues need to be addressed in SPP with fuzzy parameters. One is how to determine the addition of two edges. The other is how to compare the distance between two different paths with their edge lengths represented by fuzzy numbers. To solve these problems, the graded mean integration representation of fuzzy numbers is adopted to improve the classical Dijkstra algorithm. A numerical example of a transportation network is used to illustrate the efficiency of the proposed method. (C) 2011 Elsevier B.V. All rights reserved.
Keyword:
Shortest path problem
Dijkstra algorithm
Fuzzy numbers
Graded mean representation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
.png){kind=icon}
A new similarity measure of generalized fuzzy numbers and its application to pattern recognition
PREAI
分享收藏
分享收藏Risk analysis in a linguistic environment: A fuzzy evidential reasoning-based approach语言环境中的风险分析: 基于模糊证据推理的方法
PREAI
分享收藏分享收藏
查看更多内容