Evaluation of Shortest path on multi stage graph problem using Dynamic approach under neutrosophic environment

Autor:	Prasanta Kumar Raut, Siva Prasad Behera, Said Broumi, Amarendra Baral
Jazyk:	angličtina
Rok vydání:	2024
Předmět:	dynamic programming approach multistage graph neutrosophic multi-value number shortest path problem Mathematics QA1-939 Electronic computers. Computer science QA75.5-76.95
Zdroj:	Neutrosophic Sets and Systems, Vol 64, Pp 113-131 (2024)
Druh dokumentu:	article
ISSN:	2331-6055 2331-608X
DOI:	10.5281/zenodo.10703080
Popis:	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.
Databáze:	Directory of Open Access Journals
Externí odkaz:	https://doaj.org/article/63e1e9b067624d5abfb55d6fc1752186 Zobrazit plný text záznamu View record in DOAJ Plný text ve formátu PDF