Intelligent algorithm for trapezoidal interval valued neutrosophic network analysis

Abstract

The shortest path problem has been one of the most fundamental practical problems in network analysis. One ofthe good algorithms is Bellman-Ford, which has been applied in network, for the last some years. Due to complexity in thedecision-making process, the decision makers face complications to express their view and judgment with an exactnumber for single valued membership degrees under neutrosophic environment. Though the interval number is aspecial situation of the neutrosophic, it did not solve the shortest path problems in an absolute manner. Hence, in thiswork, the authors have introduced the score function and accuracy function of trapezoidal interval valued neutrosophicnumbers with their illustrative properties. These properties provide important theoretical base of the trapezoidalinterval valued neutrosophic number. Also, they proposed an intelligent algorithm called trapezoidal interval valuedneutrosophic version of Bellman s algorithm to solve neutrosophic shortest path problem in network analysis. Further,comparative analysis has been made with the existing algorithm.