China Safety Science Journal ›› 2025, Vol. 35 ›› Issue (3): 187-193.doi: 10.16265/j.cnki.issn1003-3033.2025.03.1994

• Public safety • Previous Articles     Next Articles

Mathematical model of single-source multi-destinations evacuation and optimization of emergency exits

ZHOU Lingchang(), LIANG Yin, LAI Yanping   

  1. School of Energy and Safety Engineering, Tianjin Chengjian University, Tianjin 300384, China
  • Received:2024-10-15 Revised:2024-12-17 Online:2025-03-28 Published:2025-09-28

Abstract:

In order to improve the evacuation efficiency of public buildings and reduce casualties caused by emergencies, in view of the optimization problems of emergency exits and evacuation plans, a mathematical model and algorithm for the single-source multi-sink evacuation problem were proposed. Firstly, all evacuation paths were identified using path algorithm and sorted based on evacuation time. Then, the recursive formula for calculating evacuation time was derived based on the User Equilibrium (UE) principle and k-shortest path. The capacity allocation issues of each evacuation path at intersections were analyzed. After that then the optimization strategy for emergency exits is obtained. Finally, taking a building as an example, the evacuation network was established and calculated to validate the effectiveness of the algorithm and optimization strategy. The results show that the evacuation efficiency of the building network increases gradually with the increase in the number of evacuees, and the rate of change stabilizes after reaching a certain threshold value, Evacuation efficiency is closely associated with the total traffic capacity of specific emergency exits. Through the optimization of specific emergency exits, the evacuation efficiency of the network is enhanced, evacuation time can be reduced, and the optimization effect becomes more pronounced as the number of evacuees increases.

Key words: single-source multi-destinations, emergency exit, evacuation model, User Equilibrium principle, path algorithm

CLC Number: