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.
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.
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.
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.
Quantum computing is used to address supply chain optimization complexity and efficiency. Multiple locations, time periods, transportation expenses, facility opening costs, production capacity, and demand fulfillment requirements complicate supply chains. Supply chain optimization's complexity and huge solution areas challenge traditional optimization methods. Quantum algorithms can efficiently explore bigger solution areas in quantum computing. Starting with problem identification, this research reviews quantum computing and supply chain optimization literature. The supply chain optimization problem is modeled mathematically to incorporate transportation, facility opening, production, and cost. Binary choice factors and constraints ensure demand fulfillment, facility capacity limitations, and flow balance. The mathematical theory is applied numerically. The example addresses three locations, two time periods, transportation costs, demand amounts, production capacity, and facility opening costs. A proper optimization solver optimizes the decision variables to reduce total cost while meeting demand and making efficient supply chain decisions. The supply chain optimization model reduces costs and informs transportation, facility opening, and production decisions. The numerical example shows how quantum computing may optimize supply chain topologies and reduce costs. The study explains the findings, highlights gaps in the literature, and stresses the need for more research to bridge theory and practice. This study advances supply chain optimization with quantum computing. It shows how quantum computing might improve supply chain network decision-making, efficiency, and cost.
Quantum annealing, a maturing technology, offers a potential solution to large scale combinatorial optimization problems by leveraging quantum bits (qubits) in superposition to explore vast solution spaces simultaneously, significantly reducing computation time.Currently, quantum annealers can handle up to 11,000 binary variables, with hybrid solvers capable of addressing problems with up to 1 million binary variables.Though not yet consistently optimal, these approaches provide high-quality solutions without the need for complex heuristics.This paper explores the potential application of quantum annealing to optimize supply chain operations at Dell, specifically within their Excess & Obsolete (E&O) inventory process.The focus is on identifying a proactive re-balancing strategy for inventory management, minimizing costs, and improving parts distribution across Dell's global locations.By utilizing simulated annealing accelerated by high-performance computing (HPC) resources, including Nvidia GPUs and NEC's vector engine, we aim to achieve near-optimal solutions for inventory rebalancing.Some models will also be evaluated on quantum hardware to explore the feasibility of quantum acceleration in real-world supply chain optimization.Preliminary results suggest that while quantum annealing is still in its early stages, it holds significant promise for cost savings and operational efficiency in largescale supply chains.
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.
In recent years, the Flow shop Scheduling Problem (FSP) has gained significant attention, prompting researchers to develop various methods, from conventional to hybrid optimization algorithms. Driven by the rapid growth of quantum computing capabilities, quantum approaches applied to optimization problems have attracted an increasing research effort. This work attempts to solve the permutation flow shop scheduling problem using quantum annealing by formulating the problem as a Quadratic Unconstrained Binary Optimization model (QUBO). Two QUBO formulations tailored to address the FSP are used. The first formulation is based on the position-based modelling while the second is based on five approximations of FSP as a Traveling Salesman Problem (TSP). The QUBO formulations are tested, using D-Wave's quantum annealers, on the well-known Taillard FSP benchmark and compared against each other. Results show that the proposed position-based QUBO reaches better solutions than the TSP-based QUBOs. This work is an attempt to highlight the increasing effectiveness of quantum annealers in addressing complex optimization problems and their limitations compared to conventional classical methods.