Araştırma Makalesi

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

Cilt: 3 Sayı: 2 29 Aralık 2019
PDF İndir
TR EN

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

Öz

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.

Anahtar Kelimeler

Kaynakça

  1. Abdel-Baset M., Chang V., & Gamal A. (2019). “Evaluation of the green supply chain management practices: A novel neutrosophic approach”. Computers in Industry 108, 210-220
  2. Abdel-Basset M., Saleh M., Gamal A., & Smarandache F. (2019a).”An approach of TOPSIS technique for developing supplier selection with group decision making under type-2 neutrosophic number”. Applied Soft Computing 77, 438-452.
  3. Anuuya V.and Sathya R. (2013). “Shortest Path with Complement of Type -2 Fuzzy Number”. Malya Journal of Matematik, S(1), 71-76.
  4. Atanassov K. (1986). “Intuitionistic Fuzzy Sets”. Fuzzy Sets and Systems 20, 87-96.
  5. Atanassov K. and Gargov G. (1989). “Interval Valued Intuitionisitic Fuzzy Sets”. Fuzzy Sets and Systems 31, 343-349.
  6. Biswas P., Parmanik S. and Giri B. C. (2014). “Cosine Similarity Measure Based Multi-attribute Decision- Making With Trapezoidal Fuzzy Neutrosophic Numbers”.Neutrosophic sets and systems 8, 47-57.
  7. Broumi S. and Talea M. and Bakali A. and Smarandache F. and Khan M. (2017). “A Bipolar Single Valued Neutrosophic Isolated Graphs: Revisited”. International Journal of New Computer Architectures and their Applications (IJNCAA) 7(3), 89-94
  8. Broumi S. , Talea M., Bakali A. , Smarandache F. , Nagarajan D., Lathamaheswari M. and Parimala M. (2019e). “Shortest path problem in fuzzy, intuitionistic fuzzy and neutrosophic environment: an overview”. Complex & Intelligent Systems , ,1-8, https://doi.org/10.1007/s40747-019-0098-z

Ayrıntılar

Birincil Dil

İngilizce

Konular

Yapay Zeka

Bölüm

Araştırma Makalesi

Yayımlanma Tarihi

29 Aralık 2019

Gönderilme Tarihi

8 Temmuz 2019

Kabul Tarihi

18 Aralık 2019

Yayımlandığı Sayı

Yıl 2019 Cilt: 3 Sayı: 2

Kaynak Göster

APA
Broumi, S., Bakali, A., Talea, M., & Smarandache, F. (2019). COMPUTATION OF SHORTEST PATH PROBLEM IN A NETWORK WITH SV-TRIANGULAR NEUTROSOPHIC NUMBERS. International Journal of Management Information Systems and Computer Science, 3(2), 41-51. https://doi.org/10.33461/uybisbbd.588290
AMA
1.Broumi S, Bakali A, Talea M, Smarandache F. COMPUTATION OF SHORTEST PATH PROBLEM IN A NETWORK WITH SV-TRIANGULAR NEUTROSOPHIC NUMBERS. UYBİSBBD. 2019;3(2):41-51. doi:10.33461/uybisbbd.588290
Chicago
Broumi, Said, Assia Bakali, Mohamed Talea, ve Florentin Smarandache. 2019. “COMPUTATION OF SHORTEST PATH PROBLEM IN A NETWORK WITH SV-TRIANGULAR NEUTROSOPHIC NUMBERS”. International Journal of Management Information Systems and Computer Science 3 (2): 41-51. https://doi.org/10.33461/uybisbbd.588290.
EndNote
Broumi S, Bakali A, Talea M, Smarandache F (01 Aralık 2019) COMPUTATION OF SHORTEST PATH PROBLEM IN A NETWORK WITH SV-TRIANGULAR NEUTROSOPHIC NUMBERS. International Journal of Management Information Systems and Computer Science 3 2 41–51.
IEEE
[1]S. Broumi, A. Bakali, M. Talea, ve F. Smarandache, “COMPUTATION OF SHORTEST PATH PROBLEM IN A NETWORK WITH SV-TRIANGULAR NEUTROSOPHIC NUMBERS”, UYBİSBBD, c. 3, sy 2, ss. 41–51, Ara. 2019, doi: 10.33461/uybisbbd.588290.
ISNAD
Broumi, Said - Bakali, Assia - Talea, Mohamed - Smarandache, Florentin. “COMPUTATION OF SHORTEST PATH PROBLEM IN A NETWORK WITH SV-TRIANGULAR NEUTROSOPHIC NUMBERS”. International Journal of Management Information Systems and Computer Science 3/2 (01 Aralık 2019): 41-51. https://doi.org/10.33461/uybisbbd.588290.
JAMA
1.Broumi S, Bakali A, Talea M, Smarandache F. COMPUTATION OF SHORTEST PATH PROBLEM IN A NETWORK WITH SV-TRIANGULAR NEUTROSOPHIC NUMBERS. UYBİSBBD. 2019;3:41–51.
MLA
Broumi, Said, vd. “COMPUTATION OF SHORTEST PATH PROBLEM IN A NETWORK WITH SV-TRIANGULAR NEUTROSOPHIC NUMBERS”. International Journal of Management Information Systems and Computer Science, c. 3, sy 2, Aralık 2019, ss. 41-51, doi:10.33461/uybisbbd.588290.
Vancouver
1.Said Broumi, Assia Bakali, Mohamed Talea, Florentin Smarandache. COMPUTATION OF SHORTEST PATH PROBLEM IN A NETWORK WITH SV-TRIANGULAR NEUTROSOPHIC NUMBERS. UYBİSBBD. 01 Aralık 2019;3(2):41-5. doi:10.33461/uybisbbd.588290