SHORTEST PATH PROBLEM UNDER TRIANGULAR FUZZY NEUTROSOPHIC INFORMATION

Main Authors: Luige Vladareanu, Said Broumi, Assia Bakali, Mohamed Talea, Florentin Smarandache
Format: Article
Terbitan: , 2017
Subjects:
Online Access: https://zenodo.org/record/854517
Daftar Isi:
  • In this paper, we develop a new approach to deal with neutrosphic shortest path problem in a network in which each edge weight (or length) is represented as triangular fuzzy neutrosophic number. The proposed algorithm also gives the shortest path length from source node to destination node using ranking function. Finally, an illustrative example is also included to demonstrate our proposed approach.