An Advanced Algorithm for Finding Shortest Path in Car Navigation System

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.