Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Mathematics

A Quantum-Classical Benders Decomposition for Cargo Routing with Time Windows

Oliver Szal, Joshua Dibbern, Henri Hiep, Jachin Tekle Gemta, Anisa Rizvanolli

Published Nov 4, 2026• 0 citations
Publisher

Abstract

Quantum Annealing (QA) presents a promising approach for large-scale combinatorial optimization, though its adoption in the shipping industry remains limited. This study considers a Traveling Salesperson Problem with Time Windows and Earliness Penalties (TSPTW-EP) motivated by a break-bulk cargo-routing use case. A vessel must determine a port-visitation sequence while minimizing sailing and early-delivery storage costs and satisfying arrival-time windows. Direct Quadratic Unconstrained Binary Optimization (QUBO) formulations are limited in size by the hardware constraints of existing annealers and may suffer from rugged energy landscapes arising when encoding the continuous time variables in binary variables. Therefore, a hybrid Benders decomposition approach is proposed. The master problem, selecting port visitation sequences, is formulated as a QUBO and explored on a quantum annealer, while the classical subproblem determines arrival times and produces Benders cuts. Benchmark experiments compare different quantum and classical master solvers within the hybrid scheme on realistic maritime instances, assessing solution quality, runtime, and scalability. Results show that on the considered model, the hybrid pipeline struggles with the feasibility of QUBO solutions, especially due to the need for embeddings onto the QPU hardware. However, they also suggest that hybrid Benders terminates in fewer iterations than the classical Benders decomposition, at the cost of an uncertified stopping criterion and lower solution quality. The study aims to quantify the practical benefits and limits of QA-enabled logistics optimization.

DOI
10.3390/math14214031

Related papers

From MINLP to QUBO: A Quantum-Inspired Approach for Bulk Carrier Routing with Time Windows

Joshua Aaron Heinrich Dibbern, Oliver Szal, Anisa Rizvanolli

Emerging optimization paradigms like Quantum Annealing (QA) offer potential for tackling large-scale combinatorial problems, yet applications in the shipping industry remain scarce. This paper addresses the cargo routing problem for bulk carriers, where fuel consumption depends nonlinearly on vessel speed and strict time windows must be respected. We formulate the problem as a Mixed-Integer Nonlinear Program (MINLP) and derive a tractable model through velocity discretization, yielding a Travelling Salesman Problem with Time Windows (TSPTW). A Quadratic Unconstrained Binary Optimization (QUBO) model enables exploration with QA, and performance is evaluated using classical solvers and Simulated Annealing (SA).

•Sep 22, 2025•0 citations

Performance enhancing of hybrid quantum-classical Benders approach for MILP optimization

Sergio López-Baños, Elisabeth Lobe, Ontje Lünsdorf +1 more

Mixed-integer linear programming problems are extensively used in industry for a wide range of optimization tasks. However, as they get larger, they present computational challenges for classical solvers within practical time limits. Quantum annealers can, in principle, accelerate the solution of problems formulated as quadratic unconstrained binary optimization instances, but their limited scale currently prevents achieving practical speedups. Quantum-classical algorithms have been proposed to take advantage of both paradigms and to allow current quantum computers to be used in larger problems. In this work, a hardware-agnostic Benders' decomposition algorithm and a series of enhancements with the goal of taking the most advantage of quantum computing are presented. The decomposition consists of a master problem with integer variables, which is reformulated as a quadratic unconstrained binary optimization problem and solved with a quantum annealer, and a linear subproblem solved by a classical computer. The enhancements consist, among others, of different embedding processes that substantially reduce the pre-processing time of the embedding computation without compromising solution quality, a conservative handling of cut constraints, and a stopping criterion that accounts for the limited size of current quantum computers and their heuristic nature. The proposed algorithm is benchmarked against classical approaches using a D-Wave quantum annealer for a scalable family of transmission network expansion planning problems.

quant-pharXiv:2601.14024•Jan 21, 2026•2 citations

Quantum-Classical Hybrid Cloud Workflows for Combinatorial Supply-Chain and Fleet Optimization

Sonu Kumar Singh

