Using similarity degree approach for shortest path in Intuitionistic fuzzy network

The shortest path problem is one of the most studied problems in Intuitionistic fuzzy sets and systems area. Thus many authors discussed about Fuzzy shortest path problem in a network. This paper proposes a new algorithm to deal with the Intuitionistic fuzzy shortest path problem. It is composed of Intuitionistic fuzzy shortest path length procedure and similarity measure. In network problem the length of the paths are represented by triangular and trapezoidal Intuitionistic fuzzy number. In this paper the highest similarity degree is utilized to identify the shortest path. An illustrative example is also including demonstrating our proposed algorithm.