Share Email Print

Proceedings Paper

An efficient distributed shortest path algorithm based on hierarchically structured topographical model
Author(s): Wei Guo; Xinyan Zhu; Yi Liu
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

The route computation module is one of the most important functional blocks in a dynamic route guidance system. Although various algorithms exist for finding the shortest path, they are faced with the networks in the local server not distributed environment. We present an efficient distributed hierarchical routing algorithm that can find a near-optimal route and evaluate it on a large city road network which is composed of a lot of small networks which are placed on different servers. Solutions provided by this algorithm are compared with the stand-alone traditional hierarchical routing solutions to analyze the same and different points. We propose two novel yet simple heuristic to substantially improve the performance of this hierarchical routing algorithm with acceptable loss of accuracy. The improved distributed hierarchical routing algorithm has been found to be faster than a local A* algorithm.

Paper Details

Date Published: 7 August 2007
PDF: 9 pages
Proc. SPIE 6754, Geoinformatics 2007: Geospatial Information Technology and Applications, 675407 (7 August 2007); doi: 10.1117/12.764583
Show Author Affiliations
Wei Guo, Wuhan Univ. (China)
Xinyan Zhu, Wuhan Univ. (China)
Yi Liu, Wuhan Univ. (China)

Published in SPIE Proceedings Vol. 6754:
Geoinformatics 2007: Geospatial Information Technology and Applications
Peng Gong; Yongxue Liu, Editor(s)

© SPIE. Terms of Use
Back to Top