Author : S. Krishna Prabha,Said Broumi,Florentin Smarandache
Publisher : Infinite Study
Page : 9 pages
File Size : 48,7 Mb
Release : 2020-10-01
Category : Mathematics
ISBN : 8210379456XXX
Interval Valued Neutrosophic Shortest Path Problem by A* Algorithm by S. Krishna Prabha,Said Broumi,Florentin Smarandache Pdf
Many researchers have been proposing various algorithms to unravel different types of fuzzy shortest path problems. There are many algorithms like Dijkstra’s, Bellman-Ford,Floyd-Warshall and kruskal’s etc. are existing for solving the shortest path problems. In this work a shortest path problem with interval valued neutrosophic numbers is investigated using the proposed algorithm. A* algorithm is extensively applied in pathfinding and graph traversal.Unlike the other algorithms mentioned above, A* algorithm entails heuristic function to uncover the cost of path that traverses through the particular state. In the structured work A* algorithm is applied to unravel the length of the shortest path by utilizing ranking function from the source node to the destination node. A* algorithm is executed by applying best first search with the help of this search, it greedily decides which vertex to investigate subsequently. A* is equally complete and optimal if an acceptable heuristic is concerned. The arc lengths in interval valued neutrosophic numbers are defuzzified using the score function. A numerical example is used to illustrate the proposed approach.