首页> 外文会议>International Conference on Information and Communication Technologies for Disaster Management >Priority-Index Based Multi-Priority Relief Logistics Scheduling with Greedy Heuristic Search
【24h】

Priority-Index Based Multi-Priority Relief Logistics Scheduling with Greedy Heuristic Search

机译:基于优先级索引的多优先级救济物流调度与贪婪启发式搜索

获取原文

摘要

Spontaneous response after any kind of disaster is essential to rescue victims at the disaster-affected regions. Efficient and effective relief logistics scheduling is crucial to reduce the disaster impact on the people in the affected areas. Such scheduling plan remains challenging in the field of relief logistics and related study areas because of the constraints such as time, cost, priorities and limited resources. Also, the nature of requirements of victims changes dynamically that makes the scheduling task more challenging. This leads to formulate a distinctive relief logistics scheduling covering disaster regions requirement and priorities. With the limited availability of the vehicles, the scheduling needs to be planned in iterative manner with the multiple time slots based on the availability of the vehicles. A greedy heuristic with priority based search generates the optimal set of scheduling sequences in the iterative time-slot scenarios. Covering priority aspect gives an effective alternative for the rational scheduling of the relief logistics. In this paper, we focus especially on an optimal weighted priority relief logistics scheduling model based on different priorities with least dependency on the choice of scheduling sequence. The resulting model is appropriate for relief logistics scheduling in the early phase of disaster response. The simulated result shows that the weighted priority relief logistics scheduling model generates comparatively better scheduling schedule in comparison with sequences generated by applying the priorities individually.
机译:任何类型的灾难发生后的自发反应对于灾害影响的地区拯救受害者至关重要。高效且有效的救济物流调度至关重要,以减少对受影响地区人民的灾害影响。由于时间,成本,优先事项和有限的资源,这种调度计划在救济物流和相关研究领域仍然具有挑战性。此外,受害者要求的性质动态变化,使调度任务更具挑战性。这导致涵盖灾区要求和优先事项的独特浮雕物流调度。利用车辆的可用性有限,需要以基于车辆的可用性,以迭代方式以迭代方式计划。具有基于优先级的搜索的贪婪启发式在迭代时隙方案中生成最佳的调度序列集。覆盖优先权方面为救济物流的合理调度提供了有效的替代方案。在本文中,我们专注于基于不同优先级的最佳加权优先释放物流调度模型,其具有最不依赖于调度序列的选择。由此产生的模型适用于灾害响应早期阶段的浮雕物流调度。模拟结果表明,加权优先释放物流调度模型与通过单独应用优先级生成的序列相比生成相对更好的调度计划。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号