Application of Improved Dijkstra Algorithm in Parking Guidance Information System

When using the traditional Dijkstra algorithm for path guiding,the problems of large base number of road net node,wide searching range.With these drawbacks,much time and space are consumed.So the efficiency and real-time quality of Parking Guide Information System(PGIS) are both reduced.To solve these problems,in the light of the specific environment of city road net and the requirements of path guiding,according to the basic principle,straight line makes the shortest distance between two points,this paper puts forward a rectangular searching range based,improved Dijkstra algorithm which is applicable to PGIS.This paper designs and implements the solutions of such problems as one-way road,no passing road and cross point time delay in city road network model.Experimental results show that the improved Dijkstra algorithm not only can reduce the searching range of road net nodes and computational complexity,but also can improve the real-time quality when users searching for the path.