Back to Search
Start Over
The shortest path problem in interval valued trapezoidal and triangular neutrosophic environment
- Source :
- Complex & Intelligent Systems; December 2019, Vol. 5 Issue: 4 p391-402, 12p
- Publication Year :
- 2019
-
Abstract
- Real-life decision-making problem has been demonstrated to cover the indeterminacy through single valued neutrosophic set. It is the extension of interval valued neutrosophic set. Most of the problems of real life involve some sort of uncertainty in it among which, one of the famous problem is finding a shortest path of the network. In this paper, a new score function is proposed for interval valued neutrosophic numbers and SPP is solved using interval valued neutrosophic numbers. Additionally, novel algorithms are proposed to find the neutrosophic shortest path by considering interval valued neutrosophic number, trapezoidal and triangular interval valued neutrosophic numbers for the length of the path in a network with illustrative example. Further, comparative analysis has been done for the proposed algorithm with the existing method with the shortcoming and advantage of the proposed method and it shows the effectiveness of the proposed algorithm.
Details
- Language :
- English
- ISSN :
- 21994536 and 21986053
- Volume :
- 5
- Issue :
- 4
- Database :
- Supplemental Index
- Journal :
- Complex & Intelligent Systems
- Publication Type :
- Periodical
- Accession number :
- ejs48699204
- Full Text :
- https://doi.org/10.1007/s40747-019-0092-5