Skip to main content
main-content

Tipp

Weitere Artikel dieser Ausgabe durch Wischen aufrufen

05.04.2019 | Original Article Open Access

Shortest path problem using Bellman algorithm under neutrosophic environment

Zeitschrift:
Complex & Intelligent Systems
Autoren:
Said Broumi, Arindam Dey, Mohamed Talea, Assia Bakali, Florentin Smarandache, Deivanayagampillai Nagarajan, Malayalan Lathamaheswari, Ranjan Kumar
Wichtige Hinweise

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Abstract

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.
Literatur
Über diesen Artikel

Premium Partner

    Bildnachweise