Abstract: Global logistics networks, intercontinental air-freight consolidators, and maritime energy fleets continuously solve large-scale Mixed-Integer Linear Programs (MILPs) such as the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) and multi-vessel Maritime Inventory Routing Problems (MIRP). When weather disruptions, port congestion, or geopolitical airspace closures invalidate baseline schedules, classical branch-and-cut solvers (Gurobi, CPLEX) experience exponential worst-case tree growth on subproblems exceeding 2,000 binary decision variables, often failing to converge within strict 5-to-15-minute operational re-dispatch windows. Conversely, current Noisy Intermediate-Scale Quantum (NISQ) processors remain limited to 100-to-1,000 physical qubits with finite two-qubit gate fidelity ($99.2\%-99.8\%$), preventing direct encoding of full enterprise logistics instances. This paper presents a production-grade Quantum-Classical Hybrid Cloud Architecture that bridges enterprise Kubernetes clusters with co-located quantum processing units (QPUs) via AWS Braket Hybrid Jobs and IBM Quantum Qiskit Runtime primitives. Our framework applies Benders and Dantzig-Wolfe column generation on classical cloud HPC nodes to decompose a 25,000-variable global fleet MILP into a continuous master problem and hard combinatorial pricing/routing subproblems of 60 to 140 binary variables. These subproblems are transformed into Quadratic Unconstrained Binary Optimization (QUBO) and Ising Hamiltonians, warm-started from classical linear programming (LP) relaxations (WS-QAOA), compiled with dynamical decoupling and Zero-Noise Extrapolation (ZNE), and executed inside co-located QPU-CPU sessions while a GPU-accelerated Simulated Bifurcation (SB) digital annealer runs in parallel as a deterministic SLA fallback. Evaluated on disruption recovery workloads modeled on ExxonMobil maritime LNG routing and DHL Global Forwarding air-cargo container loading, our hybrid WS-QAOA + Column Generation workflow improves optimality gap closure at a 10-minute SLA cutoff from 6.84% (classical branch-and-bound alone) to 1.42%, reduces emergency re-routing compute wall-clock time by 61.5%, and cuts fleet fuel and charter penalty costs by 4.7%. Research Domain & Specialization Track Master of Science in Information Technology (MSIT) — Quantum Cloud Computing, Hybrid Orchestration, and Operations Research. Core Technical Highlights Empirical Production Case Studies: Rigorous architectural blueprints and telemetry evaluation across enterprise cloud deployments. Four-Tier Reference Architecture: Formal specification from edge ingress to distributed hardware execution pools. Mathematical Formulation: Formally derived algorithmic and optimization models with closed-loop verification. Multi-Modal Benchmarking: Comparative empirical baselines under fault-injection and synthetic workload scaling. Author Information Author: Sonu Kumar SinghRole: Senior Consultant Affiliation: Independent Researcher Publication Status: Preprint / Working Paper (MSIT AI & Cloud Systems Research Series) Reproducibility & Open Science All included architecture diagrams, telemetry schemas, and benchmark curves are open-access under the Creative Commons Attribution 4.0 International (CC BY 4.0) license.

•Oct 20, 2026•0 citations

Solve Crude Oil Scheduling Problems by Using Quantum-Classical Hybrid Algorithms

Jian Yang, Bohang Wang, Lina Wang +5 more

The optimization of front-end crude oil scheduling is a critical determinant of refinery profitability and operational stability. However, the coupling of discrete logistics events (e.g., vessel berthing) with continuous material flows (e.g., pipeline transfers) renders this problem an NP-hard Mixed-Integer Linear Programming (MILP) challenge, often intractable for classical solvers at industrial scales. This study proposes a novel hybrid quantum-classical framework to address these computational bottlenecks. We employ Benders Decomposition to decouple the monolithic model into a discrete Master Problem (MP) and a continuous Subproblem (SP). To exploit the search capabilities of quantum computing, the MP is reformulated as a Quadratic Unconstrained Binary Optimization (QUBO) model and solved via a hybrid quantum solver, while the SP enforces mass balance and quality constraints through iterative optimality and feasibility cuts. Extensive experiments on 15 multi-scale instances demonstrate that the proposed framework significantly outperforms traditional metaheuristics (e.g., Genetic Algorithms, Tabu Search), reducing total operating costs by approximately 73--80% and achieving computational speeds comparable to state-of-the-art commercial solvers (Gurobi). By effectively leveraging global optimality cuts, the method overcomes the tendency of heuristic approaches to trap in local optima, providing a robust and scalable solution for complex refinery logistics.

