Dijkstra algorithm for shortest path problem under interval-valued Pythagorean fuzzy environment.

Pythagorean fuzzy set as an extension of fuzzy set has been presented to handle the uncertainty in real-world decision-making problems. In this work, we formulate a shortest path (SP) problem in an interval-valued Pythagorean fuzzy environment. Here, the costs related to arcs are taken in the form of interval-valued Pythagorean fuzzy numbers (IVPFNs). The main contributions of this paper are fourfold: (1) the interval-valued Pythagorean fuzzy optimality conditions in directed networks are described to design of solution algorithm. (2) To do this, an improved score function is used to compare the costs between different paths with their arc costs represented by IVPFNs. (3) Based on these optimality conditions and the improved score function, the traditional Dijkstra algorithm is extended to find the cost of interval-valued Pythagorean fuzzy SP (IVPFSP) and corresponding IVPFSP. (4) Finally, a small sized telecommunication network is provided to illustrate the potential application of the proposed method. [ABSTRACT FROM AUTHOR]