The shortest path problem in interval valued trapezoidal and triangular neutrosophic environment
The shortest path problem in interval valued trapezoidal and triangular neutrosophic environment
复制标题
DOI：
10.1007/s40747-019-0092-5
复制
发表时间：
2019-12-01
影响因子：
5.8
通讯作者：
Lathamaheswari, Malayalan
中科院分区：
文献类型：
--
作者：
Broumi, Said;Nagarajan, Deivanayagampillai;Lathamaheswari, Malayalan
现实生活中的决策问题已经被证明可以通过单值决策集来覆盖不确定性。它是区间值代数集的推广。真实的生活中的许多问题都涉及到某种不确定性，其中最著名的问题之一就是求网络的最短路径。本文提出了区间值仿射数的一种新的评分函数，并利用区间值仿射数求解了SPP。此外，通过考虑区间值拓扑数、梯形和三角形区间值拓扑数对网络中路径长度的影响，提出了求解拓扑最短路径的新算法，并给出了示例.进一步，将该算法与现有方法进行了对比分析，分析了该算法的优缺点，验证了该算法的有效性。
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.