Citation

Park H, Waddell D, Haghani A. Transp. Res. C Emerg. Technol. 2019; 109: 95-116.

Copyright

(Copyright © 2019, Elsevier Publishing)

DOI

10.1016/j.trc.2019.09.016

PMID

unavailable

Abstract

Traditional emergency management studies have made resource allocation decisions to serve the current emergency without knowing which future emergency will be occurring. Different ordered combinations of emergencies result in different performance outcomes. Even though future events can be anticipated, previous studies follow an assumption that events over a time interval are independent. This study follows an assumption that events are interdependent, because speed reduction and rubbernecking due to an initial incident provoke secondary incidents on freeways and the resource availability depends on service times of each request. The misconception that secondary incidents are not common has resulted in overlooking a look-ahead concept. This study is the pioneer in relaxing the structural assumptions of independency during the assignment of servers and approaching the challenge from an operational perspective, online optimization. The main objective is to minimize the time needed to respond to a sequence of requests. We introduce online dispatching strategies with visualization applied in different network sizes, number of requests, and service times to provide insights on model behavior and solution quality. The experimental evidence indicates that the algorithm works well in practice. We envision a new era in which an optimal resource allocation adapts to external events effectively and anticipates the future learning from the past to produce effective solutions.

Language: en

Keywords

Emergency response; Nearest neighbor algorithm; Online optimization; Secondary incidents; Service time; Work function algorithm