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.
Computing Conference 2017, 18-20 July 2017, London, UK
Triangular fuzzy neutrosophic sets; score function; Shortest path problem
Smarandache, Florentin; Said Broumi; Assia Bakali; Mohamed Talea; and Luige Vladareanu. "SHORTEST PATH PROBLEM UNDER TRIANGULAR FUZZY NEUTROSOPHIC INFORMATION." Computing Conference 2017, 18-20 July 2017, London, UK (2017): 1-30. https://digitalrepository.unm.edu/math_fsp/406
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.