RT - Journal Article
T1 - A bi-level programing for wildfire self-evacuation network design
JF - IUST
YR - 2020
JO - IUST
VO - 31
IS - 2
UR - http://ijiepr.iust.ac.ir/article-1-1054-en.html
SP - 259
EP - 267
K1 - bi-level programing
K1 - wildfire self-evacuation
K1 - linear approximation
K1 - upper problem
K1 - lower problem
K1 - Mixed Integer Programing.
AB - A non-linear bi-level problem is suggested in this paper for wildfire self-evacuation planning, the upper problem of which includes binary variables and the lower problem includes continuous variables. In this model, the upper problem selects a number of links and adds them to the available evacuation network. It, moreover, predicts the traffic balance, and the time window of the links in the lower problem. A part of the objective function in the bi-level problem is non-linear which is linearized with a linear approximation method that does not require binary variables. Then the linear bi-level model is reformulated as a non- linear single level problem. This model is linearized and transferred into Mixed Integer Programing. The model is then used for the real case study of the Beechworth fire in 2009. The resulted outputs of the model are beneficial in planning design schemes for emergency evacuation to use the maximum potential of the available transportation network.
LA eng
UL http://ijiepr.iust.ac.ir/article-1-1054-en.html
M3 10.22068/ijiepr.31.2.259
ER -