Branch Mathematics and Statistics Faculty and Staff Publications

Document Type

Article

Publication Date

2020

Abstract

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.

Publisher

American Scientific Publishing Group

Publication Title

International Journal of Neutrosophic Science

Volume

11

Issue

1

First Page

53

Last Page

61

DOI

DOI: 10.5281/zenodo.4127190

Language (ISO)

English

Keywords

Heuristic function, Interval Valued Neutrosophic Graph, Score Function, Shortest Path Problem, Destination node, Source node

Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.

Download

Share

COinS