© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

International Conference on Emerging Smart Computing and Informatics (ESCI)

Using Quantum Annealing to Solve Large-Scale Optimization Problems in Logistics and Scheduling

Sandeep Kumar

Published Mar 5, 2025• 0 citations

Abstract

In planning and scheduling, large-scale optimization problems often have complex limits and a lot of factors, which makes them hard to answer with standard methods. Quantum annealing has become a hopeful way to deal with these problems because it can quickly look into a lot of possible solutions. This essay looks into how quantum annealing might be used to solve optimization problems in transportation and scheduling, with a focus on how it could be used for route planning, inventory management, and arranging workers. To do these optimization jobs, quantum annealing is used. This is a quantum computing method that gets the global minimum of a cost function. We use the D-Wave quantum annealer in this method. It turns the problem's limits and objective function into a quadratic unconstrained binary optimization (QUBO) model. The quantum annealer then works on this model to find the best answers. The suggested method combines traditional preparation methods with quantum annealing to get the best results for big schedule and transportation issues. We use quantum annealing to solve difficult multi-objective optimization problems, like reducing shipping time, cost, and resource use all at the same time. Preliminary results show that quantum annealing can make solutions much better and use computers much more efficiently than traditional methods for optimizing supplies and schedules. Quantum annealing works especially well with problems that have a lot of dimensions. It can provide scalable answers that sometimes work better than standard methods.

DOI: 10.1109/esci63694.2025.10988208

Related papers

Application of Quantum Annealing to Supply Chain Planning under Uncertainty

Jesus Garcia Garcia, Pablo Galan Jativa

Supply chain planning is a complex optimization problem that involves the coordination of multiple resources in order to reduce costs and maximize benefit. In this study, we propose a QUBO formulation for the scheduling of the transportation of materials to a factory with uncertain arrival times. The standard methods like network flow or MILP solvers escalate exponentially with the problem parameters, making computation times grow rapidly. Quantum annealing is a candidate for an optimization poccess that can solve this computationally intense problems, and thus it is important to be able to find compatible formulations. The model proposed makes use of the QUBO formulation to give optimal solutions to the scheduling with unceratinty. We will establish the problem from a stochastic optimization point of view, and then build a hamiltonian that encodes it, following the QUBO formulation. With the quick increase in qubit numbers of quantum computers, this model seems like a promising tool that will provide solutions to very relevant and computionally hard problems in the near future.

Genetic and Evolutionary Computation Conference Companion (GECCO Companion)•Jul 15, 2023•3 citations

An introduction to quantum annealing and review of QUBO models for Vehicle Routing Problem

Michał Jaroszczuk

Vehicle Routing Problem is a well-known optimization issue, which has many extensions resulting from practical appliances. The problem is NP-hard, therefore it may be impossible to find an optimal solution for big instances, with traditional computation methods. Recent development of quantum technology, may be a response for this challenge, which however requires a different formulation of the model. The problem is then modeled using Quadratic Unconstrained Binary Optimization (QUBO) equations. Such model can be run using quantum annealers (QA), designed specifically for optimization purposes. This paper is a systematic survey of Vehicle Routing Problem models that are formulated using QUBO, to be solved on quantum computers. The main goal of the paper is to check research gaps in this subject, compare and explain different approaches of modeling various problem extensions with QUBO. The results obtained in reviewed papers will be presented and analyzed. Moreover, the theoretical basis for quantum computation will be presented, with focus on D-Wave company solutions.

IEEE International Symposium on Computational Intelligence and Informatics (CINTI)•Nov 18, 2025•1 citation

Solving the Job Shop Scheduling Problem: QUBO model and Quantum Annealing

Riad Aggoune, Samuel Deleplanque

Quantum optimization which is the use of quantum computers and algorithms for solving complex optimization problems, is one of the topics in quantum computing with the highest potential. Two types of approaches are generally used to solve combinatorial optimization problems with quantum computers: exact methods such as the Grover’s search algorithm, and meta-heuristics such as the Quantum Annealing and the Quantum Approximate Optimization Algorithm (QAOA). Exact methods and variational methods like QAOA make use of universal gate-based quantum computers, such as the ones developed by the IBM company.Quantum annealing is designed for analogic quantum computers developed by D-Wave. Solving a combinatorial optimization problem with heuristics generally requires a transformation of the problem to a format suitable for the quantum computer. While some existing frameworks can cope with Constrained Quadratic Models (CQM), Quadratic Unconstrained Binary Optimization (QUBO) is the best option to map an optimization problem to a quantum computer or simulator. We consider in this paper the job shop scheduling problem.

•Apr 17, 2023•0 citations

Quantum Annealing for Sustainable Supply Chains to Reduce Carbon Footprint

Muthukumaran Maruthappa, R. Meenakshi, R. Vijayalakshmi

