Algorithm for Shortest Path Problem in a Network with Interval-valued Intuitionistic Trapezoidal Fuzzy Number

The shortest path problem is a classical network optimization problem which has a wide range of applications in various fields of science and engineering. In the present communication, an algorithm to find the shortest path and shortest distance in an interval-valued intuitionistic fuzzy graph with nodes and links being crisp but the edge weights will be Interval-valued Intuitionistic Trapezoidal Fuzzy Numbers (IITFNs). Finally, a numerical example has been provided for illustrating the proposed approach.