Abstract
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 language | English |
|---|---|
| Pages (from-to) | 183-189 |
| Number of pages | 7 |
| Journal | Engineering Intelligent Systems |
| Volume | 19 |
| Issue number | 4 |
| Publication status | Published - 1 Dec 2011 |
Keywords
- 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