On Searching Fuzzy Shortest Path In a Network
First A. Kiran Yadav, Second B. Ranjit Biswas · 2009
Abstract — In this paper, a novel approach is presented to find the shortest path in a directed graph which a fuzzy number, instead of a real number is assigned to each arc length (edge). An algorithm is designed to find the optimal path. Inputs and outputs of the proposed algorithm are fuzzy numbers. Finally an illustrative numerical example is given to demonstrate the proposed approach. Index Terms — Euclidean Distance, Fuzzy sets, shortest path length