• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Annual Conference and Expo of the Institute of Industrial Engineers >Ambulance dispatching driven by parallelism, myopia, and no-reservation
【24h】

Ambulance dispatching driven by parallelism, myopia, and no-reservation

机译：由平行，近视和无预约驱动的救护车调度

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In emergency medical service, dispatching the closest ambulance has been a common practice. However, though dispatching the closest unit achieves the minimal response time to the current call, the response times for the next incoming calls may increase if the area where the closest one is currently located has a high call rate, i.e. the area becomes ill-prepared. Accordingly two preparedness-based ambulance dispatching algorithms have been recently proposed in literature. However, we have observed that all these algorithms perform much worse than upper bound performance of being optimal. In this research, we devise three design principles of ambulance dispatching algorithm: parallelism, myopia, and no-reservation. These principles lead to a novel ambulance dispatching algorithm that significantly enhances the performance of the existing ones.
机译：在紧急医疗服务中，调度最接近的救护车一直是一个常见的做法。 然而，虽然调度最接近的单位实现了对当前呼叫的最小响应时间，但是，如果最接近的区域所在的区域具有高通话率，则下次来电的响应时间可能会增加，即该区域变得不成熟 。 因此，最近在文献中提出了两种基于准备的救护车调度算法。 但是，我们已经观察到所有这些算法比最佳性能更差。 在这项研究中，我们设计了三种设计原则的救护车调度算法：平行，近视和无预约。 这些原则导致新颖的救护车调度算法，显着提高了现有的性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号