چكيده به لاتين
Abstract:
The ability to evacuate a struck region quickly is a crucial issue dealing with saving lives of inhabitants of that area. Disasters, either man-made or natural, may occur in an at-risk region in any instant and hence, there should be a preparation and a predetermined plan to encounter the catastrophic situation. To deal with this issue, in this research, a mathematical mixed-integer programming model in a dynamic environment is proposed minimizing the total time of evacuation in a region. Routing and allocating of population to the shelters are other functions of this model. Capacity constraints are embedded and modeled in a robust way so that with violation of the average of capacity values, the optimum solution is still feasible. Emergency relief facilities are also located and routed in this work. The proposed model is implemented upon Iran University of Science and Technology campus data. The results obtained by the accelerated Benders Decomposition Algorithm demonstrate the efficiency of this model in tackling with large-sized problems and minimizing the evacuation time along with indicating the population information in each node per period. To validate this model, sensitivity analysis is done upon parameters and the results prove this model valid with various data.
Keywords: Emergency evacuation, Routing, Allocating, Locating, Robust Optimization, Benders Decomposition Algorithm
