Shortest Path Problem Using Pentagonal Fuzzy Number

The shortest path problem is one of the fundamental network optimization problem connected with real world applications. In this paper a creative algorithm is computed for shortest path problem and solved using pentagonal fuzzy number. Initially the path length is calculated and the minimum length is finalized and then the Euclidean distance is applied to evaluate the shortest path. A numerical example is given to illustrate the algorithm. In real life situations the application of shortest path algorithm helps emergency services to optimize their operations and ultimately saves lives by ensuring swift and efficient deployment of resources in critical situations.