.png){kind=icon}
Return
Shortest path problem using Bellman algorithm under neutrosophic environment
.png){kind=icon}
OA
AI
DOI：10.1007/s40747-019-0101-8.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
An elongation of the single-valued neutrosophic set is an interval-valued neutrosophic set. It has been demonstrated to deal indeterminacy in a decision-making problem. Real-world problems have some kind of uncertainty in nature and among them; one of the influential problems is solving the shortest path problem (SPP) in interconnections. In this contribution, we consider SPP through Bellman's algorithm for a network using interval-valued neutrosophic numbers (IVNNs). We proposed a novel algorithm to obtain the neutrosophic shortest path between each pair of nodes. Length of all the edges is accredited an IVNN. Moreover, for the validation of the proposed algorithm, a numerical example has been offered. Also, a comparative analysis has been done with the existing methods which exhibit the advantages of the new algorithm.
Keywords:
Interval-valued neutrosophic numbers
Ranking methods
Shortest path problem
Bellman's algorithm
Directed graph network
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.6
Papers:
2.1K
Citations:
6.6K
Organization
Cited Papers
ShareSaveShareSave
Mean rate of DNA replication and replicon size in the shoot apex ofSilene coelirosa L. During the initial 120 minutes of the first day of floral induction.png)
Protoplasma
ProtoplasmaIF0
PREAI
ShareSaveShareSaveShareSaveShareSaveShareSave
View more