Finding shortest path on networks with fuzzy parameters

Yong Deng, Zili Zhang, Tung Sun Chan, Yuxin Chen, Yajuan Zhang

Research output: Journal article publicationJournal articleAcademic researchpeer-review

2 Citations (Scopus)


Finding shortest path in networks is an realistic and interesting problem. The lengths of the edges in a short path problem are naturally imprecise due to the inevitable uncertainty in real application. Hence, it is necessary to develop new methods to handle fuzzy shortest path finding problems. In this short paper, a novel and simple method to solve fuzzy shortest path finding is proposed. The dynamic programming algorithm is generalized to fuzzy environment with the use of graded mean representation of fuzzy numbers. An numerical example on transportation in network is used to illustrate the efficiency of our proposed method.
Original languageEnglish
Pages (from-to)183-189
Number of pages7
JournalEngineering Intelligent Systems
Issue number4
Publication statusPublished - 1 Dec 2011


  • Dynamic programming
  • Fuzzy numbers
  • Graded mean representation of fuzzy numbers
  • Shortest path problems

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science Applications
  • Electrical and Electronic Engineering


Dive into the research topics of 'Finding shortest path on networks with fuzzy parameters'. Together they form a unique fingerprint.

Cite this