期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Intelligent algorithm for trapezoidal interval valued neutrosophic network analysis
1
作者 Said Broumi Deivanayagampillai Nagarajan +3 位作者 malayalan lathamaheswari Mohamed Talea Assia Bakali Florentin Smarandache 《CAAI Transactions on Intelligence Technology》 2020年第2期88-93,共6页
The shortest path problem has been one of the most fundamental practical problems in network analysis.One of the good algorithms is Bellman-Ford,which has been applied in network,for the last some years.Due to complex... The shortest path problem has been one of the most fundamental practical problems in network analysis.One of the good algorithms is Bellman-Ford,which has been applied in network,for the last some years.Due to complexity in the decision-making process,the decision makers face complications to express their view and judgment with an exact number for single valued membership degrees under neutrosophic environment.Though the interval number is a special situation of the neutrosophic,it did not solve the shortest path problems in an absolute manner.Hence,in this work,the authors have introduced the score function and accuracy function of trapezoidal interval valued neutrosophic numbers with their illustrative properties.These properties provide important theoretical base of the trapezoidal interval valued neutrosophic number.Also,they proposed an intelligent algorithm called trapezoidal interval valued neutrosophic version of Bellman’s algorithm to solve neutrosophic shortest path problem in network analysis.Further,comparative analysis has been made with the existing algorithm. 展开更多
关键词 properties. VALUED shortest
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部