T*: a weighted double-heuristic search algorithm to find the shortest path.
Mohammad Samadi GharajehPublished in: Int. J. Comput. Sci. Math. (2019)
Keyphrases
- shortest path
- heuristic search algorithms
- weighted graph
- bi directional
- heuristic search
- shortest path problem
- shortest path algorithm
- betweenness centrality
- search algorithm
- road network
- edge weights
- search problems
- travel time
- routing algorithm
- search methods
- optimal path
- evaluation function
- graph partitioning
- tree search
- heuristic function
- shortest distance
- graph model
- path length
- beam search
- finding the shortest path