EKONOMIKA I UPRAVLENIE PROBLEMY RESHENIYA

HYBRID QUANTUM-CLASSICAL ALGORITHMS IN LOGISTICS OPTIMIZATION PROBLEMS

Tatiana A. Sanaeva, Anna A. Ilmushkina, Osman M. Minaev

Published Jan 1, 2025• 0 citations

Abstract

The paper considers the application of hybrid quantum-classical algorithms (HQCA) to optimization problems in logistics, such as the vehicle routing problem (VRP), the traveling salesman problem (TSP), as well as their generalizations with time windows and fleet constraints. A multi-level architecture of hybrid computing is presented, including the stages of problem translation into QUBO form, implementation of variational quantum algorithms (QAOA), annealing on quantum systems (e.g., D-Wave Advantage2), as well as methods for error correction and post-processing of solutions. A review of domestic and foreign developments in this area is conducted, including the results of Russian research groups (RKC, MISiS, Innopolis, MIPT). It is experimentally shown that GCQAs provide gains in quality and time for medium-sized tasks (100–1 clients), especially when using warm-start strategies and dynamic load distribution between classical and quantum subsystems. The limitations of current NISQ devices and scaling prospects, including integration with predictive analytics and digital twins of logistics systems, are discussed.

DOI: 10.36871/ek.up.p.r.2025.03.13.027

Related papers

Quantum Approaches to Urban Logistics: From Core QAOA to Clustered Scalability

F. Picariello, G. Turati, R. Antonelli +10 more

The Traveling Salesman Problem (TSP) is a fundamental challenge in combinatorial optimization, widely applied in logistics and transportation. As the size of TSP instances grows, traditional algorithms often struggle to produce high-quality solutions within reasonable timeframes. This study investigates the potential of the Quantum Approximate Optimization Algorithm (QAOA), a hybrid quantum-classical method, to solve TSP under realistic constraints. We adopt a QUBO-based formulation of TSP that integrates real-world logistical constraints reflecting operational conditions, such as vehicle capacity, road accessibility, and time windows, while ensuring compatibility with the limitations of current quantum hardware. Our experiments are conducted in a simulated environment using high-performance computing (HPC) resources to assess QAOA's performance across different problem sizes and quantum circuit depths. In order to improve scalability, we propose clustering QAOA (Cl-QAOA), a hybrid approach combining classical machine learning with QAOA. This method decomposes large TSP instances into smaller sub-problems, making quantum optimization feasible even on devices with a limited number of qubits. The results offer a comprehensive evaluation of QAOA's strengths and limitations in solving constrained TSP scenarios. This study advances quantum optimization and lays groundwork for future large-scale applications.

quant-pharXiv:2512.10813Dec 12, 20250 citations

QAOA for Efficient Urban Logistical Ecosystem

F. Picariello, Gloria Turati, R. Antonelli +10 more

The Traveling Salesman Problem (TSP) is a cornerstone of combinatorial optimization with widespread applications in logistics and transportation. As problem sizes increase, classical algorithms often fail to deliver high-quality solutions within practical time constraints. This paper explores the use of the Quantum Approximate Optimization Algorithm (QAOA), a hybrid quantum-classical algorithm, to address TSP instances under realistic conditions. We present a QUBO-based formulation of the TSP that integrates practical constraints reflecting real-world conditions—such as vehicle capacity, road accessibility, and time windows—while maintaining compatibility with limitations of current quantum hardware. Our analysis is conducted in a simulated environment, leveraging high-performance computing (HPC) resources to evaluate the algorithm’s performance across varying problem sizes and circuit depths. This approach enables a comprehensive assessment of QAOA’s capabilities and limitations in solving constrained TSP scenarios, thereby laying the groundwork for its deployment on future large-scale quantum hardware.

Jan 1, 20250 citations

Adiabatic quantum computing impact on transport optimization in the last-mile scenario

Juan Francisco Ariño Sales, Raúl Andrés Palacios Araos

In the ever-evolving landscape of global trade and supply chain management, logistics optimization stands as a critical challenge. This study takes on the Vehicle Routing Problem (VRP), a variant of the Traveling Salesman Problem (TSP), by proposing a novel hybrid solution that seamlessly combines classical and quantum computing methodologies. Through a comprehensive analysis of our approach, including algorithm selection, data collection, and computational processes, we provide in-depth insights into the efficiency, and effectiveness of our hybrid solution compared to traditional methods. The results after analysis of 14 datasets highlight the advantages and limitations of this approach, demonstrating its potential to address NP-hard problems and contribute significantly to the field of optimization algorithms in logistics. This research offers promising contributions to the advancement of logistics optimization techniques and their potential implications for enhancing supply chain efficiency.