This investigates Quantum Annealing as a game-changing strategy for dealing with complicated combinatorial optimization issues, with the goal of achieving sustainable supply chains and decreased carbon footprints. The purpose of the research is to harness the potential of Quantum Computing, notably focused on Quadratic Unconstrained Binary Optimization formulations, Ising Model, Maximum Cut Problem, and the Traveling Salesman Problem. The goal of this is to expand the use of Quantum Annealing methods in the logistics, supply chain, and environmental fields. The goal of this study is to use Quantum Annealing's powerful capability to effectively explore large solution spaces as a springboard for developing novel approaches. A quantum-powered paradigm change in supply chain optimization is made possible by the new application of Quantum Annealing to real-world sustainability concerns. This is groundbreaking since it is the first to include quantum algorithms into eco-friendly supply chain planning by going into the details of QUBO, the Ising Model, MAX-CUT, and TSP. It offers a fresh viewpoint on reducing the carbon footprint of supply chains, which in turn encourages more environmentally friendly corporate procedures. It lays the groundwork for future developments in quantum-enabled sustainability and highlights the critical role that cutting-edge technologies play in driving global supply chain environmental conservation initiatives.

International Journal of Industrial Engineering•Oct 31, 2025•0 citations

Solving the resource constrained project scheduling problem with quantum annealing

Luis Fernando Pérez Armas, Stefan Creemers, Samuel Deleplanque

Quantum annealing emerges as a promising approach for tackling complex scheduling problems such as the resource-constrained project scheduling problem (RCPSP). This study represents the first application of quantum annealing to solve the RCPSP, analyzing 12 well-known mixed integer linear programming (MILP) formulations and converting the most qubit-efficient one into a quadratic unconstrained binary optimization (QUBO) model. We then solve this model using the D-wave advantage 6.3 quantum annealer, comparing its performance against classical computer solvers. Our results indicate significant potential, particularly for small to medium-sized instances. Further, we introduce time-to-target and Atos Q-score metrics to evaluate the effectiveness of quantum annealing and reverse quantum annealing. The paper also explores advanced quantum optimization techniques, such as customized anneal schedules, enhancing our understanding and application of quantum computing in operations research.

Scientific Reports•Jul 22, 2024•30 citations

Quantum-Inspired Optimization of Large-Scale Logistic Networks

Jincheng Zhang

Large-scale logistic networks present a formidable challenge to traditional optimization techniques. The sheer number of variables and constraints involved—including vehicle routing, shipment scheduling, warehouse operations, and inventory management—often leads to computational bottlenecks, hindering efficient network design and operation. This paper investigates the application of quantum-inspired optimization algorithms to address these challenges. Specifically, we explore the potential of algorithms mimicking quantum phenomena, such as quantum annealing and quantum walks, to efficiently solve complex routing and scheduling problems within large logistic networks. Our approach leverages the inherent parallelism and ability of these algorithms to navigate complex solution spaces, offering a promising alternative to classical methods. We demonstrate the feasibility and potential benefits of this strategy through a theoretical framework and illustrative examples, highlighting the advantages of quantum-inspired optimization for improving the performance of large-scale logistic networks.

•Sep 6, 2026•0 citations

In planning and scheduling, large-scale optimization problems often have complex limits and a lot of factors, which makes them hard to answer with standard methods. Quantum annealing has become a hopeful way to deal with these problems because it can quickly look into a lot of possible solutions. This essay looks into how quantum annealing might be used to solve optimization problems in transportation and scheduling, with a focus on how it could be used for route planning, inventory management, and arranging workers. To do these optimization jobs, quantum annealing is used. This is a quantum computing method that gets the global minimum of a cost function. We use the D-Wave quantum annealer in this method. It turns the problem's limits and objective function into a quadratic unconstrained binary optimization (QUBO) model. The quantum annealer then works on this model to find the best answers. The suggested method combines traditional preparation methods with quantum annealing to get the best results for big schedule and transportation issues. We use quantum annealing to solve difficult multi-objective optimization problems, like reducing shipping time, cost, and resource use all at the same time. Preliminary results show that quantum annealing can make solutions much better and use computers much more efficiently than traditional methods for optimizing supplies and schedules. Quantum annealing works especially well with problems that have a lot of dimensions. It can provide scalable answers that sometimes work better than standard methods.

Supply chain planning is a complex optimization problem that involves the coordination of multiple resources in order to reduce costs and maximize benefit. In this study, we propose a QUBO formulation for the scheduling of the transportation of materials to a factory with uncertain arrival times. The standard methods like network flow or MILP solvers escalate exponentially with the problem parameters, making computation times grow rapidly. Quantum annealing is a candidate for an optimization poccess that can solve this computationally intense problems, and thus it is important to be able to find compatible formulations. The model proposed makes use of the QUBO formulation to give optimal solutions to the scheduling with unceratinty. We will establish the problem from a stochastic optimization point of view, and then build a hamiltonian that encodes it, following the QUBO formulation. With the quick increase in qubit numbers of quantum computers, this model seems like a promising tool that will provide solutions to very relevant and computionally hard problems in the near future.

