Capacity Constrained Routing Algorithms for Evacuation Planning: A Summary of Results

Abstract. Evacuation planning is critical for numerous important applications, e.g. disaster emergency management and homeland defense preparation. Efficient tools are needed to produce evacuation plans that identify routes and schedules to evacuate affected populations to safety in the event of natural disasters or terrorist attacks. The existing linear programming approach uses time-expanded networks to compute the optimal evacuation plan and requires a user-provided upper bound on evacuation time. It suffers from high computational cost and may not scale up to large transportation networks in urban scenarios. In this paper we present a heuristic algorithm, namely Capacity Constrained Route Planner(CCRP), which produces sub-optimal solution for the evacuation planning problem. CCRP models capacity as a time series and uses a capacity constrained routing approach to incorporate route capacity constraints. It addresses the limitations of linear programming approach by using only the ...

• Type: Conference
• Year: 2005
• Where: SSD
• Authors: Qingsong Lu, Betsy George, Shashi Shekhar
• Keywords: Evacuation Plan, Evacuation Planning, Linear Programming Approach, SSD 2005