Frontiers in Computer ScienceNov 15, 202310 citations

An advanced hybrid quantum tabu search approach to vehicle routing problems

James B. Holliday, Eneko Osaba, Khoa Luu

Quantum computing (QC) is expected to solve incredibly difficult problems, including finding optimal solutions to combinatorial optimization problems. However, to date, QC alone has still been unable to demonstrate this capability except for small-sized problems. Hybrid approaches, where QC and classical computing work together, have shown the most potential for solving real-world-scale problems. This work aims to show that we can enhance a classical optimization algorithm with QC so that it can overcome this limitation. We present a new Hybrid Quantum-classical Tabu Search (HQTS) algorithm to solve the Capacitated Vehicle Routing Problem (CVRP). Based on our prior work, HQTS leverages QC for routing within a classical tabu search framework. The quantum component formulates the Traveling Salesman Problem (TSP) for each route as a Quadratic Unconstrained Binary Optimization (QUBO) and solves it using D-Wave’s Advantage system. Experiments investigate the impact of quantum routing frequency and starting solution methods. Across different starting solution methods, including quantum-based and classical heuristics, it shows minimal overall impact. HQTS achieved optimal or near-optimal solutions for several CVRP problems, outperforming other hybrid CVRP algorithms and significantly reducing the optimality gap relative to preliminary research. The experimental results demonstrate that more frequent quantum routing improves solution quality and runtime. The findings highlight the potential of integrating QC within meta-heuristic frameworks for complex optimization in vehicle routing problems.

Quantum Machine IntelligenceMar 23, 20261 citation

An Advanced Hybrid Quantum Tabu Search Approach to Vehicle Routing Problems

James B. Holliday, Eneko Osaba, Khoa Luu

Quantum computing (QC) is expected to solve incredibly difficult problems, including finding optimal solutions to combinatorial optimization problems. However, to date, QC alone is still far to demonstrate this capability except on small-sized problems. Hybrid approaches where QC and classical computing work together have shown the most potential for solving real-world scale problems. This work aims to show that we can enhance a classical optimization algorithm with QC so that it can overcome this limitation. We present a new hybrid quantum-classical tabu search (HQTS) algorithm to solve the capacitated vehicle routing problem (CVRP). Based on our prior work, HQTS leverages QC for routing within a classical tabu search framework. The quantum component formulates the traveling salesman problem (TSP) for each route as a QUBO, solved using D-Wave's Advantage system. Experiments investigate the impact of quantum routing frequency and starting solution methods. While different starting solution methods, including quantum-based and classical heuristics methods, it shows minimal overall impact. HQTS achieved optimal or near-optimal solutions for several CVRP problems, outperforming other hybrid CVRP algorithms and significantly reducing the optimality gap compared to preliminary research. The experimental results demonstrate that more frequent quantum routing improves solution quality and runtime. The findings highlight the potential of integrating QC within meta-heuristic frameworks for complex optimization in vehicle routing problems.

arXiv:2501.12652Jan 22, 20250 citations

Variational Quantum Algorithms for Solving Vehicle Routing Problem

Muhammad Alsaiyari, Muhamad Felemban

Vehicle Routing Problem (VRP) is considered one of the most challenging problems with application in several domains, including transportation and logistics distribution. VRP is known to be NP-Hard problem. Several algorithms have been proposed to solve VRP in polynomial time. However, these algorithms are inefficient if the VRP instance increases. Recently, researchers investigated how quantum computing can be used to solve VRP. In particular, two promising variational quantum algorithms have been studied, i.e., Variational Quantum Eigensolver (VQE) and Quantum Approximate Optimization Algorithm (QAOA). In this paper, we implement both algorithms on IBM Qiskit and compare their evaluation in solving several instances of VRP. We observe that current Noisy-Intermediate Scale Quantum (NISQ) devices cannot solve VRP instances beyond 5 nodes and 2 vehicles. Furthermore, we observe that classical optimizers still provide better results. However, we believe that with the rapid advancement of quantum computing manufacturing, VQE and QAOA can provide better performance as compared to classical computing,

International Conference on Smart Computing and Application (ICSCA)Feb 5, 20238 citations