Dijkstra algorithm is a widely used algorithm to find the shortest path between two specified nodes in a network problem. In this paper, a generalized fuzzy Dijkstra algorithm is proposed to find the shortest path using a new parameterized defuzzification method. Here, we address most important issue like the decision maker’s choice. A numerical example is used to illustrate the efficiency of the proposed algorithm.
@artical{s10102021ijcatr10101001,
Title = "Optimization of Shortest Path Problem using Dijkstra’s Algorithm in Imprecise Environment",
Journal ="International Journal of Computer Applications Technology and Research (IJCATR)",
Volume = "10",
Issue ="10",
Pages ="216 - 221",
Year = "2021",
Authors ="Samir Dey, Sriza Malakar, Shibnath Rajak"}
10.7753/IJCATR1010.1001
Editor/Reviewer login