Optimization Algorithm for Inventory Allocation in Gravity-Flow Racks with Classical and Quantum-Hybrid Computing
Gabriel P. L. M. Fernandes, Matheus S. Fonseca, Amanda G. Valério, Alexandre C. Ricardo, Nicolás A. C. Carpio, Paulo C. C. Bezerra, Celso J. Villas-Bôas
Warehouses play a central role in industrial logistics, functioning as critical hubs for storing and organizing inventory to support efficient production. Optimizing item allocation within these facilities is essential for reducing operational costs and improving delivery times. In this work, we address the optimization of inventory allocation in warehouses equipped with gravity-flow racks, which are designed for First In, First Out (FIFO) logistics, a configuration that inherently requires item reinsertions during retrieval operations to maintain flow continuity. These reinsertions, however, are time-consuming and costly, so minimizing their occurrence is crucial for operational efficiency. We propose an optimization strategy that simultaneously allocates multiple items, determining their placement across available shelves in a single decision step, explicitly accounting for every item and every shelf in the warehouse. By jointly evaluating multiple items, our approach enables globally optimized placement decisions, minimizing conflicts that arise in sequential methods. The problem is formulated as a QUBO, allowing implementation on both classical metaheuristics and quantum-hybrid solvers. We assess performance by comparing three classical optimization approaches - two variants of Simulated Annealing and the commercial solver Gurobi - with D-Wave's hybrid solver, which uniquely combines quantum annealing with classical metaheuristics. Complementing these benchmarks, a factory-scale simulation based on real operational data shows that considering larger batches of items in the allocation step can significantly reduce reinsertions, highlighting the practical potential of the proposed approach for industrial logistics.
Warehouses play a central role in industrial logistics, functioning as critical hubs for storing and organizing inventory to support efficient production. Optimizing item allocation within these facilities is essential for reducing operational costs and improving delivery times. In this work, we address the optimization of inventory allocation in warehouses equipped with gravity-flow racks, which are designed for First In, First Out (FIFO) logistics, a configuration that inherently requires item reinsertions during retrieval operations to maintain flow continuity. These reinsertions, however, are time-consuming and costly, so minimizing their occurrence is crucial for operational efficiency. We propose an optimization strategy that simultaneously allocates multiple items, determining their placement across available shelves in a single decision step, explicitly accounting for every item and every shelf in the warehouse. By jointly evaluating multiple items, our approach enables globally optimized placement decisions, minimizing conflicts that arise in sequential methods. The problem is formulated as a QUBO, allowing implementation on both classical metaheuristics and quantum-hybrid solvers. We assess performance by comparing three classical optimization approaches - two variants of Simulated Annealing and the commercial solver Gurobi - with D-Wave's hybrid solver, which uniquely combines quantum annealing with classical metaheuristics. Complementing these benchmarks, a factory-scale simulation based on real operational data shows that considering larger batches of items in the allocation step can significantly reduce reinsertions, highlighting the practical potential of the proposed approach for industrial logistics.
Abstract The warehouse layout problem (WLP), also known as warehouse slotting problem, aims to determine the assignment of products to storage locations while minimizing the total travel distance for picking operations. It is combinatorial in nature and well-known to be NP-hard. To obtain high-quality solutions to medium and large WLP instances efficiently remains a computational challenge, which has motivated our work on applying quantum optimization algorithms for this problem. We reformulate the classical quadratic assignment programming (QAP) model of the WLP to a quadratic unconstrained binary optimization (QUBO) model. Our QUBO model avoids adding slack variables and reduces additional overheads as in the typical QUBO reformulation approach, which facilitates the application of the D-Wave Leap Hybrid solver. Computational study is performed on a use case with 30 stock-keeping-units (SKUs) and 32 storage slots, for which the QUBO formulation has 960 binary decision variables. We show that the D-Wave Leap Hybrid solver finds better solution to the base scenario than the exact IBM CPLEX mixed-integer quadratic programming (MIQP) solver operating under a 60-second wall-clock limit, one-tenth of the 600-second budget allocated to CPLEX in this experimental design. A sensitivity analysis across 30 scenarios, generated by crossing five annual pick volume profiles with six co-picking matrix density levels (0.5 to 1.0), shows that the D-Wave hybrid solver outperforms CPLEX MIQP solver in 26 of 30 cases, with solution quality improvements of 0.4 to 12.1%. D-Wave’s advantage generally increases as the density of co-picking matrix decreases. These results demonstrate quantum utility for WLP and motivate further investigation of hybrid quantum-classical methods for combinatorial logistics optimization at industrial strength scales.
E-commerce platforms face ever more complex dimensional SKU portfolios, demand volatility, returns, seasonality and cost pressures. Traditional optimization approaches (integer programming, heuristics, meta-heuristics) increasingly strain under scale, real-time demands and combinatorial explosion. Meanwhile, quantum-inspired optimization leveraging methods such as quantum annealing, coherent Ising machines, variational circuits and QUBO (Quadratic Unconstrained Binary Optimization) mapping offer near-term practical approaches to combinatorial logistics and inventory problems. This paper proposes a comprehensive framework for applying quantum-inspired optimization to e-commerce supply-chain logistics and inventory management: we provide an extended literature review of classical and quantum-inspired methods; we derive full mathematical formulations for logistics/inventory problems and map them into QUBO/quantum-inspired frameworks; we design a benchmarking/implementation methodology; we discuss industry architecture and deployment issues (data pipelines, latency, hybrid classical/quantum-inspired workflows, interpretability, cost benefit); we present use cases and discuss practical adoption in ecommerce. Our findings suggest that while fully fault-tolerant quantum computing remains some years away, quantum-inspired optimization can deliver meaningful improvements in logistics and inventory decisions today, particularly for large-SKU e-commerce, multi-warehouse networks and time-sensitive delivery.
The warehouse management problem discussed in this dissertation consists of optimizing the allocation of items in a storage system ordered similarly to a queue and minimizing reallocations of these items. For this purpose, this research proposes three strategies: Quantum Annealing, Simulated Annealing and a Recommendation System, the latter also responsible for generating parameters for the other methods. The results showed that the Recommendation System stood out in terms of processing time and significantly reduced reinsertions. On the other hand, Simulated Annealing achieved even better results, with a significant reduction in the number of reinsertions compared to the company's current method. Both methods revealed practical potential and viable integration into industrial systems. In the quantum approach, despite restrictions on the instances executed, the evolution of the system's energy indicates competitive potential in relation to Simulated Annealing, especially considering the expected advances in fault-tolerant computers. Although currently quantum computers are limited and susceptible to a considerable level of noise, the results obtained already point to practical and promising applications. In addition, a connection was identified between the Lift metric for association rule and the g^(2)(τ) correlation function of quantum optics. On this basis, a study was started to verify the feasibility of developing a quantum recommendation algorithm, whose initial discussions are presented at the end of the dissertation.
Quantum computing offers transformative potential for addressing complex combinatorial optimization challenges in logistics and supply chain management. This paper presents a comprehensive investigation of quantum annealing and hybrid quantum-classical algorithms applied to unit load device (ULD) configuration and disruption management in air cargo and multimodal logistics networks. We formulate the ULD loading and placement problem as a Quadratic Unconstrained Binary Optimization (QUBO) model that incorporates weight, volume, center-of-gravity, structural stress, and compatibility constraints. A stratified hybrid architecture spanning physical quantum hardware, algorithmic middleware, and decision-support layers is proposed. Through extensive numerical experiments and comparison with classical solvers, we demonstrate superior payload utilization (up to 96.5%), favorable computational scaling, and rapid disruption recovery. Real-world industry pilots, including quantum-assisted route optimization achieving substantial carbon emission reductions and hybrid solutions at major ports, are analyzed. Results indicate that while noisy intermediate-scale quantum (NISQ) hardware limitations persist, hybrid approaches already deliver measurable gains in operational efficiency, cost reduction, and supply-chain resilience. The work provides a practical roadmap for near-term adoption of quantum technologies in high-stakes logistics environments. Keywords— Quantum annealing, Unit load device (ULD), QUBO, Logistics optimization, Disruption management, Hybrid quantum-classical algorithms, Air cargo, Supply chain resilience
Managing inventory in large-scale supply chains necessitates quick, cost-effective decisions that adhere to constraints such as storage limits and variable demand. This paper describes a novel hybrid approach that uses both quantum and classical computers to tackle inventory problems structured as Quadratic Unconstrained Binary Optimization (QUBO). Each choice variable, such as restocking a product, is represented in binary form, with related costs and penalties built into the objective function. Business constraints are communicated indirectly using adjustable weights, allowing the model to remain unconstrained while discouraging unrealistic conclusions. Optimization is carried out using both classical methods like simulated annealing and quantum solvers such as D-Wave and QAOA, where a hybrid strategy selects the most viable solution. The results indicate that the hybrid system consistently produces lower total costs and better constraint compliance compared to individual solvers, especially for complex, high-dimensional datasets. To ensure secure, automated execution of these optimized decisions, a blockchain layer is introduced. Inventory actions—such as placing orders or updating stock—are carried out through smart contracts that provide tamper-proof, verifiable enforcement. By employing a lightweight Proof of Authority (PoA) mechanism, transaction validation remains fast while maintaining transparency across all nodes in the network. This integration of quantum optimization with blockchain automation enables a responsive and trustworthy framework for modern inventory management.
Industrial engineering increasingly depends on solving large-scale optimization problems involving scheduling, routing, resource allocation, inventory control, energy management, and supply-chain coordination. Classical exact methods often become computationally expensive when problem size, uncertainty, and combinatorial complexity grow rapidly. Although practical quantum computers are still developing, quantum-inspired computing approaches have emerged as powerful alternatives that adapt principles from quantum mechanics to run on classical hardware. This paper investigates quantum-inspired computing approaches for complex optimization problems in industrial engineering. It examines methodologies including simulated annealing, tensor-network optimization, Ising formulations, quantum- inspired evolutionary algorithms, digital annealers, and hybrid classical-intelligent heuristics. Applications in production scheduling, facility layout, vehicle routing, maintenance planning, portfolio optimization, warehouse operations, and smart manufacturing are analyzed. Particular attention is given to solution quality, scalability, stochastic decision-making, real-time adaptability, and integration with Industry 4.0 data systems. Benefits include faster near-optimal solutions, improved operational efficiency, reduced energy consumption, and better responsiveness under uncertainty. Major challenges include formulation difficulty, parameter tuning, benchmarking inconsistency, interpretability, and transition barriers within traditional industrial workflows. A future roadmap is proposed involving hybrid quantum-classical ecosystems, AI- guided optimization engines, digital twins, and autonomous decision platforms. The paper concludes that quantum-inspired computing can deliver practical industrial value today by bridging the gap between conventional optimization and future quantum advantage, especially in environments where speed, flexibility, and complexity management are essential.