Back to Search
Start Over
Fuzzy Dijkstra algorithm for shortest path problem under uncertain environment.
- Source :
- Applied Soft Computing; Mar2012, Vol. 12 Issue 3, p1231-1237, 7p
- Publication Year :
- 2012
-
Abstract
- Abstract: 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. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 15684946
- Volume :
- 12
- Issue :
- 3
- Database :
- Supplemental Index
- Journal :
- Applied Soft Computing
- Publication Type :
- Academic Journal
- Accession number :
- 70951196
- Full Text :
- https://doi.org/10.1016/j.asoc.2011.11.011