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, 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.
Skip Nav Destination
Article navigation
26 December 2007
COMPUTATION IN MODERN SCIENCE AND ENGINEERING: Proceedings of the International Conference on Computational Methods in Science and Engineering 2007 (ICCMSE 2007): VOLUME 2, PARTS A and B
25–30 September 2007
Corfu (Greece)
Research Article|
December 26 2007
A Hybrid Shortest Path Algorithm for Navigation System
Hsun‐Jung Cho;
Hsun‐Jung Cho
Department of Transportation Technology and Management, National Chiao Tung University 1001 Ta Hsueh Road, Hsinchu, TAIWAN
Search for other works by this author on:
Chien‐Lun Lan
Chien‐Lun Lan
Department of Transportation Technology and Management, National Chiao Tung University 1001 Ta Hsueh Road, Hsinchu, TAIWAN
Search for other works by this author on:
AIP Conf. Proc. 963, 1024–1027 (2007)
Citation
Hsun‐Jung Cho, Chien‐Lun Lan; A Hybrid Shortest Path Algorithm for Navigation System. AIP Conf. Proc. 26 December 2007; 963 (2): 1024–1027. https://doi.org/10.1063/1.2835913
Download citation file:
Pay-Per-View Access
$40.00
Sign In
You could not be signed in. Please check your credentials and make sure you have an active account and try again.
11
Views
Citing articles via
Inkjet- and flextrail-printing of silicon polymer-based inks for local passivating contacts
Zohreh Kiaee, Andreas Lösel, et al.
Effect of coupling agent type on the self-cleaning and anti-reflective behaviour of advance nanocoating for PV panels application
Taha Tareq Mohammed, Hadia Kadhim Judran, et al.
Design of a 100 MW solar power plant on wetland in Bangladesh
Apu Kowsar, Sumon Chandra Debnath, et al.
Related Content
Application of shortest path problem in the university campus using Dijkstra’s algorithm
AIP Conf. Proc. (August 2023)
Development of smartphone based indoor navigation system using BLE nodes for the workforce in industry 4.0 through a digital map interface
AIP Conference Proceedings (September 2022)
Development of a software module for calculating the shortest path problem implemented by the Bellman-Ford algorithm
AIP Conf. Proc. (January 2024)
Dijkstra algorithm to find shortest path of tourist destination in the border area of Indonesia – Timor Leste
AIP Conf. Proc. (July 2023)
Penang data safety prediction using database development and alternative road identification using Dijkstra approach
AIP Conference Proceedings (June 2022)