Computing the nxm shortest path efficiently

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.

[1]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[2]  W. W. Bledsoe,et al.  Review of "Problem-Solving Methods in Artificial Intelligence by Nils J. Nilsson", McGraw-Hill Pub. , 1971, SGAR.

[3]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[4]  Mikkel Thorup,et al.  On RAM priority queues , 1996, SODA '96.

[5]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Rajeev Raman,et al.  Priority Queues: Small, Monotone and Trans-dichotomous , 1996, ESA.

[7]  Rina Dechter,et al.  Generalized best-first search strategies and the optimality of A* , 1985, JACM.

[8]  Dennis de Champeaux,et al.  Bidirectional Heuristic Search Again , 1983, JACM.

[9]  Michael L. Fredman,et al.  Trans-Dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths , 1994, J. Comput. Syst. Sci..

[10]  Paul R. Cohen,et al.  Handbook of AI , 1986 .

[11]  Hiroshi Imai,et al.  A fast algorithm for finding better routes by AI search techniques , 1994, Proceedings of VNIS'94 - 1994 Vehicle Navigation and Information Systems Conference.

[12]  Andrew V. Goldberg,et al.  Buckets, heaps, lists, and monotone priority queues , 1997, SODA '97.

[13]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[14]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.

[15]  Prabhakar Ragde,et al.  A Bidirectional Shortest-Path Algorithm With Good Average-Case Behavior (Preliminary Version) , 1985, ICALP.

[16]  David Gelperin,et al.  The optimality of A , 1988 .