Computing the nxm Shortest Paths Efficiently

@article{Shibuya2000ComputingTN,
  title={Computing the nxm Shortest Paths Efficiently},
  author={Tetsuo Shibuya},
  journal={ACM Journal of Experimental Algorithmics},
  year={2000},
  volume={5},
  pages={9}
}
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<sup>*</sup> algorithm. The efficiency and properties of these algorithms are examined by using the results of experiments on an actual road network. 

From This Paper

Topics from this paper.