Optimization And Implementation Of The Shortest Path In The Mobile Navigation System

With the stable development of Chinese economy, people’s living standards havemarkedly improved, more and more people are concerned about the quality of theirlife. In traveling, work time, people often use mobile phone navigation or vehiclenavigation services. Phone navigation is flexible and can provide more and betterservices online. The real-time road condition can be updated online. It is helpful forthe user to avoid congestion, can quickly locate the position, can make thecommunication more convenient. However, the traditional car navigation productsalso have some insurmountable disadvantages. First of all, with the single functionand large volume, it can not be integrated with other equipment. Secondly, due to thelarge amount of map data, map updating is more complicated. The map can beupdated only by manufactures or users downloading map.How to determine the shortest path is the main problem of mobile phonenavigation system, although the Dijkstra algorithm is the classical shortest path, it canbe used in the system. But in the use of mobile phone navigation system, specialcircumstances encountered (changes in traffic information and traffic) are not takeninto account, so the algorithm must be optimized according to the actual situation.（1）The existing hortest path algorithm occupies a great memory and the efficiency islow. The improved algorithm is proposed in this paper. It was realized in PC. Thealgorithm and the improved method can be implemented to the actual life.（2）Data management is another difficulty in the GIS system. The efficiency of presentnavigation system is not high and occupies a great memory. With the two level indexon data organization system, the performance of the navigation system is improvedand it can be used onveniently.