Finding an efficient route is difficult problem for many drivers. Car Navigation Systems are sometimes offered as a special feature on new cars. These systems are capable of performing some of the tasks traditionally performed by driver, such as determining the best route to the destination. This process of finding shortest path from one point to another, is called routing. In this paper, a new shortest path algorithm is proposed. The suggested algorithm is a modified version of dijkstra, which states that search space is restricted by the use of a rectangle or a static and dynamic hexagon. These methods can improve run times and usaged memory because the visited nodes and edges are limited. In order to show the effectiveness of the proposed algorithm, it is tested on the city map of Arak and Tehran. Following, this result is compared to the result obtained with dijkstra's algorithm.
[1]
Masato Noto,et al.
A method for the shortest path search by extended Dijkstra algorithm
,
2000,
Smc 2000 conference proceedings. 2000 ieee international conference on systems, man and cybernetics. 'cybernetics evolving to systems, humans, organizations, and their complex interactions' (cat. no.0.
[2]
Mengyin Fu,et al.
A practical route planning algorithm for vehicle navigation system
,
2004,
Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788).
[3]
Haim Kaplan,et al.
Reach for A*: Efficient Point-to-Point Shortest Path Algorithms
,
2006,
ALENEX.
[4]
Thomas Willhalm,et al.
Engineering shortest paths and layout algorithms for large graphs
,
2005
.