Finally, a numerical example is also presented to illustrate the efficiency of the proposed approach.
📌 3 Key Takeaways
🎯
Objective & Hypothesis: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.
📊
Key Findings & Data:The proposed algorithm gives the shortest path length from source node to destination node based on a ranking method.
💡
Conclusion & Impact:Finally, a numerical example is also presented to illustrate the efficiency of the proposed approach.
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.
Özet
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.
BROUMİ, S., BAKALİ, A., TALEA, M., SMARANDACHE, F. (2019). COMPUTATION OF SHORTEST PATH PROBLEM IN A NETWORK WITH SV-TRIANGULAR NEUTROSOPHIC NUMBERS. Uluslararası Yönetim Bilişim Sistemleri ve Bilgisayar Bilimleri Dergisi, Cilt: 3 - Sayı: 2, 41–51. https://ajindex.com/articles/416501
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
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.
Anuuya V.and Sathya R. (2013). “Shortest Path with Complement of Type -2 Fuzzy Number”. Malya Journal of Matematik, S(1), 71-76.
Atanassov K. (1986). “Intuitionistic Fuzzy Sets”. Fuzzy Sets and Systems 20, 87-96.
Atanassov K. and Gargov G. (1989). “Interval Valued Intuitionisitic Fuzzy Sets”. Fuzzy Sets and Systems 31, 343-349.
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. 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
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
Broumi S., Bakali A., Talea M., Smarandache F., Ali M. (2016f). “Shortest Path Problem Under Bipolar Neutrosophic Setting”.Applied Mechanics and Materials 859, 59-66
Broumi S., A. Dey, M. Talea, A. Bakali, F. Smarandache, D. Nagarajan, M. Lathamaheswari and Ranjan Kumar (2019d), “Shortest Path Problem using Bellman Algorithm under Neutrosophic Environment”.Complex & Intelligent Systems,1-8, https://doi.org/10.1007/s40747-019-0101-8,
Broumi S., Bakali A., Talea M. and Smarandache F. (2016b). “Isolated Single Valued Neutrosophic Graphs”. Neutrosophic Sets and Systems 11, 74-78.
Broumi S., Bakali A., Talea M. and Smarandache F., “Shortest Path Problem on Single Valued Neutrosophic Graphs”, 2017