Applying Dijkstra Algorithm for Solving Spherical fuzzy Shortest Path Problem

Authors

  • Prakash Karthikeyan and Parimala Mani

Abstract

One of the classical problems in graph theory is the selection of the shortest path problem. Many algorithms have been built in the literature to provide a solution to the shortest path problem in a network. Dijkstra's algorithm is one of the most popular algorithms to solve the shortest path problem. Dijkstra's algorithm was redesigned in this paper to deal with the case where most of a network's parameters are unknown and given in terms of spherical fuzzy numbers. Finally, a numerical example is given to explain the proposed algorithm.

Published

2020-11-01

Issue

Section

Articles