
For FullText PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.

An A^{*} Algorithm with a New Heuristic Distance Function for the 2Terminal Shortest Path Problem
Kazuaki YAMAGUCHI Sumio MASUDA
Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Vol.E89A
No.2
pp.544550 Publication Date: 2006/02/01 Online ISSN: 17451337
DOI: 10.1093/ietfec/e89a.2.544 Print ISSN: 09168508 Type of Manuscript: PAPER Category: Algorithms and Data Structures Keyword: shortest path, preprocessing, A^{*} algorithm, routing,
Full Text: PDF(1.2MB)>>
Summary:
The 2terminal shortest path problem is to find a shortest path between two specified vertices in a given graph G. In this paper, we consider this problem in the following situation: G is given before the two vertices are specified so that some preprocessing is allowed to reduce the response time. We present a method for calculating lower bounds of the length of the shortest path for any pair of vertices. Experimental results show that the A^{*} algorithm with our method performs much better than previous methods.

