# Solving a Real-World Package Delivery Routing Problem Using Quantum Annealers

arXiv: https://arxiv.org/abs/2403.15114 · HTML: https://mlsanity.com/paper/2403.15114/

## Key facts

- Cited by 6 papers in the map (data through 14 Oct 2026).
- Builds on 8 of its 56 references that are in the map.
- First posted on arXiv 22 Mar 2024.

## Builds on (most cited first, 8 of 8)

- [H-TSP: Hierarchically Solving the Large-Scale Travelling Salesman Problem](https://mlsanity.com/paper/2304.09395/) (2023)
- [Quantum Computing: A Taxonomy, Systematic Review and Future Directions](https://mlsanity.com/paper/2010.15559/) (2020)
- [Quantum computing for energy systems optimization: Challenges and opportunities](https://mlsanity.com/paper/2003.00254/) (2020)
- [Hybrid Approach for Solving Real-World Bin Packing Problem Instances Using Quantum Annealers](https://mlsanity.com/paper/2303.01977/) (2023)
- [Quantum Annealing for Vehicle Routing Problem with weighted Segment](https://mlsanity.com/paper/2203.13469/) (2022)
- [An Improved Discrete Bat Algorithm for Symmetric and Asymmetric Traveling Salesman Problems](https://mlsanity.com/paper/1604.04138/) (2016)
- [Google vs IBM: A Constraint Solving Challenge on the Job-Shop Scheduling Problem](https://mlsanity.com/paper/1909.08247/) (2019)
- [Optimizing the Production of Test Vehicles using Hybrid Constrained Quantum Annealing](https://mlsanity.com/paper/2203.15421/) (2022)

## Built on by (most cited first, 6 of 6)

- [D-Wave's Nonlinear-Program Hybrid Solver: Description and Performance Analysis](https://mlsanity.com/paper/2410.07980/) (2024)
- [On the Transfer of Knowledge in Quantum Algorithms](https://mlsanity.com/paper/2501.14120/) (2025)
- [Solving Drone Routing Problems with Quantum Computing: A Hybrid Approach Combining Quantum Annealing and Gate-Based Paradigms](https://mlsanity.com/paper/2501.18432/) (2025)
- [Optimizing Package Delivery with Quantum Annealers: Addressing Time-Windows and Simultaneous Pickup and Delivery](https://mlsanity.com/paper/2504.01560/) (2025)
- [Quantum Annealing for Staff Scheduling in Educational Environments](https://mlsanity.com/paper/2510.12278/) (2025)
- [Coordinated optimization of departure sequencing and section-track allocation in railway short-term concentrated departure scenarios based on qubo and hybrid quantum algorithms](https://mlsanity.com/paper/2606.06543/) (2026)

## Abstract (arXiv)

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. The real-world applicability of these problems is dependent on the objectives and constraints considered. Anyway, it is undeniable that it is often difficult to translate complex requirements into these classical formulations.The main objective of this research is to present a solving scheme for dealing with realistic instances while maintaining all the characteristics and restrictions of the original real-world problem. Thus, a quantum-classical strategy 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.