...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>EURO journal of transportation and logistics >A pickup and delivery problem using crossdocks and truckload lane rates
【24h】

A pickup and delivery problem using crossdocks and truckload lane rates

机译：使用跨码头和卡车装卸率的取件和运送问题

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

摘要

This paper presents solution approaches for a shipper pickup and delivery planning problem to move freight from suppliers to distribution centers. Each shipment is moved either direct via a less-than-truckload (LTL) carrier, or possibly consolidated with other shipments and moved by one or two truckload (FTL) routes. When using a FTL carrier, the shipper takes advantage of contracted lane rates that establish prices per mile for a truck operated between two locations that are significantly less than the comparable LTL price for shipping a full truckload. The challenge for the shipper is to consolidate multiple shipments effectively to take advantage of this price differential. Consolidated FTL routes may each visit multiple shipment origins (supplier locations) and/or destinations (distribution center locations). Additionally, FTL routes may move shipments through a single crossdock facility en route. A path-based integer programming model for this planning problem is presented. The model can be solved directly with commercial integer programming software for smaller instances. For larger instances, a search scheme is developed in which restrictions to the integer program are solved sequentially. A computational study using data from a major US retailer demonstrates the effectiveness of the solution approaches. In each instance, substantial transportation cost savings are identified from baseline LTL costs.
机译：本文提出了针对托运人取货和交付计划问题的解决方案，以将货物从供应商转移到配送中心。每批货物要么通过零担运输（LTL）承运人直接运输，要么可能与其他货物合并，然后通过一两个卡车运输（FTL）路线运输。使用FTL承运商时，托运人利用合同规定的车道费率确定了在两个地点之间行驶的卡车的每英里价格，该价格大大低于运送整车货物的可比LTL价格。托运人面临的挑战是有效地合并多批货物，以利用这一价格差异。合并的FTL路线可能每个都访问多个装运起点（供应商位置）和/或目的地（配送中心位置）。此外，FTL航线可能会将货物运送通过单个交叉坞站设施。提出了针对该规划问题的基于路径的整数规划模型。对于较小的实例，可以使用商业整数编程软件直接求解该模型。对于较大的实例，开发了一种搜索方案，其中依次解决了对整数程序的限制。使用来自美国一家主要零售商的数据进行的计算研究证明了该解决方案方法的有效性。在每种情况下，从基准零担费用中可以节省大量的运输成本。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号