Short communication: Fuzzy Dijkstra algorithm for shortest path problem under uncertain environment

  • Authors:

  • Yong Deng;Yuxin Chen;Yajuan Zhang;Sankaran Mahadevan

  • Affiliations:

  • School of Computer and Information Sciences, Southwest University, Chongqing 400715, China and School of Electronics and Information Technology, Shanghai Jiao Tong University, Shanghai 200240, Chi ...;School of Electronics and Information Technology, Shanghai Jiao Tong University, Shanghai 200240, China;School of Computer and Information Sciences, Southwest University, Chongqing 400715, China;School of Engineering, Vanderbilt University, Nashville, TN 37235, USA

  • Venue:
  • Applied Soft Computing
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

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.