arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2411.13151math.OC
收藏

面向车辆路径问题的基于片段算法的增强方法

Enhancements of Fragment Based Algorithms for Vehicle Routing Problems

Lucas Sippel, Michael Forbes

AI总结:

本文提出增强型片段算法,通过片段公式、动态离散化发现及公式杠杆化与列枚举行消除两种新概念,首次有效求解带时间窗的取送货问题和基于卡车的无人机配送路径问题,性能达到或超越现有最优算法。

摘要:

片段方法(method of fragments)是近期提出的一种方法,其有效性已在三个专门的取送货问题上得到了实证验证。我们提出一种增强型片段算法,首次有效求解了带时间窗的取送货问题(Pickup and Delivery Problem with Time Windows)。此外,我们以通用术语描述该方法,以展示其在没有取送货要求的车辆路径问题上的理论适用性。随后,我们将该算法应用于带时间窗的基于卡车的无人机配送路径问题(Truck-Based Drone Delivery Routing Problem with Time Windows)。该算法采用片段公式而非路径公式。片段的定义因具体问题而异,但一般而言,可以将片段视为具有特定结构的可枚举路径段。我们基于片段构建资源扩展网络,并通过动态离散化发现(dynamic discretization discovery)对其进行迭代更新。此外,我们引入两个新概念:公式杠杆化(formulation leveraging)和用于行消除的列枚举(column enumeration for row elimination),它们对于求解困难问题至关重要。这些概念利用路径公式的强线性松弛来强化片段公式。我们在带时间窗的取送货问题和带时间窗的基于卡车的无人机配送路径问题实例上测试了我们的算法。在这两个问题上,我们的方法与最先进算法相比具有竞争力,甚至优于现有算法。

英文摘要:

The method of fragments was recently proposed, and its effectiveness has been empirically shown for three specialised pickup and delivery problems. We propose an enhanced fragment algorithm that for the first time, effectively solves the Pickup and Delivery Problem with Time Windows. Additionally, we describe the approach in general terms to exemplify its theoretical applicability to vehicle routing problems without pickup and delivery requirements. We then apply it to the Truck-Based Drone Delivery Routing Problem Problem with Time Windows. The algorithm uses a fragment formulation rather than a route one. The definition of a fragment is problem specific, but generally, they can be thought of as enumerable segments of routes with a particular structure. A resource expanded network is constructed from the fragments and is iteratively updated via dynamic discretization discovery. Additionally, we introduce two new concepts called formulation leveraging and column enumeration for row elimination that are crucial for solving difficult problems. These use the strong linear relaxation of the route formulation to strengthen the fragment formulation. We test our algorithm on instances of the Pickup and Delivery Problem with Time Windows and the Truck-Based Drone Delivery Routing Problem with Time Windows. Our approach is competitive with, or outperforms the state-of-the-art algorithm for both.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