基于ArcGIS和Dijkstra算法的疏散路径优化选择

Study on the Selection of Optimal Evacuation Route Based on ArcGIS and Dijkstra Algorithm

在应对紧急情况时,高效的疏散路径规划至关重要。为了积极应对水库溃坝风险,从受灾区到安全区预先为居民规划最优逃生路径具有重要的现实意义。文章基于ArcGIS在地理空间数据处理和分析方面的强大功能,以及Dijkstra算法在寻找最短路径上的原理和优势,探讨了如何将数据与Dijkstra算法相结合,以实现疏散路径的优化计算。考虑到灾害等级不同对路网的破坏程度不同,文章将路网的破坏程度划分为轻度、中度和重度3个等级,路段通行时间离散成基于灾害等级的随机变量。为了避免拥堵,将路面宽度刻画为路段通行能力作为约束,以最小通行时间为目标函数建立疏散路径优化模型,设计改进的Dijkstra算法求解模型。将该模型算法应用于福建省新罗区水库下游居民区的结果表明,该算法能够快速找到高质量解。

Efficient evacuation path planning is crucial in responding to emergencies.It is of great practical significance to plan optimal evacuation route in advance from disaster area to the safe zone in order to cope with reservoir dam failure.Hence,the thesis aims to explore how to combine data with Dijkstra algorithm to calculate optimal evacuation routes relying on the powerful functions of ArcGIS in geospatial data processing and analysis,as well as the advantages of Dijkstra algorithm in finding the shortest path.Considering that different disasters levels exert varying damages to the road network,the article divides the damages into three levels:mild,moderate,and severe.The travel time of road sections is discretized into random variables based on disaster levels.In order to avoid congestion,the road width is characterized as the capacity of the road section,and a path optimization model is established with the minimum travel time as the objective function.An improved Dijkstra algorithm is used to solve the model.Finally,the application of the algorithm to the residential areas downstream of the reservoir in Xinluo District,Fujian Province shows that it can find efficient solutions quickly.