Dijkstra’s Algorithm for Solving the Shortest Path Problem on Networks Under Intuitionistic Fuzzy Environment

In this paper, a well known problem called the Shortest Path Problem (SPP) has been considered in an uncertain environment. The cost parameters for traveling each arc have been considered as Intuitionistic Fuzzy Numbers (IFNs) which are the more generalized form of fuzzy numbers involving a degree of acceptance and a degree of rejection. A heuristic methodology for solving the SPP has been developed, which aim to exploit tolerance for imprecision, uncertainty and partial truth to achieve tractability, robustness and low cost solution corresponding to the minimum‐cost path or the shortest path. The Modified Intuitionistic Fuzzy Dijkstra’s Algorithm (MIFDA) has been proposed in this paper for solving Intuitionistic Fuzzy Shortest Path Problem (IFSPP) using the Intuitionistic Fuzzy Hybrid Geometric (IFHG) operator. A numerical example illustrates the effectiveness of the proposed method.