Heuristic search in database systems
Proceedings from the first international workshop on Expert database systems
A parallel shortest path algorithm
Computing
Algorithms for Searching Massive Graphs
IEEE Transactions on Knowledge and Data Engineering
Path Computation Algorithms for Advanced Traveller Information System (ATIS)
Proceedings of the Ninth International Conference on Data Engineering
Hi-index | 0.00 |
In this paper, we have studied the shortest path re-computation problem that arises in the dynamic route guidance system (DRGS) in ATIS where the cost of topological digital road map is frequently updated as traffic condition changes dynamically. Previously suggested methods are trivial in that they do not intelligently utilize the previously computed shortest path information. We have developed an efficient approximate shortest path recomputation method based on the dynamic window scheme. The proposed method recomputes an approximate shortest path very quickly by utilizing the previously computed shortest path information. We first show the theoretical analysis of our methods and then present an in-depth experimental performance analysis by implementing it on grid graphs.