An algorithm for extracting intuitionistic fuzzy shortest path in a graph

Authors:
Siddhartha Sankar Biswas;Bashir Alam;M. N. Doja
Affiliations:
Department of Computer Engineering, Jamia Millia Islamia, New Delhi, India;Department of Computer Engineering, Jamia Millia Islamia, New Delhi, India;Department of Computer Engineering, Jamia Millia Islamia, New Delhi, India
Venue:
Applied Computational Intelligence and Soft Computing
Year:
2013

Citing 7
Cited 0

More on intuitionistic fuzzy sets

Fuzzy Sets and Systems
Fuzzy shortest paths

Fuzzy Sets and Systems
A shortest path problem on a network with fuzzy arc lengths

Fuzzy Sets and Systems
Intuitionistic fuzzy sets

Fuzzy Sets and Systems
A ratio ranking method of triangular intuitionistic fuzzy numbers and its application to MADM problems

Computers & Mathematics with Applications
Intuitionistic Fuzzy Sets: Theory and Applications

Intuitionistic Fuzzy Sets: Theory and Applications
Ranking fuzzy numbers with a distance method using circumcenter of centroids and an index of modality

Advances in Fuzzy Systems

Quantified Score

Hi-index	0.00

Visualization

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.