An integrated shelter location and route planning approach for emergent evacuation in transportation networks

This paper presents an integrated shelter location and route allocation approach for the emergent evacuation problem with multiple sources and multiple shelters in city transportation networks. A mixed integer linear programming model is developed to formulate the problem, in which the overall evacuation time is minimized subject to capacity constraints on both shelters and roads. Dijkstra algorithm and A* algorithm are utilized to search the k^th shortest paths between each source and each shelter, and Cplex is used to solve the model. Based on the practical traffic networks of a provincial capital city in China, two cases are constructed: the first one consists of 84 nodes and 276 arcs, and the second one consists of 317 nodes and 1042 arcs. The proposed approach is illustrated by the two cases with practical capacities, and the computational results are reported and analyzed.