# Optimizing Package Delivery with Quantum Annealers: Addressing Time-Windows and Simultaneous Pickup and Delivery

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

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 8 of its 35 references that are in the map.
- First posted on arXiv 2 Apr 2025.

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

- [On the Emerging Potential of Quantum Annealing Hardware for Combinatorial Optimization](https://mlsanity.com/paper/2210.04291/) (2022)
- [Hybrid Approach for Solving Real-World Bin Packing Problem Instances Using Quantum Annealers](https://mlsanity.com/paper/2303.01977/) (2023)
- [Solving a Real-World Package Delivery Routing Problem Using Quantum Annealers](https://mlsanity.com/paper/2403.15114/) (2024)
- [Quantum Annealing of Vehicle Routing Problem with Time, State and Capacity](https://mlsanity.com/paper/1903.06322/) (2019)
- [Quantum Annealing for Vehicle Routing Problem with weighted Segment](https://mlsanity.com/paper/2203.13469/) (2022)
- [Modeling routing problems in QUBO with application to ride-hailing](https://mlsanity.com/paper/2212.04894/) (2022)
- [Solving The Vehicle Routing Problem via Quantum Support Vector Machines](https://mlsanity.com/paper/2308.04849/) (2023)
- [An Exact Method for the Daily Package Shipment Problem with Outsourcing](https://mlsanity.com/paper/2202.03614/) (2022)

## Abstract (arXiv)

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.