TY - JOUR ID - 71905 TI - An Algorithm for the Multi-Stage Stochastic Relief Routing Problem JO - Advances in Industrial Engineering JA - AIE LA - en SN - AU - Oladi, Sahar AU - Bashiri, Mahdi AU - Nikzad, Erfaneh AD - Department of Industrial Engineering, Shahed University AD - Department of Industrial Engineering, Shahed University, Tehran, Iran AD - Y1 - 2018 PY - 2018 VL - 52 IS - 3 SP - 325 EP - 336 KW - Disaster KW - Multi-stage Modeling KW - uncertainty KW - Search and Rescue KW - Routing DO - 10.22059/jieng.2019.236899.1398 N2 - There is usually uncertainty in the information during a disaster. These uncertainties are revealed in different stages during the time, but they still exist. Therefore, when information is appeared over the time, it is necessary to model and solve the problem in a multi-stage stochastic programming to make more real decisions. In this paper, a multi-stage relief routing model is presented for a disaster problem. It is assumed that the routing plan can be rerouted in each stage according to new received information. Also, an approximation algorithm is presented based on the two-stage stochastic programming. It is shown that the proposed algorithm is an appropriate approximation of the multi-stage model. Comparison of results with the deterministic model indicates that more survivors will be achieved by the proposed model comparing to the deterministic one and it shows effectiveness of the proposed approach. UR - https://aie.ut.ac.ir/article_71905.html L1 - https://aie.ut.ac.ir/article_71905_c9141ddb3631b46725bb66ea4f3067e3.pdf ER -