Generalized best-first search strategies and the optimality of A*
Journal of the ACM (JACM)
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Principles of artificial intelligence
Principles of artificial intelligence
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Buckets, heaps, lists, and monotone priority queues
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Bidirectional Heuristic Search Again
Journal of the ACM (JACM)
Multidimensional binary search trees used for associative searching
Communications of the ACM
Handbook of AI
A Bidirectional Shortest-Path Algorithm With Good Average-Case Behavior (Preliminary Version)
Proceedings of the 12th Colloquium on Automata, Languages and Programming
Priority Queues: Small, Monotone and Trans-dichotomous
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Problem-Solving Methods in Artificial Intelligence
Problem-Solving Methods in Artificial Intelligence
| Hi-index | 0.00 |
Computation of all the shortest paths between multiple sources and multiple destinations on various networks is required in many problems, such as the traveling salesperson problem (TSP) and the vehicle routing problem (VRP). This paper proposes new algorithms that compute the set of shortest paths efficiently by using the A* algorithm. The efficiency and properties of these algorithms are examined by using the results of experiments on an actual road network.