Bi-objective evacuation problem in ships or buildings

被引:4
作者
Lai, Xiaofan [1 ]
Ng, Chi To [2 ]
Wan, Chung Lai Johnny [2 ]
机构
[1] Shenzhen Univ, Coll Management, Inst Big Data Intelligent Management & Decis, Shenzhen 518060, Peoples R China
[2] Hong Kong Polytech Univ, Dept Logist & Maritime Studies, Logist Res Ctr, Hung Hom,Kowloon, Hong Kong, Peoples R China
基金
中国国家自然科学基金;
关键词
evacuation problem; bi-objective programming; multi-commodity; network flows; PATH NETWORKS; RISK; VALIDATION; FLOWS; MODEL;
D O I
10.1504/IJSTL.2022.120678
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper, we introduce an evacuation problem that involves several real-world evacuation elements, such as different types of evacuees and different types of exits, applicable to the evacuation of buildings or ships in emergency, e.g., fire. In particular, we exploit the multiple commodity flow in a time-expanded network to model the evacuation routes for different commodities. The commodities characterise the different types of evacuee groups which have different speeds during evacuation. We use the bi-objective programming to consider two different objectives of the evacuation planning from both time and space dimensions. Then we propose a method to solve this newly developed evacuation model. Based on a series of computational experiments and sensitivity analyses, we find that the evacuation speed of evacuees is a critical element to be considered when planning an evacuation on ships or buildings in emergency.
引用
收藏
页码:172 / 192
页数:21
相关论文
共 36 条
[1]   Modelling and finding optimal evacuation strategy for tall buildings [J].
Aleksandrov, Mitko ;
Cheng, Cheng ;
Rajabifard, Abbas ;
Kalantari, Mohsen .
SAFETY SCIENCE, 2019, 115 :247-255
[2]  
Associated Press, 2016, CRUIS SHIP FIR FORC
[3]  
Bayram Vedat, 2016, Surveys in Operations Research and Management Science, V21, P63, DOI [10.1016/j.sorms.2016.11.001, 10.1016/j.sorms.2016.11.001]
[4]  
Cao XH, 2019, INT J SHIP TRANS LOG, V11, P1
[5]   The building evacuation problem with shared information [J].
Chen, Lichun ;
Miller-Hooks, Elise .
NAVAL RESEARCH LOGISTICS, 2008, 55 (04) :363-376
[6]   MODELING OF BUILDING EVACUATION PROBLEMS BY NETWORK FLOWS WITH SIDE CONSTRAINTS [J].
CHOI, W ;
HAMACHER, HW ;
TUFEKCI, S .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1988, 35 (01) :98-110
[7]   A network flow model for lane-based evacuation routing [J].
Cova, TJ ;
Johnson, JP .
TRANSPORTATION RESEARCH PART A-POLICY AND PRACTICE, 2003, 37 (07) :579-604
[8]   A SURVEY ON MODELS AND ALGORITHMS FOR DISCRETE EVACUATION PLANNING NETWORK PROBLEMS [J].
Dhamala, Tanka Nath .
JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2015, 11 (01) :265-289
[9]   Building-evacuation-route planning via time-expanded process-network synthesis [J].
Garcia-Ojeda, J. C. ;
Bertok, B. ;
Friedler, F. ;
Fan, L. T. .
FIRE SAFETY JOURNAL, 2013, 61 :338-347
[10]  
Hamacher H.W., 2000, P PED EV DYN SPRING