Research on the Shortest Path Solution Method of Interval Valued Neutrosophic Graphs Based on the Ant Colony Algorithm

The shortest path problem (SPP) is considerably important in several fields. After typhoons, the resulting damage leads to uncertainty regarding the path weight that can be expressed accurately. A neutrosophic set is a collection of the truth membership, indeterminacy membership, and falsity membership degrees of the elements. In an uncertain environment, neutrosophic numbers can express the edge distance more effectively. Based on the theories of interval valued neutrosophy and neutrosophic graphs, this paper proposes a shortest path solution method of interval valued neutrosophic graphs using the ant colony algorithm. Further, an analysis comparing the proposed algorithm with the Dijkstra algorithm was used to probe the potential shortcomings and advantages of the proposed method. In addition, this approach confirmed the effectiveness of the proposed algorithm. Furthermore, we investigated the convergence processes of the ant colony algorithm with different parameter settings, analyzed their results, and used different score functions to solve the SPP and analyze the results. © 2013 IEEE.