quant-pharXiv:2604.26459•Apr 30, 2026•0 citations

QUBO Formulation of the Pickup and Delivery Problem with Time Windows for Quantum Annealing

Cosmin Ștefan Curuliuc, Florin Leon

This paper addresses the Pickup and Delivery Problem with Time Windows (PDPTW), an NP-hard combinatorial optimization problem with major practical relevance in logistics and transportation. The study focuses on a quadratic unconstrained binary optimization (QUBO) formulation for quantum annealing and benchmarks it against two classical optimization paradigms. A modular Python framework is developed that encodes PDPTW in three ways: a mixed-integer linear programming (MILP) model that serves as an exact reference, a genetic algorithm (GA) metaheuristic, and a QUBO model that is compatible with quantum annealers. The framework supports test scenarios with increasing structural complexity, with both feasible and intentionally infeasible instances. An additional contribution is the conceptual design and preliminary analysis of an automatic-penalty weight-tuning scheme for the QUBO model. Experimental results show that the proposed QUBO formulation can produce high-quality solutions for simpler PDPTW instances, but its performance strongly depends on the careful calibration of penalty weights. MILP provides optimal baselines on small instances but becomes intractable as problem size grows. The GA scales to the largest scenario and finds feasible solutions of reasonable quality, but they are not necessarily optimal. The evaluation also includes a large number of problem instances and runs on IBM Quantum hardware using the Quantum Approximate Optimization Algorithm (QAOA).

Applied Sciences•Feb 8, 2026•1 citation

Hybrid quantum-classical end-to-end pipeline for solving MILPs: a vehicle routing case study

Camille de Valk, Koen Reerink, Siert Sebus +1 more

We demonstrate an end-to-end hybrid quantum-classical optimisation framework based on Benders decomposition, capable of solving mixed-integer linear programming (MILP) problems. The framework builds on a previously presented hybrid quantum-classical end-to-end pipeline based on Multiple Cuts via Multiple Solutions (MCMS) Benders decomposition where the cut selection step was performed on quantum annealing hardware. We extend this with gate-based QAOA implementations for both tensor network emulators and superconducting quantum hardware. The Vehicle Routing Problem (VRP) is used as a representative case study and we run the pipeline end-to-end on 10 permutations of a standardised benchmarking instance (20 customers and 4 vehicles from QOptLib) with a classical solver performing the cut selection step. We find that for our instances, only a small fraction of the compute in classical MCMS Benders decomposition is spent on the cut selection step. For a full hybrid end-to-end assessment, we run the pipeline for a toy problem with MPS-JuliQAOA, a powerful tensor network emulator, to execute QAOA. Here, the majority of the time is spent on the cut selection step, deeming quantum advantage of this framework unlikely at problems of this size. This highlights the need for more large-scale benchmarking research when more powerful (QPU) QUBO solvers are available.

