【索引】引用A survey on pickup and delivery problems的文章

1. Dynamic container drayage with uncertain request arrival times and service time windows⭐️

• 具有不确定请求到达时间和服务时间窗口的动态集装箱运输
  Container drayage plays a critical role in intermodal global container transportation, as it accomplishes the first-and last-mile shipment of containers. A container drayage operator dispatches a set of tractors and a set of trailers to transport containers within a local area. An
  important aspect of the operations is that the arrival times of service requests are uncertain, which means that the operator should respond to the requests dynamically. Moreover, since customers usually impose time windows on container pickup and delivery, it would be impor-tant to exploit the service flexibilities of requests when allocating resources in order to enhance the resource efficiency. In this paper, we study a dynamic container drayage problem that arises from the practical operations of container drayage. We develop a Markov decision process (MDP) model for the problem to capture the dynamic interactions between the drayage operator and the uncertain environment. For solving the MDP model, we propose a novel integrated reinforcement learning and integer programming method, in which reinforcement learning enables real-time responses to requests by determining whether each request should be served immediately upon arrival or be held for a period of time, while integer programming plans resource allocation periodically for serving the accrued requests. The proposed method aims to identify a fleet management policy that exploits requests’ service flexibilities to maximize the operator’s service capacity and profitability. We also evaluate the performance of the proposed method on instances generated from the operational data of a container drayage operator in Singapore.
• AU Jia, Shuai
  Cui, Haipeng
  Chen, Rui
  Meng, Qiang

• 2022-11-29
• TRB
• 出版商处原文：https://doi.org/10.1016/j.trb.2022.10.010
  亮点：

在不确定的请求到达时间下研究动态集装箱拖运问题。
开发了一种新的马尔可夫决策模型来捕获动态决策。
该文提出一种新型的集成强化学习和整数规划方法。
我们的方法既可以进行实时决策，也可以进行定期的资源规划。
在实际短驳运输操作数据上评估所提方法的性能

摘要:集装箱短驳在全球多式联运集装箱运输中发挥着关键作用，因为它完成了集装箱的第一英里和最后一英里运输。集装箱拖运运营商派遣一组拖拉机和一组拖车在当地区域内运输集装箱。操作的一个重要方面是服务请求的到达时间不确定，这意味着操作员应该动态响应请求。此外，由于客户通常会对集装箱提货和交付施加时间窗口，因此在分配资源时利用请求的服务灵活性以提高资源效率是不必要的。在本文中，我们研究了集装箱短驳的实际操作中出现的动态集装箱拖运问题。我们为该问题开发了一个马尔可夫决策过程（MDP）模型，以捕获拖运操作员与不确定环境之间的动态交互。为了求解MDP模型，我们提出了一种新的集成强化学习和整数规划方法，其中强化学习通过确定每个请求是否应在到达时立即提供服务或保留一段时间来实现对请求的实时响应，而整数规划定期计划资源分配以服务累积的请求。所提出的方法旨在确定一种车队管理策略，该策略利用请求的服务灵活性来最大化运营商的服务能力和盈利能力。我们还评估了所提出的方法在新加坡一家集装箱短驳运营商的运营数据生成的实例上的性能。

2. Comparison of Genetic Operators for the Multiobjective Pickup and Delivery Problem⭐️

关于遗传算法的详细内容。值得学习和参考。

• 多目标拾取和递送问题的遗传算子比较
  The pickup and delivery problem is a pertinent problem in our interconnected world. Being able to move goods and people efficiently can lead to decreases in costs, emissions, and time. In this work, we create a genetic algorithm to solve the multiobjective capacitated pickup and delivery problem, adapting commonly used benchmarks. The objective is to minimize total distance travelled and the number of vehicles utilized. Based on NSGA-II, we explore how different inter-route and intraroute mutations affect the final solution. We introduce 6 inter-route operations and 16 intraroute operations and calculate the hypervolume measured to directly compare their impact. We also introduce two different crossover operators that are specialized for this problem. Our methodology was able to find optimal results in 23% of the instances in the first benchmark and in most other instances, it was able to generate a Pareto front within at most one vehicle and +20% of the best-known distance. With multiple solutions, it allows users to choose the routes that best suit their needs.
• AU Little, Connor
  Choudhury, Salimur
  Hu, Ting
  Salomaa, Kai
• MDPI
• 出版商原文：https://doi.org/10.3390/math10224308

摘要：取货和送货问题是我们互联世界中的一个相关问题。能够有效地运输货物和人员可以降低成本、排放和时间。在这项工作中，我们创建了一个遗传算法来解决多目标有能力的取货和送货问题，并适应了常用的基准。目标是尽量减少行驶的总距离和使用的车辆数量。基于NSGA-II，我们探索了不同的路线间和路线内突变如何影响最终解决方案。我们介绍了 6 个路由间操作和 16 个路由内操作，并计算测量的超量以直接比较它们的影响。我们还介绍了两种专门针对此问题的不同交叉运算符。我们的方法能够在第一个基准测试的 23% 的实例中找到最佳结果，在大多数其他实例中，它能够在最多一辆车和 +20% 的最知名距离内生成帕累托前沿。通过多种解决方案，它允许用户选择最适合其需求的路线。

