Evaluation of Shortest path on multi stage graph problem using Dynamic approach under neutrosophic environment
Keywords:
dynamic programming approach; multistage graph; neutrosophic multi-value number; shortest path problemAbstract
The shortest path problem is a classic optimization problem in graph theory and
computer technology. It involves identifying the shortest path between two nodes
in a graph, where each edge has a numerical weight. In this paper, we put our effort
into examining the use of the dynamic programming method to evaluate the
shortest path (SP) between the two specified nodes in a multistage network where
the parameter is a multi-value neutrosophic number (MVNN). Firstly, we propose
an algorithm based on the forward and backward approach in an uncertain
environment and also implement our approach in the Python-3 programming
language. Furthermore, a numerical illustration has been provided to showcase the
effectiveness and robustness of the novel model.
Downloads
![](https://fs.unm.edu/nss8/public/journals/1/article_4263_cover_en.png)
Downloads
Published
Issue
Section
License
Copyright (c) 2024 Neutrosophic Sets and Systems
![Creative Commons License](http://i.creativecommons.org/l/by/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution 4.0 International License.