Hybrid Quantum-Classical Optimization Workflows for the Shipment Selection Problem

• URL: http://arxiv.org/abs/2604.11758v1
• Date: Mon, 13 Apr 2026 17:30:49 GMT
• Title: Hybrid Quantum-Classical Optimization Workflows for the Shipment Selection Problem
• Abstract summary: We present a quantum optimization framework for the Shipment Selection Problem (SSP) in electric freight logistics, developed jointly by IonQ and Einride.<n>We formulate the SSP as a Mixed-Integer Quadratic Program, map it to an Isationaling cost Hamiltonian, and solve it using Iterative-QAOA.<n>An end-to-end hybrid workflow integrates Einride's vehicle routing problem solver with IonQ's quantum simulations, enabling evaluation on real, anonymized logistics data spanning up to 130 qubits.
• Score: 0.25457638766329743
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a quantum optimization framework for the Shipment Selection Problem (SSP) in electric freight logistics, developed jointly by IonQ and Einride. Idle gaps arising from stochastic shipment cancellations reduce fleet utilization and revenue; filling them optimally requires solving a combinatorial assignment problem with quadratic inter-gap dependencies. We formulate the SSP as a Mixed-Integer Quadratic Program, map it to an Ising cost Hamiltonian, and solve it using Iterative-QAOA, a non-variational warm-start extension of the Quantum Approximate Optimization Algorithm (QAOA) with a fixed linear-ramp parameter schedule. An end-to-end hybrid workflow integrates Einride's vehicle routing problem (VRP) solver with IonQ's quantum simulations, enabling evaluation on real, anonymized logistics data spanning up to 130 qubits. We assess solution quality through application-level performance metrics, including Shipments Delivered (SD), Schedule Compatibility Score (SCS), and Total Drive Distance (TDD). When the quantum assignment is passed to the classical solver as a warm start, the resulting hybrid workflow achieves improvements of up to 12\% in SD and a reduction of up to 6\% in total drive distance per shipment for specific instances, while total operational cost remains effectively unchanged. These results show that Iterative-QAOA can generate compatibility-aware assignments that become operationally valuable when embedded in a hybrid logistics optimization workflow.

Related papers

• DQAOA-GPT: AI-Accelerated Distributed Quantum Optimization for Combinatorial Problems [1.0380578526859343]
  Variational quantum algorithms offer a promising route for tackling exponentially large search spaces.<n>In this work, we introduce DQAOA-GPT, a hybrid framework that integrates the distributed quantum approximate optimization algorithm (DQAOA)<n>Rather than relying on iterative variational optimization, the proposed approach uses a trained generative model to directly generate high-quality quantum circuits for the sub-problems.
  arXiv  Detail & Related papers  (2026-07-22T14:46:33Z)
• Feasibility-driven QAOA with penalty scheduling [1.4519462317941787]
  Most available quantum algorithms address constrained optimization problems by treating constraints as soft penalty terms within a QUBO formulation.<n>We introduce two extensions of standard linear-ramp QAOA tailored to problems with multiple heterogeneous constraints.<n>We show that piecewise-ramp QAOA consistently outperforms lr-QAOA and $$-lr-QAOA across circuit depths and system sizes.
  arXiv  Detail & Related papers  (2026-06-23T19:44:00Z)
• Quantum walk-based optimisation for capacitated vehicle routing with homogeneous and heterogeneous fleets [3.6100252173467537]
  The capacitated vehicle routing problem (CVRP) is an appealing candidate for quantum optimisation due to its objective complexity and practical importance.<n>We introduce a quantum walk-based optimisation (QWOA) for the CVRP with a homogeneous or heterogeneous vehicle fleets, addressing this challenge through a continuous-time quantum walk over a product space.<n>Relative to the prior QWOA-based formulation, this approach reduces the per-layer gate complexity from $mathcalO(n3log n)$ to $mathcalO(n2log n)$
  arXiv  Detail & Related papers  (2026-06-11T03:39:29Z)
• Hardware-Efficient Quantum Optimization for Transportation Networks via Compressed Adiabatic Evolution [1.409283414986451]
  Transportation systems such as urban logistics, vehicle routing, and infrastructure planning require solving large-scale optimization problems under complex constraints.<n>We develop a hardware-grounded hybrid quantum optimization framework that uses Approximate Quantum Compilation (AQC) to compress early segments of digitized adiabatic evolution into shallow circuits.<n>Results show that moderate prefix compression reduces two-qubit gate depth while maintaining or improving feasible solution, particularly for routing problems.
  arXiv  Detail & Related papers  (2026-04-28T23:45:54Z)
• EQE-QAOA: An Equivalence-Preserving Qubit Efficient Framework for Combinatorial Optimization [54.05451096499336]
  Existing techniques rely on qubit reduction at the cost of information loss, leading to degraded computational performance.<n>We propose the Equivalence-preserving Qubit Efficient QAOA, which significantly reduces the required number of qubits without degrading performance.<n>We show that it is broadly applicable to large-scale optimization problems, excluding only unconstrained problems with completely independent variables.
  arXiv  Detail & Related papers  (2026-04-20T13:57:49Z)
