Intuitionistic fuzzy shortest hyperpath in a network

• A method for finding the shortest hyperpath in an intuitionistic fuzzy weighted hypergraph.
• Minimum arc length of an intuitionistic fuzzy hyperpath.
• An algorithm for searching the shortest hyperpath.

Intuitionistic fuzzy graph theory is finding an increasing number of applications in modeling real time systems where the level of information inherent in the system varies with different levels of precision. Intuitionistic fuzzy models are becoming useful because of their aim in reducing the differences between the traditional numerical models used in engineering and sciences and the symbolic models used in expert systems. In this paper, a method for finding the shortest hyperpath in an intuitionistic fuzzy weighted hypergraph is proposed. An intuitionistic fuzzy number is converted into intuitionistic fuzzy scores. To find the intuitionistic fuzzy shortest hyperpath in the network, ranking is done using the scores and accuracy.