基于改进Dijkstra的应急指挥车及时救援的最短路径算法的研究

Study on the Shortest Path Algorithm of Emergency Command Vehicle Timely Rescue Based on Dijkstra Algorithm Optimization

随着人们自驾出游的频率逐步提高,城市交通拥挤堵塞的情况时常出现,给应急指挥车的救援带来诸多不便,为使应急指挥车能够机动灵活地深入城市各个角落,及时有效解决各类突发事故,通过Arc Map以城市交通道路为源构建了网络数据集,将城市交通道路网抽象为图的结构,使用邻接表以及二叉排序树结构对传统Dijkstra算法进行了改进,并基于改进后的Dijkstra算法,采用Arc GIS Engine、Visual Studio等工具开发了应急指挥车最短路径规划软件,实现了应急指挥车最短路径的规划。

As people gradually increase the frequency, drive travel city traffic jam often appear, to bring inconvenience, emergency command vehicle rescue emergency command vehicle can be flexible in order to make into all corners of the city, the timely and effective to solve all kinds of accidents, by ArcMap for urban traffic source network data set is constructed, the urban traffic road network abstraction for figure structure, using adjacency list and binary sort tree structure of the traditional Dijkstra algorithm is optimized, and the Dijkstra algorithm based on the optimized, The shortest path planning software of emergency command vehicle is developed by using ArcGIS Engine, Visual Studio and other tools, and the shortest path planning of emergency command vehicle is realized.