.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Shortest path problem
Dijkstra algorithm
Fuzzy numbers
Graded mean representation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.6
Papers:
1.4W
Citations:
4.8W
Organization
View more organizations
Cited Papers
.png){kind=icon}
A new similarity measure of generalized fuzzy numbers and its application to pattern recognition
PREAI
ShareSave
ShareSaveShareSaveShareSaveShareSave View more