带时间窗和跨多个堆栈拆分请求的取送货问题的一种精确算法

中文摘要 AI 辅助

本文研究带时间窗和多个堆栈的取送货问题（PDPTWMS）的一种扩展。我们将这一新扩展称为带时间窗和跨多个堆栈拆分请求的取送货问题（PDPTWRSMS）。PDPTWRSMS的应用出现在零担运输系统中，其中货物以托盘或其他标准化集装箱的形式打包。在PDPTWRSMS中，车辆的装载空间被划分为有限容量的隔间。每个隔间的装卸必须遵循后进先出（LIFO）策略。此外，一个请求可以拆分到所有隔间中，且单个请求也可以超过单个隔间的容量。因此，每个请求仅受车辆总容量的限制。计算实验表明，应用这一扩展可以带来显著的路线成本降低（总行驶距离和/或使用的车辆数量），并且，与隔间不限于LIFO策略的PDPTWMS版本相比，当车辆有三个或更多隔间时，拆分的价值更大，而当车辆有两个深隔间时，拆分的价值较小。我们应用了最近提出的片段方法的修改版本。结果证实，该方法可以解决许多PDPTWRSMS实例，并且显著优于当前最先进的PDPTWMS方法。

英文摘要

This paper addresses an extension of the pickup and delivery problem with time windows and multiple stacks (PDPTWMS). We call the new extension the pickup and delivery problem with time windows and requests split across multiple stacks (PDPTWRSMS). Applications of the PDPTWRSMS arise in less-than-truckload transportation systems where loads are packed as pallets or other standardised containers. In the PDPTWRSMS, the vehicle's loading space is divided into compartments of finite capacity. Loading and unloading in each compartment must obey the last-in-first-out (LIFO) policy. Moreover, a request can be split among all compartments, and a single request can also exceed a single compartment's capacity. Thus, each request is only limited to the vehicle's capacity. Computational experiments show that applying this extension can lead to substantial routing cost reductions (the total distance travelled and/or the number of vehicles used), and, compared with versions of the PDPTWMS where compartments are not restricted to a LIFO policy, splitting is worth more once the vehicle has three or more compartments, though less when it has two deep ones. We apply a modified version of the recently proposed method of fragments. Results confirm that this approach can solve many PDPTWRSMS instances and significantly outperforms the current state-of-the-art method for the PDPTWMS.

发表机构

• The University of Queensland（昆士兰大学）

机构由 AI 辅助整理，请以论文原文为准。