软件导刊2023，Vol.22Issue(12)：111-116,6.DOI:10.11907/rjdk.222400
基于Bellman原理的人员密集场所疏散路径优化研究
Evacuation Route Optimization of Crowded Places with Multiple Decision Nodes Based on the Bellman Principle
摘要
Abstract
There are multiple evacuation paths in densely populated areas with multiple decision points.Reasonable planning of evacuation paths can avoid long-term local congestion and reduce the probability of stampede accidents.The local fastest algorithm of the personnel emer-gency evacuation simulation engineering software Pathfinder cannot solve the problem of uneven path utilization in multi-step decision-mak-ing places.Therefore,a path optimization method with the goal of minimizing the total evacuation time is proposed.A feasible path model and path optimization model are constructed based on decision points,and the optimization model is solved based on the Bellman principle to ob-tain the optimal path plan.According to this plan,the evacuation process is deduced,and the optimal path is updated until no better path ap-pears multiple times,ultimately determining the optimal path and its evacuation time.Taking the evacuation of a student apartment as an exam-ple to demonstrate the optimization effect of this scheme,the results show that compared with the Pathfinder simulation results,the total evacu-ation time of this method is reduced from 330.3 seconds to 292.3 seconds,the utilization time difference of the first floor staircase exits on the east and west sides is reduced from 75 seconds to 1.5 seconds,and the number of people passing through is reduced from 138 to 0 people.This path optimization method can be used to improve evacuation simulation software.关键词
人员密集场所/多决策点/疏散路径优化/Bellman原理/PathfinderKey words
crowded places/multi-decision nodes/evacuation path optimization/Bellman principle/Pathfinder分类
信息技术与安全科学引用本文复制引用
王勇,李肖肖,邹成祥,李亚萍..基于Bellman原理的人员密集场所疏散路径优化研究[J].软件导刊,2023,22(12):111-116,6.基金项目
国家自然科学基金项目(51306097,51874213) （51306097,51874213）
湖北省教育厅科学研究计划项目(B2021012) （B2021012）
