A Stochastic Programming Approach for Locating and Dispatching Two Types of Ambulances
提出两阶段随机规划模型，第一阶段确定两种救护车的选址，第二阶段根据急救呼叫场景调度车辆至不同优先级患者，并扩展至非运输车辆及随机旅行时间，通过案例和仿真验证模型效果。
Emergency Medical Service systems aim to respond to emergency calls in a timely manner and provide prehospital care to patients. This paper addresses the problem of locating multiple types of emergency vehicles to stations while taking into account that vehicles are dispatched to prioritized patients with different health needs. We propose a two-stage stochastic-programming model that determines how to locate two types of ambulances in the first stage and dispatch them to prioritized emergency patients in the second stage after call-arrival scenarios are disclosed. We demonstrate how the base model can be adapted to include nontransport vehicles. A model formulation generalizes the base model to consider probabilistic travel times and general utilities for dispatching ambulances to prioritized patients. We evaluate the benefit of the model using two case studies, a value of the stochastic solution approach, and a simulation analysis. The case study is extended to study how to locate vehicles in the model extension with nontransport vehicles. Stochastic-programming models are computationally challenging for large-scale problem instances, and, therefore, we propose a solution technique based on Benders cuts.