Research And Implementation Of Guard Route Planning In GIS

Finding reasonable and satisfactory route under various applications is a key research topic in the traffic management system. Guard route planning aims at finding optimal routes in a kind of particular situation. The Guard Route is defined as a route for somebody under the protection of guards or army. To safeguard somebody, the route should be decided in advance. According to this feature of the guard route, we study key techniques of fast finding K-shortest guard routes, and realize some functions of GIS.In this paper, we introduce the background knowledge of the development of GIS, and have a conclusion about the applications of GIS in the municipal traffic management system. Then we compare the effectiveness of Dijkstra algorithm and A* algorithm. Based on the characteristics of the guard route and road network in the traffic management system, we focus on the key techniques of K-shortest path. Due to the safeguard, the driving speed and distance should be balanced well. Moreover, the algorithm should be executed at the efficient running time. Our planning merges with multiple optimal strategies, and builds a two-level road network. In addition, we utilize reasonable heuristic function, Based on A* algorithm, a fast route planning is proposed.MapObjects, the GIS component of ESRI Company, is chosen as our software platform. We chose Visual Basic 6.0 to construct the topology of our road network, and realize the algorithm of K-shortest path planning. Compared with classical Dijkstra algorithm by our experimental results, the effectiveness and efficiency of our system is satisfactory in terms of the need of the guard route.