Vehicle Routing Problem is a well-known optimization issue, which has many extensions resulting from practical appliances. The problem is NP-hard, therefore it may be impossible to find an optimal solution for big instances, with traditional computation methods. Recent development of quantum technology, may be a response for this challenge, which however requires a different formulation of the model. The problem is then modeled using Quadratic Unconstrained Binary Optimization (QUBO) equations. Such model can be run using quantum annealers (QA), designed specifically for optimization purposes. This paper is a systematic survey of Vehicle Routing Problem models that are formulated using QUBO, to be solved on quantum computers. The main goal of the paper is to check research gaps in this subject, compare and explain different approaches of modeling various problem extensions with QUBO. The results obtained in reviewed papers will be presented and analyzed. Moreover, the theoretical basis for quantum computation will be presented, with focus on D-Wave company solutions.

Quantum optimization which is the use of quantum computers and algorithms for solving complex optimization problems, is one of the topics in quantum computing with the highest potential. Two types of approaches are generally used to solve combinatorial optimization problems with quantum computers: exact methods such as the Grover’s search algorithm, and meta-heuristics such as the Quantum Annealing and the Quantum Approximate Optimization Algorithm (QAOA). Exact methods and variational methods like QAOA make use of universal gate-based quantum computers, such as the ones developed by the IBM company.Quantum annealing is designed for analogic quantum computers developed by D-Wave. Solving a combinatorial optimization problem with heuristics generally requires a transformation of the problem to a format suitable for the quantum computer. While some existing frameworks can cope with Constrained Quadratic Models (CQM), Quadratic Unconstrained Binary Optimization (QUBO) is the best option to map an optimization problem to a quantum computer or simulator. We consider in this paper the job shop scheduling problem.

This investigates Quantum Annealing as a game-changing strategy for dealing with complicated combinatorial optimization issues, with the goal of achieving sustainable supply chains and decreased carbon footprints. The purpose of the research is to harness the potential of Quantum Computing, notably focused on Quadratic Unconstrained Binary Optimization formulations, Ising Model, Maximum Cut Problem, and the Traveling Salesman Problem. The goal of this is to expand the use of Quantum Annealing methods in the logistics, supply chain, and environmental fields. The goal of this study is to use Quantum Annealing's powerful capability to effectively explore large solution spaces as a springboard for developing novel approaches. A quantum-powered paradigm change in supply chain optimization is made possible by the new application of Quantum Annealing to real-world sustainability concerns. This is groundbreaking since it is the first to include quantum algorithms into eco-friendly supply chain planning by going into the details of QUBO, the Ising Model, MAX-CUT, and TSP. It offers a fresh viewpoint on reducing the carbon footprint of supply chains, which in turn encourages more environmentally friendly corporate procedures. It lays the groundwork for future developments in quantum-enabled sustainability and highlights the critical role that cutting-edge technologies play in driving global supply chain environmental conservation initiatives.

Quantum annealing emerges as a promising approach for tackling complex scheduling problems such as the resource-constrained project scheduling problem (RCPSP). This study represents the first application of quantum annealing to solve the RCPSP, analyzing 12 well-known mixed integer linear programming (MILP) formulations and converting the most qubit-efficient one into a quadratic unconstrained binary optimization (QUBO) model. We then solve this model using the D-wave advantage 6.3 quantum annealer, comparing its performance against classical computer solvers. Our results indicate significant potential, particularly for small to medium-sized instances. Further, we introduce time-to-target and Atos Q-score metrics to evaluate the effectiveness of quantum annealing and reverse quantum annealing. The paper also explores advanced quantum optimization techniques, such as customized anneal schedules, enhancing our understanding and application of quantum computing in operations research.

Large-scale logistic networks present a formidable challenge to traditional optimization techniques. The sheer number of variables and constraints involved—including vehicle routing, shipment scheduling, warehouse operations, and inventory management—often leads to computational bottlenecks, hindering efficient network design and operation. This paper investigates the application of quantum-inspired optimization algorithms to address these challenges. Specifically, we explore the potential of algorithms mimicking quantum phenomena, such as quantum annealing and quantum walks, to efficiently solve complex routing and scheduling problems within large logistic networks. Our approach leverages the inherent parallelism and ability of these algorithms to navigate complex solution spaces, offering a promising alternative to classical methods. We demonstrate the feasibility and potential benefits of this strategy through a theoretical framework and illustrative examples, highlighting the advantages of quantum-inspired optimization for improving the performance of large-scale logistic networks.