A Generalized Minimum Cost Flow Model for Multiple Emergency Flow Routing

• Published in: Mathematical problems in engineering Vol. 2014; no. 1
• Main Authors: Cui, Jianxun, An, Shi, Zhao, Meng
• Format: Journal Article
• Language: English
• Published: New York Hindawi Publishing Corporation 01.01.2014; John Wiley & Sons, Inc
• Subjects: Disasters; Emergency procedures; Evacuation; Evacuations & rescues; Mathematical models; Mathematical problems; Minimum cost; Mixed integer; Networks; Nonlinear programming; Nuclear accidents & safety; Redesign; Roads; Routing; Seismic phenomena; Travel time; Vehicles; Windows (intervals)
• ISSN: 1024-123X; 1026-7077; 1563-5147; 1563-5147
• DOI: 10.1155/2014/832053

During real-life disasters, that is, earthquakes, floods, terrorist attacks, and other unexpected events, emergency evacuation and rescue are two primary operations that can save the lives and property of the affected population. It is unavoidable that evacuation flow and rescue flow will conflict with each other on the same spatial road network and within the same time window. Therefore, we propose a novel generalized minimum cost flow model to optimize the distribution pattern of these two types of flow on the same network by introducing the conflict cost. The travel time on each link is assumed to be subject to a bureau of public road (BPR) function rather than a fixed cost. Additionally, we integrate contraflow operations into this model to redesign the network shared by those two types of flow. A nonconvex mixed-integer nonlinear programming model with bilinear, fractional, and power components is constructed, and GAMS/BARON is used to solve this programming model. A case study is conducted in the downtown area of Harbin city in China to verify the efficiency of proposed model, and several helpful findings and managerial insights are also presented.