Analyzing Shortest Path Problem via Single-Valued Triangular Neutrosophic Numbers: A Case Study

Abstract

The shortest path problem as a core combinatorial problem in graph theory that can be applied in various fields such as project scheduling, routing, transportation, network, operation research, and computer science. The main objective of this problem is to find the path having minimum length between any pair of nodes (or vertices). In this study an algorithm was applied in order to find the shortest path having single-valued triangular neutrosophic numbers via score function. A real case study was introduced and solved by this algorithm for the purpose of showing the applicability in real-world problems. © The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2021.