An Efficient Approach for Solving Time-Dependent Shortest Path Problem under Fermatean Neutrosophic Environment

Efficiently determining optimal paths and calculating the least travel time within complex networks is of utmost importance in addressing transportation challenges. Several techniques have been developed to identify the most effective routes within graphs, with the Reversal Dijkstra algorithm serving as a notable variant of the classical Dijkstra’s algorithm. To accommodate uncertainty within the Reversal Dijkstra algorithm, Fermatean neutrosophic numbers are harnessed. The travel time associated with the edges, which represents the connection between two nodes, can be described using fermatean neutrosophic numbers. Furthermore, the edge weights in fermatean neutrosophic graphs can be subject to temporal variations, meaning they can change over time. In this study, an extended version of the Reversal Dijkstra algorithm is employed to discover the shortest path and compute the minimum travel time within a single-source time-dependent network, where the edges are weighted using fermatean neutrosophic representations. The proposed method is exemplified, and the outcomes affirm the effectiveness of the expanded algorithm. The primary aim of this article is to serve as a reference for forthcoming shortest path algorithms designed for time-dependent fuzzy graphs © 2024, University of New Mexico. All rights reserved.