用量子退火解决带时间窗和取送同车的快递配送问题
Optimizing Package Delivery with Quantum Annealers: Addressing Time-Windows and Simultaneous Pickup and Delivery
- 结合量子退火与经典优化，处理真实配送场景
- 7个实例验证支持取送同车、时间窗和车型限制
- 适合物流优化与量子计算应用研究者参考
量子计算与路径规划交叉领域的研究日益活跃。多数工作聚焦于旅行商问题和车辆路径问题等经典难题。然而，这些模型在实际应用中受限于具体目标与约束条件，将复杂现实需求转化为经典数学形式常面临挑战。本文采用此前发表的量子-经典混合方法Q4RPD，进一步拓展其在真实场景中的应用能力。重点解决三类现实约束：取送同车、时间窗以及按车型划分的通行限制。为验证新功能，我们设计并测试了7个典型配送实例，展示了该方法在处理多维度现实约束下的可行性与有效性。
原文摘要 · Abstract (English)
Recent research at the intersection of quantum computing and routing problems has been highly prolific. Much of this work focuses on classical problems such as the Traveling Salesman Problem and the Vehicle Routing Problem. The practical applicability of these problems depends on the specific objectives and constraints considered. However, it is undeniable that translating complex real-world requirements into these classical formulations often proves challenging. In this paper, we resort to our previously published quantum-classical technique for addressing real-world-oriented routing problems, known as Quantum for Real Package Delivery (Q4RPD), and elaborate on solving additional realistic problem instances. Accordingly, this paper emphasizes the following characteristics: i) simultaneous pickup and deliveries, ii) time-windows, and iii) mobility restrictions by vehicle type. To illustrate the application of Q4RPD, we have conducted an experimentation comprising seven instances, serving as a demonstration of the newly developed features.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。