• Toward Quantum-Optimized Flow Scheduling in Multi-Beam Digital Satellites [3.5537995993803286]
  We present a hybrid quantum-classical framework that improves scheduling efficiency.<n>We incorporate the throughput-maximization objective and operational constraints into a compact QUBO.<n>We evaluate solution quality, runtime, and robustness on quantum hardware.
  arXiv  Detail & Related papers  (2026-02-28T15:21:38Z)
• Error-Tolerant Quantum State Discrimination: Optimization and Quantum Circuit Synthesis [8.972587433157939]
  We develop error-tolerant quantum state discrimination strategies that maintain reliable performance under moderate noise.<n>We provide a unified hybrid-objective QSD framework that continuously interpolates between minimum-error discrimination (MED) and FitQSD.<n>A circuit synthesis framework based on a modified Naimark dilation and isometry synthesis enables hardware-efficient implementations with substantially reduced qubit and gate resources.
  arXiv  Detail & Related papers  (2026-02-11T10:44:51Z)
• Quantum Approaches to Urban Logistics: From Core QAOA to Clustered Scalability [0.0]
  The Traveling Salesman Problem (TSP) is a fundamental challenge in optimization, widely applied in logistics and transportation.<n>Traditional algorithms often struggle to produce high-quality solutions within reasonable timeframes.<n>This study investigates the potential of the Quantum Approximate Optimization Algorithm (QAOA), a hybrid quantum-classical method.
  arXiv  Detail & Related papers  (2025-12-11T17:00:24Z)
• Efficient QAOA Architecture for Solving Multi-Constrained Optimization Problems [3.757262277494307]
  This paper proposes a novel combination of constraint encoding methods for the Quantum Approximate Optimization Ansatz.<n>One-hot constraints are enforced through $XY$-mixers that restrict the search space to the feasible sub-space naturally.<n>Since $XY$-mixers restrict the search space, specific state vector entries are always zero and can be omitted from the simulation, saving valuable memory and computing resources.
  arXiv  Detail & Related papers  (2025-06-03T17:46:53Z)
• Branch-and-bound digitized counterdiabatic quantum optimization [39.58317527488534]
  Branch-and-bound algorithms effectively solve convex optimization problems, relying on the relaxation the objective function to obtain tight lower bounds.<n>We propose a branch-and-bound digitized counterdiabatic quantum optimization (BB-DCQO) algorithm that addresses the relaxation difficulties.
  arXiv  Detail & Related papers  (2025-04-21T18:19:19Z)
• Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
  Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems. In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems. We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
  arXiv  Detail & Related papers  (2024-04-17T11:00:12Z)
• Qubit efficient quantum algorithms for the vehicle routing problem on NISQ processors [48.68474702382697]
  Vehicle routing problem with time windows (VRPTW) is a common optimization problem faced within the logistics industry. In this work, we explore the use of a previously-introduced qubit encoding scheme to reduce the number of binary variables.
  arXiv  Detail & Related papers  (2023-06-14T13:44:35Z)
• Fermionic Quantum Approximate Optimization Algorithm [11.00442581946026]
  We propose fermionic quantum approximate optimization algorithm (FQAOA) for solving optimization problems with constraints. FQAOA tackle the constrains issue by using fermion particle number preservation to intrinsically impose them throughout QAOA. We provide a systematic guideline for designing the driver Hamiltonian for a given problem Hamiltonian with constraints.
  arXiv  Detail & Related papers  (2023-01-25T18:36:58Z)
• Collaborative Intelligent Reflecting Surface Networks with Multi-Agent Reinforcement Learning [63.83425382922157]
  Intelligent reflecting surface (IRS) is envisioned to be widely applied in future wireless networks. In this paper, we investigate a multi-user communication system assisted by cooperative IRS devices with the capability of energy harvesting.
  arXiv  Detail & Related papers  (2022-03-26T20:37:14Z)
• Scaling Quantum Approximate Optimization on Near-term Hardware [49.94954584453379]
  We quantify scaling of the expected resource requirements by optimized circuits for hardware architectures with varying levels of connectivity. We show the number of measurements, and hence total time to synthesizing solution, grows exponentially in problem size and problem graph degree. These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.
  arXiv  Detail & Related papers  (2022-01-06T21:02:30Z)
• Combining Deep Learning and Optimization for Security-Constrained Optimal Power Flow [94.24763814458686]
  Security-constrained optimal power flow (SCOPF) is fundamental in power systems. Modeling of APR within the SCOPF problem results in complex large-scale mixed-integer programs. This paper proposes a novel approach that combines deep learning and robust optimization techniques.
  arXiv  Detail & Related papers  (2020-07-14T12:38:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.