首页> 外文期刊>Transportation Science >The Time Window Assignment Vehicle Routing Problem with Time-Dependent Travel Times
【24h】

The Time Window Assignment Vehicle Routing Problem with Time-Dependent Travel Times

机译:行驶时间与时间有关的时间窗分配车辆路径问题

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

摘要

In this paper, we introduce the time window assignment vehicle routing problem (TWAVRP) with time-dependent travel times. It is the problem of assigning time windows to customers before their demand is known and creating vehicle routes adhering to these time windows after demand becomes known. The goal is to assign the time windows in such a way that the expected transportation costs are minimized. We develop a branch-price-and-cut algorithm to solve this problem to optimality. The pricing problem that has to be solved is a new variant of the shortest path problem, which includes a capacity constraint, time-dependent travel times, time window constraints on both the nodes and on the arcs, and linear node costs. For solving the pricing problem, we develop an exact labeling algorithm and a tabu search heuristic. Furthermore, we present new valid inequalities, which are specifically designed for the TWAVRP with time-dependent travel times. Finally, we present results of numerical experiments to illustrate the performance of the algorithm.
机译:在本文中,我们介绍了时间依赖于旅行时间的时间窗分配车辆路径问题(TWAVRP)。问题是在客户的需求已知之前为他们分配时间窗口,并在需求知道之后创建遵守这些时间窗口的车辆路线。目标是分配时间窗口,以使预期的运输成本最小化。我们开发了一种分支降价算法来将这个问题解决到最优。必须解决的定价问题是最短路径问题的新变体,其中包括容量约束,与时间有关的行驶时间,节点和弧线上的时间窗约束以及线性节点成本。为了解决定价问题,我们开发了一种精确的标记算法和禁忌搜索启发式方法。此外,我们提出了新的有效不等式,这些不等式是专门为TWAVRP设计的,具有随时间变化的旅行时间。最后,我们给出数值实验的结果来说明算法的性能。

著录项

  • 来源
    《Transportation Science》 |2018年第2期|261-276|共16页
  • 作者单位

    Erasmus Univ, Econometr Inst, NL-3062 PA Rotterdam, Netherlands;

    Vrije Univ Amsterdam, Dept Informat Logist & Innovat, NL-1081 HV Amsterdam, Netherlands;

    Eindhoven Univ Technol, Dept Ind Engn & Innovat Sci, NL-5600 MB Eindhoven, Netherlands;

  • 收录信息 美国《科学引文索引》(SCI);美国《工程索引》(EI);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    vehicle routing; branch-price-and-cut; column generation;

    机译:车辆路线;分支机构的价格削减;列生成;

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号