摘要：

针对风暴潮系统需要计算受灾区域到多个安置点的最短路径，并根据受灾人数和安置点的容量进行人员撤离的情况，提出对Dijkstra算法的改进方案，其中包括最短路径排序和多目标撤离。采用Matlab进行仿真。实验结果表明，对算法的改进是有效可行的，能够使多目标撤离路径的计算次数由多次减少到一次。

关键词: 风暴潮系统, ijkstra算法, 最短路径, 撤离

Abstract:

In allusion to the storm surge system’s requirement: it is necessary to figure out the shortest path from the disaster area to multi-settlements, then to evacuate the victims based on the number of disaster victims and the capacity of the settlements, this paper presents two improvements of Dijkstra algorithm, including sorting the shortest paths and evacuating to multitargets. An emulation is carried out based on Matlab, and it turns out that the improvement of the algorithm is effective and feasible, which can reduce the times of figuring out the path of evacuating to multitargets from several to one.

Key words: storm surge system, Dijkstra algorithm, the shortest path, evacuation

中图分类号: 

• N945