首页> 外文期刊>The International Journal of Advanced Manufacturing Technology >A dynamic multi-objective location-routing model for relief logistic planning under uncertainty on demand, travel time, and cost parameters
【24h】

A dynamic multi-objective location-routing model for relief logistic planning under uncertainty on demand, travel time, and cost parameters

机译:不确定下需求,旅行时间和成本参数下释放物流规划的动态多目标定位路由模型

获取原文
获取原文并翻译 | 示例
           

摘要

Managers recognize that a strong relation prevails between the location of facilities; the allocation of suppliers, vehicles, and customers to the facilities; and in the design of routes around the facilities. To integrate strategic, tactical, and operational decisions, a multi-objective dynamic stochastic programming model is proposed for a humanitarian relief logistics problem where decisions are reached for pre- and post-disaster. The model features three objectives: minimizing the maximum amount of shortages among the affected areas in all periods, the total travel time, and sum pre- and post-disaster costs. The first objective pursues fairness-expending the best effort to ensure relief commodity delivery to all demand points-whereas the two other objectives pursue the efficiency goal. The proposed model is solved as a single-objective mixed-integer programming model applying the epsilon-constraint method. A case study is presented to illustrate the potential applicability of our model for disaster planning of earthquake scenarios in the megacity of Tehran. The findings demonstrate that the proposed model can benefit making decisions on facility location, resource allocation, and routing decisions in cases of disaster relief efforts.
机译:管理人员认识到设施位置之间存在强有力的关系;供应商,车辆和客户的分配到设施;在设施周围的路线设计中。为了整合战略,战术和运营决策,提出了一种多目标动态随机编程模型,用于人道主义救济物流问题,达到灾后和后期的决定。该模型具有三个目标:最小化所有时期受影响区域之间的最大短缺数量,总旅行时间和累计的预期和灾后成本。第一个目标追求公平性,以确保救济商品交付给所有需求点的最佳努力 - 而另外两项目标追求效率目标。所提出的模型作为应用epsilon-约束方法的单目标混合整数编程模型解决。提出了一个案例研究以说明我们在德黑兰巨大的地震场景灾害模式的潜在适用性。这些研究结果表明,在救灾工作的情况下,拟议的模型可以使设施位置,资源分配和路由决策作出决策。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号