Acceleration of the A*-Algorithm for the Shortest Path Problem in Digital Road Maps

2008 ◽  
pp. 455-460 ◽  
Author(s):  
Felix Hahne ◽  
Curt Nowak ◽  
Klaus Ambrosi
Keyword(s):  
Shortest Path ◽  
Shortest Path Problem ◽  
A Algorithm ◽  
Digital Road Maps ◽  
Road Maps

scholarly journals Interval Valued Neutrosophic Shortest Path Problem by A* Algorithm

2020 ◽  
pp. 53-61
Author(s):  
admin admin ◽  
◽  
◽  
◽  
Said Broumi ◽  
...  
Keyword(s):  
Shortest Path ◽  
Score Function ◽  
Shortest Path Problem ◽  
Destination Node ◽  
A Algorithm ◽  
Shortest Path Problems ◽  
Different Types ◽  
The Cost ◽  
Arc Lengths ◽  
Interval Valued

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.

Application of Genetic Algorithm in modeling of Shortest Path problem

2020 ◽  
Author(s):  
Zhihui Yang ◽  
Huiwen Xia ◽  
Fuwen Su ◽  
Jiayu Zhao ◽  
Fan Feng
Keyword(s):  
Genetic Algorithm ◽  
Shortest Path ◽  
Shortest Path Problem

Distributionally robust maximum probability shortest path problem

2021 ◽  
Author(s):  
Rashed Khanjani-Shiraz ◽  
Ali Babapour-Azar ◽  
Zohreh Hosseini-Noudeh ◽  
Panos M. Pardalos
Keyword(s):  
Shortest Path ◽  
Shortest Path Problem ◽  
Maximum Probability ◽  
Distributionally Robust
Sign in / Sign up

Export Citation Format

Share Document