Fuzzy shortest path problem based on index ranking. (English) Zbl 1263.05051
Summary: The shortest path problem is a classical network optimisation problem which has wide range of applications in various fields. In this work, we study the task of finding the shortest path in a fuzzy weighted graph (network), i.e., vertices remains crisp, but the edge weights will be of fuzzy numbers. It has been proposed to present new algorithms for finding the shortest path in fuzzy sense where illustrative examples are also included to demonstrate our proposed approach.
MSC:
05C35 | Extremal problems in graph theory |
05C38 | Paths and cycles |
05C72 | Fractional graph theory, fuzzy graph theory |
05C22 | Signed and weighted graphs |
05C82 | Small world graphs, complex networks (graph-theoretic aspects) |
05C85 | Graph algorithms (graph-theoretic aspects) |