CEPO-based Research on Evacuation Route for High-rise Building Fire

被引:0
|
作者
Zhang, Mingkong [1 ]
Hu, Xiaobing [1 ,2 ]
机构
[1] Beijing Normal Univ, Fac Geog Sci, Acad Disaster Reduct & Emergency Management, Beijing 100875, Peoples R China
[2] Civil Aviat Univ China, Coll Elect Informat & Automat, Tianjin 300300, Peoples R China
关键词
Co-evolutionary path optimization; Evacuation route; High-rise building fire; DYNAMIC ALGORITHMS; SHORTEST; OPTIMIZATION; TREES;
D O I
暂无
中图分类号
F [经济];
学科分类号
02 ;
摘要
The decision-making problem of evacuation route in high-rise building fire is actually the dynamic path optimization problem under fire spreading. Since DPO method can not guarantee the actual optimal path, increase unnecessary evacuation route and extend evacuation time under fire, improving ripple spreading algorithm to increase the number of successful evacuation in the safe evacuation time and achieve Co-evolutionary path optimization (CEPO), synchronizing the process of personal evacuation with the process of fire diffusion. Simulate evacuation process of high-rise building by fire dynamics simulator and evaluate the efficiency of DPO method and CEPO method. The result shows that the CEPO method can solve the above DPO problems through an off-line optimization, and greatly improve the efficiency of fire evacuation.
引用
收藏
页码:470 / 477
页数:8
相关论文
共 16 条
  • [1] DiNenno P.J., 2002, SFPE Handbook of Fire Protection Engineering, VThird
  • [2] Semidynamic algorithms for maintaining single-source shortest path trees
    Frigioni, D
    Marchetti-Spaccamela, A
    Nanni, U
    [J]. ALGORITHMICA, 1998, 22 (03) : 250 - 274
  • [3] Fully dynamic algorithms for maintaining shortest paths trees
    Frigioni, D
    Marchetti-Spaccamela, A
    Nanni, U
    [J]. JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2000, 34 (02): : 251 - 281
  • [4] Escape planning in realistic fire scenarios with Ant Colony Optimisation
    Goodwin, Morten
    Granmo, Ole-Christoffer
    Radianti, Jaziar
    [J]. APPLIED INTELLIGENCE, 2015, 42 (01) : 24 - 35
  • [5] Hu X. B., 2013, 2013 IEEE S SER COMP
  • [6] Deterministic Agent-Based Path Optimization by Mimicking the Spreading of Ripples
    Hu, Xiao-Bing
    Wang, Ming
    Leeson, Mark S.
    Di Paolo, Ezequiel A.
    Liu, Hao
    [J]. EVOLUTIONARY COMPUTATION, 2016, 24 (02) : 319 - 346
  • [7] A Ripple-Spreading Algorithm for the k Shortest Paths Problem
    Hu, Xiao-Bing
    Wang, Ming
    Hu, Xiao-Bing
    Leeson, Mark S.
    Hines, Evor L.
    Hu, Di
    Di Paolo, Ezequiel
    [J]. 2012 THIRD GLOBAL CONGRESS ON INTELLIGENT SYSTEMS (GCIS 2012), 2012, : 202 - 208
  • [8] Lakshay, 2016, Journal of Risk Analysis and Crisis Response, V6, P135, DOI [10.2991/jrarc.2016.6.3.3, DOI 10.2991/JRARC.2016.6.3.3]
  • [9] A game theory based exit selection model for evacuation
    Lo, S. M.
    Huang, H. C.
    Wang, P.
    Yuen, K. K.
    [J]. FIRE SAFETY JOURNAL, 2006, 41 (05) : 364 - 369
  • [10] New dynamic algorithms for shortest path tree computation
    Narváez, P
    Siu, KY
    Tzeng, HY
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2000, 8 (06) : 734 - 746