基于优化方法的区域疏散路径规划研究

Study of area evacuation paths plan based on optimization methods

由于各种灾害的频频发生,对于区域整体及局部的疏散规划方案的研究具有迫切性和必要性。基于传统的迪杰斯特拉算法和回溯法的思想,对矩阵化的地图信息进行处理和计算,得到满足最大疏散人数、总体最短疏散路径、最短疏散时间等优化条件的优化方案。最后将这种方法运用到实际中,得出了某大学校区的路径选择方案。

Nowadays, more and more disasters occur frequently, so it is of vital urgency and necessity to make the overall and partial region evacuation planning. Based on the traditional Diikstra algorithm and backtracking algorithms, we processed and calculated the matrix of map information. By the method, we obtained three optimization schemes of maximum evacuation population, minimum evacuation paths in total, and minimum evacuation time. Finally, this method was applied in a university, thereby the routing schemes of were obtained.