基于城市应急指挥系统的最优路径算法

Algorithm of the Optimal Route Based on Urban Emergency Response System

城市应急指挥系统要求在事故发生时,计算出到出事地点的最佳路线的最短时间,其核心算法仍是最短路径算法.针对实际的城市道路网特点,对道路网络模型、道路拓扑结构和数据库结构进行构建.以优化的数据存储结构为切入点,在分析了经典的Dijkstra最短路径算法的计算速度瓶颈的基础上,提出了基于方向性的空间最优路径算法,使该算法具有更高的效率.

At the time of the accident,the urban emergency response system need to analyze the optimal route, which cost the least time to the scene. So the core algorithm is still the shortest path algorithm of it. According to the actual characteristics of the urban road network, the paper constructed model with the road network, road topology and database structure. With the optimized data storage structure as the entry point and the base of analyzing the computing speed bottlenecks of the classic Dijkstra shortest path algorithm,the paper proposes a more efficiency optimal path algorithm bases on the direction search.