...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Promet-traffic & transportation >A SCHEDULING STRATEGY OF MOBILE PARCEL LOCKERS FOR THE LAST MILE DELIVERY PROBLEM
【24h】

A SCHEDULING STRATEGY OF MOBILE PARCEL LOCKERS FOR THE LAST MILE DELIVERY PROBLEM

机译：最后一英里交付问题的移动包储物柜的调度策略

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In the form of unattended Collection-and-Delivery Points (CDP), the fixed parcel lockers can save courier miles and improve the delivery efficiency. However, due to the fixed location and combination, the fixed parcel locker cannot accommodate the change of demands effectively. In this paper, an approach to supplementing fixed lockers by mobile parcel lockers to meet the demands of the last mile delivery has been proposed. With the goal of minimizing the operating cost, the location and route optimization problems of mobile parcel lockers are integrated into a non-linear integer programming model. An embedded GA has been developed to optimally determine the locations of distribution points, the number of mobile parcel lockers needed by each distribution point and the schedules and routes of mobile parcel lockers, simultaneously. Finally, a numerical example is given to compare the optimization results of the schemes with and without the aggregation problem. The results show that the scheme with the aggregation problem can greatly save the delivery time. However, for the scheme without the aggregation problem, time windows are more continuous, so it saves the number of vehicles.
机译：以无人值守的收集和交付点（CDP）的形式，固定包裹储物柜可以节省快递里程并提高输送效率。但是，由于固定的位置和组合，固定的包裹储物柜无法有效适应需求的变化。在本文中，提出了一种通过移动包储物柜补充固定储物柜来满足最后一英里交付需求的方法。通过最小化运营成本的目标，移动包裹储物柜的位置和路由优化问题集成到非线性整数编程模型中。已经开发了一个嵌入的GA，以最佳地确定分发点的位置，每个分发点以及移动包裹储物柜的时间表和路由所需的移动包储物柜的数量。最后，给出了一个数值示例来比较方案的优化结果，并且没有聚合问题。结果表明，具有聚合问题的方案可以大大节省交货时间。但是，对于没有聚合问题的方案，时间窗口更加连续，因此它可以节省车辆的数量。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号