COMPUTATION OF SHORTEST PATH PROBLEM IN A NETWORK WITH SV-TRIANGULAR NEUTROSOPHIC NUMBERS

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

Uluslararası Yönetim Bilişim Sistemleri ve Bilgisayar Bilimleri Dergisi
Volume:3 Issue:2
COMPUTATION OF SHORTEST PATH PROBLEM IN A NETWORK WITH SV-TRIANGULAR NEUTROSOPHIC NUMBERS

COMPUTATION OF SHORTEST PATH PROBLEM IN A NETWORK WITH SV-TRIANGULAR NEUTROSOPHIC NUMBERS

Authors : Said BROUMİ, Assia BAKALİ, Mohamed TALEA, Florentin SMARANDACHE

Pages : 41-51

Doi:10.33461/uybisbbd.588290

View : 18 | Download : 8

Publication Date : 2019-12-29

Article Type : Research Paper

Abstract :In this article, we present an algorithm method for finding the shortest path length between a paired nodes on a network where the edge weights are characterized by single valued triangular neutrosophic numbers. The proposed algorithm gives the shortest path length from source node to destination node based on a ranking method. Finally, a numerical example is also presented to illustrate the efficiency of the proposed approach.
Keywords : single valued triangular neutrosophic number, network, shortest path problem

ORIGINAL ARTICLE URL

VIEW PAPER (PDF)

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.