TY - GEN
T1 - An efficient simulation-based approach to ambulance fleet allocation and dynamic redeployment
AU - Yue, Yisong
AU - Marla, Lavanya
AU - Krishnan, Ramayya
PY - 2012
Y1 - 2012
N2 - We present an efficient approach to ambulance fleet allocation and dynamic redeployment, where the goal is to position an entire fleet of ambulances to base locations to maximize the service level (or utility) of the Emergency Medical Services (EMS) system. We take a simulation-based approach, where the utility of an allocation is measured by directly simulating emergency requests. In both the static and dynamic settings, this modeling approach leads to an exponentially large action space (with respect to the number of ambulances). Futhermore, the utility of any particular allocation can only be measured via a seemingly "black box" simulator. Despite this complexity, we show that embedding our simulator within a simple and efficient greedy allocation algorithm produces good solutions. We derive data-driven performance guarantees which yield small optimality gap. Given its efficiency, we can repeatedly employ this approach in real-time for dynamic repositioning. We conduct simulation experiments based on real usage data of an EMS system from a large Asian city, and demonstrate significant improvement in the system's service levels using static allocations and redeployment policies discovered by our approach.
AB - We present an efficient approach to ambulance fleet allocation and dynamic redeployment, where the goal is to position an entire fleet of ambulances to base locations to maximize the service level (or utility) of the Emergency Medical Services (EMS) system. We take a simulation-based approach, where the utility of an allocation is measured by directly simulating emergency requests. In both the static and dynamic settings, this modeling approach leads to an exponentially large action space (with respect to the number of ambulances). Futhermore, the utility of any particular allocation can only be measured via a seemingly "black box" simulator. Despite this complexity, we show that embedding our simulator within a simple and efficient greedy allocation algorithm produces good solutions. We derive data-driven performance guarantees which yield small optimality gap. Given its efficiency, we can repeatedly employ this approach in real-time for dynamic repositioning. We conduct simulation experiments based on real usage data of an EMS system from a large Asian city, and demonstrate significant improvement in the system's service levels using static allocations and redeployment policies discovered by our approach.
UR - http://www.scopus.com/inward/record.url?scp=84868292896&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84868292896&partnerID=8YFLogxK
U2 - 10.1609/aaai.v26i1.8176
DO - 10.1609/aaai.v26i1.8176
M3 - Conference contribution
AN - SCOPUS:84868292896
SN - 9781577355687
T3 - Proceedings of the National Conference on Artificial Intelligence
SP - 398
EP - 405
BT - AAAI-12 / IAAI-12 - Proceedings of the 26th AAAI Conference on Artificial Intelligence and the 24th Innovative Applications of Artificial Intelligence Conference
PB - AI Access Foundation
T2 - 26th AAAI Conference on Artificial Intelligence and the 24th Innovative Applications of Artificial Intelligence Conference, AAAI-12 / IAAI-12
Y2 - 22 July 2012 through 26 July 2012
ER -