International Journal of Neutrosophic Science IJNS 2690-6805 2692-6148 10.54216/IJNS https://www.americaspg.com/journals/show/619 2020 2020 Department of Mathematics, PSNA College of Engineering and Technology, Dindigul-624622, Tamilnadu, India admin admin Laboratory of Information Processing, Faculty of Science Ben M’Sik, University Hassan II, Casablanca, Morocco Said Broumi Dept. Math and Sciences, University of New Mexico, Gallup, NM, USA Florentin Smarandache   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.   2020 2020 53 61 10.54216/IJNS.0110104 https://www.americaspg.com/articleinfo/21/show/619