Accès ouvert · CC BY

Shortest path problem using Bellman algorithm under neutrosophic environment

Article scientifique 2019 Sciences mathématiques et statistiques Anglais

Résumé

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.

Citer ce document

Broumi, S., Dey, A., Talea, M., Bakali, A., Smarandache, F., Lathamaheswari, M., & Kumar, R. (2019). Shortest path problem using Bellman algorithm under neutrosophic environment. Complex & Intelligent Systems. https://doi.org/10.1007/s40747-019-0101-8

Exporter : BibTeX · RIS (Zotero, Mendeley, EndNote)

Accès au document

Texte intégral archivé sur SPHAERO, en accès ouvert : lisible gratuitement en ligne après connexion. Le document reste aussi disponible à sa source. Se connecter

Voir l'article sur le site de la revue

Licence et provenance

Licence : CC BY

Notice moissonnée depuis OpenAlex le 02/09/2026. Le document reste hébergé par sa source.
Voir le document à la source →

Statistiques

Consultations (hors robots) : 17

Téléchargements (hors robots) : 0

Méthode de comptage