@article{math10224308,
author = {Little, Connor and Choudhury, Salimur and Hu, Ting and Salomaa, Kai},
doi = {10.3390/math10224308},
issn = {2227-7390},
journal = {Mathematics},
mendeley-groups = {PDP},
number = {22},
title = {
  {Comparison of Genetic Operators for the Multiobjective Pickup and Delivery Problem}},
url = {https://www.mdpi.com/2227-7390/10/22/4308},
volume = {10},
year = {2022}
}

3. Two-echelon capacitated vehicle routing problem with grouping constraints and simultaneous pickup and delivery

有模型介绍+公式（引理证明）+实例数据

• 具有分组约束和同时取货和交付的两级电容车辆路径问题
• AB This paper investigates the two-echelon capacitated vehicle routing problem with grouping constraints and simultaneous pickup and delivery (2E-VRPGS), which is a new variant of the classical two-echelon capacitated vehicle routing problem (2E-VRP). In the 2E-VRPGS, customers from the same administrative region are served by vehicles from the same satellite so as to ensure service consistency, with pickup and delivery being performed simultaneously in the second echelon. To solve this problem to optimality, we formulate it as a path-based model and develop a tailored branch-and-cut-and-price algorithm, which can also exactly solve two closely related variants of 2E-VRPGS in the literature: the 2E-VRP with grouping constraints (2EVRPG), and the 2E-VRP with simultaneous pickup and delivery (2E-VRPS). In particular, a novel dominance rule in the labeling algorithm, together with several customized valid inequalities, has been put forward to effectively accelerate the solution method by exploiting the problem characteristics. To evaluate the efficacy of the proposed algorithm on the problems 2E-VRPG, 2E-VRPS, and 2E-VRPGS, extensive numerical experiments have been conducted on three types of benchmark instances. Computational results on the 2E-VRPGS show that our dominance rule can significantly reduce the number of generated labels and all families of valid inequalities have a great impact on strengthening the path-based model. The algorithm is found to be highly competitive when compared with the existing exact algorithm for the 2E-VRPG and some new findings and managerial insights are derived from sensitivity analysis.
• AU Li, Jiliu
  Xu, Min
  Sun, Peng
• TRB
  出版商处原文：https://doi.org/10.1016/j.trb.2022.06.003
  亮点

建立了基于路径的紧密模型。
开发了一种精确的分支和削减和定价方法来求解该模型。
该文提出一种新的标签算法优势规则。
提出了几个定制的有效不等式族来提升下限。
对三种类型的基准实例进行了数值实验。

摘要：
该文研究了具有分组约束和同时取送的两梯队有载能力车辆路径问题（2E-VRPGS），这是经典两梯队有能力车辆路径问题（2E-VRP）的新变体。在2E-VRPGS中，来自同一行政区域的客户由来自同一卫星的车辆提供服务，以确保服务的一致性，第二梯队同时进行取货和送货。为了将这个问题以最优的方式解决，我们将其表述为基于路径的模型，并开发了一种量身定制的分支和切割和价格算法，该算法也可以精确地解决文献中两个密切相关的2E-VRPGS变体：具有分组约束的2E-VRP（2EVRPG）和具有同时拾取和交付的2E-VRP（2E-VRPS）。特别是，在标签算法中提出了一种新的优势规则，结合几种自定义的有效不等式，利用问题特征有效地加速求解方法。为了评估所提算法对2E-VRPG、2E-VRPS和2E-VRPGS问题的有效性，对3种类型的基准实例进行了大量的数值实验。在2E-VRPGS上的计算结果表明，我们的优势规则可以显著减少生成的标签数量，并且所有有效不等式族对加强基于路径的模型具有较大影响。与现有的2E-VRPG精确算法相比，该算法具有很强的竞争力，并且从敏感性分析中得出了一些新的发现和管理见解。

4.【综述】 A review of vehicle routing with simultaneous pickup and delivery⭐️

• 同时取货和送货的车辆路径回顾
• 亮点

我们调查了同时取货和交付的车辆路径（VRPSPD）。
我们提供了为 VRPSPD 开发的启发式方法的性能比较。
我们描述了几个问题变体、案例研究和工业应用。
我们概述了文献中观察到的主要趋势。
我们确定了几个有趣的有前途的未来研究前景。

In the vehicle routing problem with simultaneous pickup and delivery (VRPSPD), goods have to be transported from different origins to different destinations, and each customer has both a delivery and a pickup demand to be satisfied simultaneously. The VRPSPD has been around for about 30 years, and significant progress has since been made on this problem and its variants. This paper aims to comprehensively review the existing work on the VRPSPD. It surveys mathematical formulations, algorithms, variants, case studies, and industrial applications. It also provides an overview of trends in the literature and identifies several interesti