A hybrid shortest path algorithm for navigation system

Hsun-Jung Cho*, Chien Lun Lan

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Combined with Geographic Information System (GIS) and Global Positioning System (GPS), the vehicle navigation system had become a quite popular product in daily life. A key component of the navigation system is the Shortest Path Algorithm. Navigation in real world must face a network consists of tens of thousands nodes and links, and even more. Under the limited computation capability of vehicle navigation equipment, it is difficult to satisfy the realtime response requirement that user expected. Hence, this study focused on shortest path algorithm that enhances the computation speed with less memory requirement. Several well-known algorithms such as Dijkstra, A* and hierarchical concepts were integrated to build hybrid algorithms that reduce searching space and improve searching speed. Numerical examples were conducted on Taiwan highway network that consists of more than four hundred thousands of links and nearly three hundred thousands of nodes. This real network was divided into two connected sub-networks (layers). The upper layer is constructed by freeways and expressways; the lower layer is constructed by local networks. Test origin-destination pairs were chosen randomly and divided into three distance categories; short, medium and long distances. The evaluation of outcome is judged by actual length and travel time. The numerical example reveals that the hybrid algorithm proposed by this research might be tens of thousands times faster than traditional Dijkstra algorithm; the memory requirement of the hybrid algorithm is also much smaller than the tradition algorithm. This outcome shows that this proposed algorithm would have an advantage over vehicle navigation system.

Original languageEnglish
Title of host publicationComputation in Modern Science and Engineering - Proceedings of the International Conference on Computational Methods in Science and Engineering 2007 (ICCMSE 2007)
Pages1024-1027
Number of pages4
Edition2
DOIs
StatePublished - 1 Dec 2007
EventInternational Conference on Computational Methods in Science and Engineering 2007, ICCMSE 2007 - Corfu, Greece
Duration: 25 Sep 200730 Sep 2007

Publication series

NameAIP Conference Proceedings
Number2
Volume963
ISSN (Print)0094-243X
ISSN (Electronic)1551-7616

Conference

ConferenceInternational Conference on Computational Methods in Science and Engineering 2007, ICCMSE 2007
CountryGreece
CityCorfu
Period25/09/0730/09/07

Keywords

  • Heuristics
  • Hierarchical network
  • Shortest path algorithm

Fingerprint Dive into the research topics of 'A hybrid shortest path algorithm for navigation system'. Together they form a unique fingerprint.

  • Cite this

    Cho, H-J., & Lan, C. L. (2007). A hybrid shortest path algorithm for navigation system. In Computation in Modern Science and Engineering - Proceedings of the International Conference on Computational Methods in Science and Engineering 2007 (ICCMSE 2007) (2 ed., pp. 1024-1027). (AIP Conference Proceedings; Vol. 963, No. 2). https://doi.org/10.1063/1.2835913