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的应用，我们开展了包含六个不同实例的实验，旨在作为示范案例。