Abstract
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.
Cite
CITATION STYLE
Shibuya, T. (1999). Computing the n×m shortest paths efficiently. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1619, pp. 210–224). Springer Verlag. https://doi.org/10.1007/3-540-48518-x_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
