Evacuation route scheduling using discrete time-based Capacity-Constrained model

This paper addresses the problem of modeling evacuation scheduling out of an affected area. There are a pre-defined set of exit points out of the target affected area and a set of source points for the evacuees. We propose an optimization model for evacuation scheduling; this approach models the capacity-constrained evacuation scheduling problem over discrete time as an integer optimization model. A recent efficient heuristic for evacuation planning, Capacity-Constrained Route Planning (CCRP) algorithm is selected as a reference for comparison. The result on a sample problem shows that the proposed model is competitive with the CCRP heuristic in terms of the resulting evacuation time and evacuation routes and schedules.