An Algorithm for Extracting Intuitionistic Fuzzy Shortest Path in a Graph. (2nd December 2013)

• Record Type: Journal Article
• Authors: Biswas, Siddhartha Sankar; Alam, Bashir; Doja, M. N.
• Other Names: Liu Baoding Academic Editor.
• Is Part Of: Applied computational intelligence and soft computing. Volume 2013(2013)
• Publication Date: 2013-12-02
• Subjects: Computational intelligence -- Periodicals; Soft computing -- Periodicals; 006.305
• DOI: 10.1155/2013/970197
• Languages: English
• ISSNs: 1687-9724

Abstract

Abstract : We consider an intuitionistic fuzzy shortest path problem (IFSPP) in a directed graph where the weights of the links are intuitionistic fuzzy numbers. We develop a method to search for an intuitionistic fuzzy shortest path from a source node to a destination node. We coin the concept of classical Dijkstra's algorithm which is applicable to graphs with crisp weights and then extend this concept to graphs where the weights of the arcs are intuitionistic fuzzy numbers. It is claimed that the method may play a major role in many application areas of computer science, communication network, transportation systems, and so forth. in particular to those networks for which the link weights (costs) are ill defined.