01515002

Component

Allocating moveable response resources dynamically enables evacuation management agencies to improve evacuation system performance in both the spatial and temporal dimensions. This study proposes a mixed integer linear program (MILP) model to address the dynamic resource allocation problem for transportation evacuation planning and operations. To enable realism in practice, the proposed model includes spatio-temporal constraints related to the time required to reallocate resources to another location, the minimum time allocated resources should be at a location, and the minimum time gap between successive allocations of resources to a location. The proposed model is transformed into a two-stage optimization program for which a greedy-type heuristic algorithm is developed to solve the MILP approximately but efficiently. Results from computational experiments demonstrate the effectiveness of the proposed model and the efficiency of the heuristic solution algorithm.

This paper was sponsored by TRB committee ANB80T Emergency Evacuation.

01503729

14-1822

English

23p

2014

Transportation Research Board 93rd Annual Meeting

Digital/other

Figures; References; Tables

Algorithms; Evacuation; Heuristic methods; Mixed integer programming; Optimization; Resource allocation; Time windows

Highways; Planning and Forecasting; Public Transportation; Security and Emergencies; I72: Traffic and Transport Planning

Transportation Research Board Annual Meeting 2014 Paper #14-1822

TRIS, TRB, ATRI

Jan 27 2014 2:39PM