quant-pharXiv:2607.26771•Jul 30, 2026•1 citation
Quantum Annealing (QA) presents a promising approach for large-scale combinatorial optimization, though its adoption in the shipping industry remains limited. This study considers a Traveling Salesperson Problem with Time Windows and Earliness Penalties (TSPTW-EP) motivated by a break-bulk cargo-routing use case. A vessel must determine a port-visitation sequence while minimizing sailing and early-delivery storage costs and satisfying arrival-time windows. Direct Quadratic Unconstrained Binary Optimization (QUBO) formulations are limited in size by the hardware constraints of existing annealers and may suffer from rugged energy landscapes arising when encoding the continuous time variables in binary variables. Therefore, a hybrid Benders decomposition approach is proposed. The master problem, selecting port visitation sequences, is formulated as a QUBO and explored on a quantum annealer, while the classical subproblem determines arrival times and produces Benders cuts. Benchmark experiments compare different quantum and classical master solvers within the hybrid scheme on realistic maritime instances, assessing solution quality, runtime, and scalability. Results show that on the considered model, the hybrid pipeline struggles with the feasibility of QUBO solutions, especially due to the need for embeddings onto the QPU hardware. However, they also suggest that hybrid Benders terminates in fewer iterations than the classical Benders decomposition, at the cost of an uncertified stopping criterion and lower solution quality. The study aims to quantify the practical benefits and limits of QA-enabled logistics optimization.
Emerging optimization paradigms like Quantum Annealing (QA) offer potential for tackling large-scale combinatorial problems, yet applications in the shipping industry remain scarce. This paper addresses the cargo routing problem for bulk carriers, where fuel consumption depends nonlinearly on vessel speed and strict time windows must be respected. We formulate the problem as a Mixed-Integer Nonlinear Program (MINLP) and derive a tractable model through velocity discretization, yielding a Travelling Salesman Problem with Time Windows (TSPTW). A Quadratic Unconstrained Binary Optimization (QUBO) model enables exploration with QA, and performance is evaluated using classical solvers and Simulated Annealing (SA).
Mixed-integer linear programming problems are extensively used in industry for a wide range of optimization tasks. However, as they get larger, they present computational challenges for classical solvers within practical time limits. Quantum annealers can, in principle, accelerate the solution of problems formulated as quadratic unconstrained binary optimization instances, but their limited scale currently prevents achieving practical speedups. Quantum-classical algorithms have been proposed to take advantage of both paradigms and to allow current quantum computers to be used in larger problems. In this work, a hardware-agnostic Benders' decomposition algorithm and a series of enhancements with the goal of taking the most advantage of quantum computing are presented. The decomposition consists of a master problem with integer variables, which is reformulated as a quadratic unconstrained binary optimization problem and solved with a quantum annealer, and a linear subproblem solved by a classical computer. The enhancements consist, among others, of different embedding processes that substantially reduce the pre-processing time of the embedding computation without compromising solution quality, a conservative handling of cut constraints, and a stopping criterion that accounts for the limited size of current quantum computers and their heuristic nature. The proposed algorithm is benchmarked against classical approaches using a D-Wave quantum annealer for a scalable family of transmission network expansion planning problems.
Abstract: Global logistics networks, intercontinental air-freight consolidators, and maritime energy fleets continuously solve large-scale Mixed-Integer Linear Programs (MILPs) such as the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) and multi-vessel Maritime Inventory Routing Problems (MIRP). When weather disruptions, port congestion, or geopolitical airspace closures invalidate baseline schedules, classical branch-and-cut solvers (Gurobi, CPLEX) experience exponential worst-case tree growth on subproblems exceeding 2,000 binary decision variables, often failing to converge within strict 5-to-15-minute operational re-dispatch windows. Conversely, current Noisy Intermediate-Scale Quantum (NISQ) processors remain limited to 100-to-1,000 physical qubits with finite two-qubit gate fidelity (99.2%−99.8%99.2\%-99.8\%99.2%−99.8%), preventing direct encoding of full enterprise logistics instances. This paper presents a production-grade Quantum-Classical Hybrid Cloud Architecture that bridges enterprise Kubernetes clusters with co-located quantum processing units (QPUs) via AWS Braket Hybrid Jobs and IBM Quantum Qiskit Runtime primitives. Our framework applies Benders and Dantzig-Wolfe column generation on classical cloud HPC nodes to decompose a 25,000-variable global fleet MILP into a continuous master problem and hard combinatorial pricing/routing subproblems of 60 to 140 binary variables. These subproblems are transformed into Quadratic Unconstrained Binary Optimization (QUBO) and Ising Hamiltonians, warm-started from classical linear programming (LP) relaxations (WS-QAOA), compiled with dynamical decoupling and Zero-Noise Extrapolation (ZNE), and executed inside co-located QPU-CPU sessions while a GPU-accelerated Simulated Bifurcation (SB) digital annealer runs in parallel as a deterministic SLA fallback. Evaluated on disruption recovery workloads modeled on ExxonMobil maritime LNG routing and DHL Global Forwarding air-cargo container loading, our hybrid WS-QAOA + Column Generation workflow improves optimality gap closure at a 10-minute SLA cutoff from 6.84% (classical branch-and-bound alone) to 1.42%, reduces emergency re-routing compute wall-clock time by 61.5%, and cuts fleet fuel and charter penalty costs by 4.7%. Research Domain & Specialization Track Master of Science in Information Technology (MSIT) — Quantum Cloud Computing, Hybrid Orchestration, and Operations Research. Core Technical Highlights Empirical Production Case Studies: Rigorous architectural blueprints and telemetry evaluation across enterprise cloud deployments. Four-Tier Reference Architecture: Formal specification from edge ingress to distributed hardware execution pools. Mathematical Formulation: Formally derived algorithmic and optimization models with closed-loop verification. Multi-Modal Benchmarking: Comparative empirical baselines under fault-injection and synthetic workload scaling. Author Information Author: Sonu Kumar SinghRole: Senior Consultant Affiliation: Independent Researcher Publication Status: Preprint / Working Paper (MSIT AI & Cloud Systems Research Series) Reproducibility & Open Science All included architecture diagrams, telemetry schemas, and benchmark curves are open-access under the Creative Commons Attribution 4.0 International (CC BY 4.0) license.
The optimization of front-end crude oil scheduling is a critical determinant of refinery profitability and operational stability. However, the coupling of discrete logistics events (e.g., vessel berthing) with continuous material flows (e.g., pipeline transfers) renders this problem an NP-hard Mixed-Integer Linear Programming (MILP) challenge, often intractable for classical solvers at industrial scales. This study proposes a novel hybrid quantum-classical framework to address these computational bottlenecks. We employ Benders Decomposition to decouple the monolithic model into a discrete Master Problem (MP) and a continuous Subproblem (SP). To exploit the search capabilities of quantum computing, the MP is reformulated as a Quadratic Unconstrained Binary Optimization (QUBO) model and solved via a hybrid quantum solver, while the SP enforces mass balance and quality constraints through iterative optimality and feasibility cuts. Extensive experiments on 15 multi-scale instances demonstrate that the proposed framework significantly outperforms traditional metaheuristics (e.g., Genetic Algorithms, Tabu Search), reducing total operating costs by approximately 73--80% and achieving computational speeds comparable to state-of-the-art commercial solvers (Gurobi). By effectively leveraging global optimality cuts, the method overcomes the tendency of heuristic approaches to trap in local optima, providing a robust and scalable solution for complex refinery logistics.
This paper addresses the Pickup and Delivery Problem with Time Windows (PDPTW), an NP-hard combinatorial optimization problem with major practical relevance in logistics and transportation. The study focuses on a quadratic unconstrained binary optimization (QUBO) formulation for quantum annealing and benchmarks it against two classical optimization paradigms. A modular Python framework is developed that encodes PDPTW in three ways: a mixed-integer linear programming (MILP) model that serves as an exact reference, a genetic algorithm (GA) metaheuristic, and a QUBO model that is compatible with quantum annealers. The framework supports test scenarios with increasing structural complexity, with both feasible and intentionally infeasible instances. An additional contribution is the conceptual design and preliminary analysis of an automatic-penalty weight-tuning scheme for the QUBO model. Experimental results show that the proposed QUBO formulation can produce high-quality solutions for simpler PDPTW instances, but its performance strongly depends on the careful calibration of penalty weights. MILP provides optimal baselines on small instances but becomes intractable as problem size grows. The GA scales to the largest scenario and finds feasible solutions of reasonable quality, but they are not necessarily optimal. The evaluation also includes a large number of problem instances and runs on IBM Quantum hardware using the Quantum Approximate Optimization Algorithm (QAOA).
We demonstrate an end-to-end hybrid quantum-classical optimisation framework based on Benders decomposition, capable of solving mixed-integer linear programming (MILP) problems. The framework builds on a previously presented hybrid quantum-classical end-to-end pipeline based on Multiple Cuts via Multiple Solutions (MCMS) Benders decomposition where the cut selection step was performed on quantum annealing hardware. We extend this with gate-based QAOA implementations for both tensor network emulators and superconducting quantum hardware. The Vehicle Routing Problem (VRP) is used as a representative case study and we run the pipeline end-to-end on 10 permutations of a standardised benchmarking instance (20 customers and 4 vehicles from QOptLib) with a classical solver performing the cut selection step. We find that for our instances, only a small fraction of the compute in classical MCMS Benders decomposition is spent on the cut selection step. For a full hybrid end-to-end assessment, we run the pipeline for a toy problem with MPS-JuliQAOA, a powerful tensor network emulator, to execute QAOA. Here, the majority of the time is spent on the cut selection step, deeming quantum advantage of this framework unlikely at problems of this size. This highlights the need for more large-scale benchmarking research when more powerful (QPU) QUBO solvers are available.