A New Algorithm for Solving Shortest Path Problems using Octagonal Neutrosophic Numbers

Abstract

Shortest path problem, is one of the best decision making problem that can be applied in many fields of science, management and technology. The shortest route algorithm tries to find the shortest route between two nodes in a graph. Neutrosophic theory is very useful to find the better solution for real world problems when incomplete and inconsistent data are given. Octagonal neutrosophic number plays an important role for solving many decision making problems involving incompleteness and indeterminacy. This paper comprises a proposed neutrosophic network method that has been made to find the shortest path between the nodes using octagonal neutrosophic numbers.