In this thesis, we propose novel optimization and spatial queueing models that expand the currently existing methods by allowing multiple servers to be located at the same station and multiple servers to be dispatched to a single call. In particular, a mixed integer linear programming (MILP) model is introduced that determines how to locate and dispatch ambulances such that the coverage level is maximized. The model allows multiple servers to be located at the same station and balances the workload among them while maintaining contiguous first priority response districts. We also propose an extension to the approximate Hypercube queueing model by allowing multi-server dispatches. Computational results suggest that both models are effective in optimizing and analyzing the emergency systems. We also introduce the M[G]/M/s/s queueing model as an extension to the M/M/s/s model which allows for multiple servers to be assigned to a single customer.
展开▼
机译：在本文中，我们提出了新颖的优化和空间排队模型，该模型通过允许将多个服务器放置在同一站点并将多个服务器分配到单个呼叫来扩展当前存在的方法。特别是，引入了混合整数线性规划（MILP）模型，该模型确定如何定位和调度救护车，以使覆盖范围最大化。该模型允许将多个服务器放置在同一站点上，并在它们之间平衡工作负载，同时保持连续的优先级响应区域。通过允许多服务器分派，我们还提出了对近似Hypercube排队模型的扩展。计算结果表明，两种模型都可以有效地优化和分析应急系统。我们还引入了M [G] / M / s / s排队模型，作为M / M / s / s模型的扩展，该模型允许将多个服务器分配给单个客户。
展开▼
