• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>COTA international conference of transportation professionals >The Truck Routing and Aircraft Assignment Problem with Time Windows
【24h】

The Truck Routing and Aircraft Assignment Problem with Time Windows

机译：带时间窗的卡车路线和飞机分配问题

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

摘要

Considering express services relying on point-to-point airfreight and ground networks, we introduce a two-echelon vehicle routing problem with capacity-matching constraints (2E-VRP-CM). The 2E-VRP-CM aims to determine aircraft flight legs and truck routes with overall minimized cost. In the 2E-VRP-CM, a heterogeneous fleet of trucks respond to customer requests. Cargoes are loaded onto assigned aircraft and transported between two airports. Once they reach the destination airport after the air transport, cargoes are assigned to trucks so as to reach the customer locations on time. At the airports, cargoes are transshipped between trucks and aircraft. The 2E-VRP-CM adopts capacity-matching constraints, and time window and synchronization constraints to model the routing problem of two-echelon networks. We develop the vehicle flow formulation and propose the random sequence algorithm followed by a variable neighborhood search. The computational experiments evaluate the effectiveness of the 2E-VRP-CM formulation and the applicability of the heuristic.
机译：考虑到依赖点对点空运和地面网络的快递服务，我们引入了一个具有容量匹配约束的两级车辆路由问题（2E-VRP-CM）。 2E-VRP-CM的目的是确定飞机的飞行路线和卡车路线，而总成本最低。在2E-VRP-CM中，不同种类的卡车车队会响应客户的要求。货物被装载到指定的飞机上并在两个机场之间运输。空运之后，一旦它们到达目的地机场，货物便被分配到卡车上，以便按时到达客户所在地。在机场，货物在卡车和飞机之间转运。 2E-VRP-CM采用容量匹配约束，时间窗口和同步约束来对两级网络的路由问题进行建模。我们开发车辆流量公式，并提出随机序列算法，然后进行可变邻域搜索。计算实验评估了2E-VRP-CM配方的有效性和启发式方法的适用性。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号