Balancing traffic flow in the congested mass self-evacuation dynamic network under tight preparation budget: An Australian bushfire practice

被引:13
作者
Afkham, Maryam [1 ]
Ramezanian, Reza [1 ]
Shahparvari, Shahrooz [2 ]
机构
[1] KN Toosi Univ Technol, Dept Ind Engn, Tehran, Iran
[2] RMIT Univ, Sch Accounting Informat Syst & Supply Chain, Melbourne, Vic, Australia
来源
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE | 2022年 / 111卷
关键词
OR in disaster relief; Bushfire; Mass self-evacuation; Traffic flow; Congestion; Emergency budget; Bi-level programming; Benders decomposition; EMERGENCY EVACUATION; BENDERS DECOMPOSITION; DESIGN PROBLEM; MODEL; OPTIMIZATION; ALGORITHMS; CAPACITY; BRANCH;
D O I
10.1016/j.omega.2022.102658
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Disaster preparation budget plays a key role in the success of an emergency response operation. This research presents a novel bi-level model for mass self-evacuation discrete network design problems to find the best balance between the preparation budget and evacuation congestion. In this model, the im-portance of including non-compliance behavior in evacuation is considered. The proposed model aims to design an evacuation network with the smoothest traffic flow by using the maximum capacity of a dynamic transportation network where a number of roads become inaccessible as the bushfire spreads. The output of this research aids the emergency authorities to decide the best roads and shelters to equip in the evacuation process considering the access orders of the roads. The proposed approach covers the last four key phases of the entire evacuation process. Benders Decomposition and heuristics accelerators have been employed to help generate the outputs in less computational time for large-scale instances. The model and the solution approach have been validated through numerical experiments in different sizes. In addition, the model has been tested on the real case of the Churchill bushfire, Victoria. The re-sults show that altering a number of factors such as budget and the number of allowable shelters will significantly reduce the overall evacuation time and makes the roads less congested. A sensitivity analysis is also conducted which demonstrates that it is possible to reduce traffic congestion without raising the budget. (c) 2022 Elsevier Ltd. All rights reserved.
引用
收藏
页数:22
相关论文
共 57 条
  • [1] Aarthi V, 2020, INT J ENG APPL SCI T, V04, P196, DOI [10.33564/ijeast.2020.v04i10.037, DOI 10.33564/IJEAST.2020.V04I10.037]
  • [2] ABS, 2011, Labour force Australia
  • [3] Bi-level optimization for risk-based regional hurricane evacuation planning
    Apivatanagul, Pruttipong
    Davidson, Rachel A.
    Nozick, Linda K.
    [J]. NATURAL HAZARDS, 2012, 60 (02) : 567 - 588
  • [4] Apostol T., 1974, MATH ANAL, V2nd edn
  • [5] BARD J, 1998, PRACTICAL BILEVEL OP
  • [6] A BRANCH AND BOUND ALGORITHM FOR THE BILEVEL PROGRAMMING PROBLEM
    BARD, JF
    MOORE, JT
    [J]. SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING, 1990, 11 (02): : 281 - 292
  • [7] A two stage stochastic programming for asset protection routing and a solution algorithm based on the Progressive Hedging algorithm
    Bashiri, Mahdi
    Nikzad, Erfaneh
    Eberhard, Andrew
    Hearne, John
    Oliveira, Fabricio
    [J]. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2021, 104
  • [8] Shelter Location and Evacuation Route Assignment Under Uncertainty: A Benders Decomposition Approach
    Bayram, Vedat
    Yaman, Hande
    [J]. TRANSPORTATION SCIENCE, 2018, 52 (02) : 416 - 436
  • [9] COMPUTATIONAL DIFFICULTIES OF BILEVEL LINEAR-PROGRAMMING
    BENAYED, O
    BLAIR, CE
    [J]. OPERATIONS RESEARCH, 1990, 38 (03) : 556 - 560
  • [10] Partitioning procedures for solving mixed-variables programming problems
    Benders, J. F.
    [J]. COMPUTATIONAL MANAGEMENT SCIENCE, 2005, 2 (01) : 3 - 19