Research focused on the conjunction between quantum computing and routing problems has been very prolific in recent years. Most of the works revolve around classical problems such as the Traveling Salesman Problem or the Vehicle Routing Problem. Even though working on these problems is valuable, it is also undeniable that their academic-oriented nature falls short of real-world requirements. The main objective of this research is to present a solving method for realistic instances, avoiding problem relaxations or technical shortcuts. Instead, a quantum-classical hybrid solver has been developed, coined Q4RPD, that considers a set of real constraints such as a heterogeneous fleet of vehicles, priority deliveries, and capacities characterized by two values: weight and dimensions of the packages. Q4RPD resorts to the Leap Constrained Quadratic Model Hybrid Solver of D-Wave. To demonstrate the application of Q4RPD, an experimentation composed of six different instances has been conducted, aiming to serve as illustrative examples.

翻译：近年来，聚焦于量子计算与路径问题交集的研究成果丰硕。现有工作大多围绕旅行商问题或车辆路径问题等经典问题展开。尽管对这些问题的研究具有重要价值，但其学术导向性显然难以满足现实场景的需求。本研究的主要目标是为真实实例提供求解方法，避免问题简化或技术捷径。为此，我们开发了名为Q4RPD的量子-经典混合求解器，该求解器考虑了一系列实际约束条件，包括异构车队、优先交付以及由包裹重量和尺寸两个参数表征的容量限制。Q4RPD借助D-Wave公司的Leap约束二次模型混合求解器。为展示Q4RPD的实际应用，我们开展了由六个不同实例组成的实验，旨在提供示例性说明。