• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Service Systems and Service Management >The Stochastic Home Health Care Routing Problem in Dense Communities with Multi-Appointment
【24h】

The Stochastic Home Health Care Routing Problem in Dense Communities with Multi-Appointment

机译：多人密集社区中的随机家庭医疗保健路由问题

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

摘要

The Stochastic Home Health Care Scheduling and Routing Problem refers to a decision process that allocates a group of nurses to a group of elders, with considerations of both stochastic and deterministic constraints. This paper studies the SHHCSRP in dense communities, where traveling distance is shortened and waiting cost is possibly higher. Other constraints considered in this paper include multi-appointment, mixed time window and skill-demand matching. A chance constrained programming model is built to formulate the problem, and a heuristic based on the Best-Worst Ant Colony Optimization is developed to solve it. A medium scale instance is experimented, and it turns out that, 1) sequences of nurses have a significant impact on the solution, 2) waiting limitation should be well-adjusted to balance the waiting time and total workload.
机译：随机家庭保健计划和路由问题是指在考虑随机和确定性约束的情况下，将一组护士分配给一组长者的决策过程。本文研究了人口稠密的社区中的SHHCSRP，这些社区的出行距离缩短且等待成本可能更高。本文考虑的其他约束包括多重任命，混合时间窗口和技能需求匹配。建立了机会约束编程模型来表达该问题，并开发了基于最佳最坏蚁群优化算法的启发式算法来解决该问题。通过对一个中等规模的实例进行实验，结果表明：1）护士的顺序对解决方案有重大影响; 2）应该适当调整等待限制，以平衡等待时间和总工作量。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号