Volume 31, Issue 2 (IJIEPR 2020)                   IJIEPR 2020, 31(2): 259-267 | Back to browse issues page

XML Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Ramezanian R, Afkham M. A bi-level programing for wildfire self-evacuation network design. IJIEPR 2020; 31 (2) :259-267
URL: http://ijiepr.iust.ac.ir/article-1-1054-en.html
1- Department of Industrial Engineering, K. N. Toosi University of Technology (KNTU), Tehran, Iran. , ramezanian@kntu.ac.ir
2- K. N. Toosi University of Technology (KNTU)
Abstract:   (3013 Views)
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.
Full-Text [PDF 813 kb]   (2464 Downloads)    
Type of Study: Research | Subject: Operations Research
Received: 2020/04/18 | Accepted: 2020/04/18 | Published: 2020/06/27

Add your comments about this article : Your username or Email:

Send email to the article author

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.