Optimization Algorithm for Inventory Allocation in Gravity-Flow Racks with Classical and Quantum-Hybrid Computing

• URL: http://arxiv.org/abs/2411.11756v2
• Date: Wed, 05 Nov 2025 21:18:33 GMT
• Title: Optimization Algorithm for Inventory Allocation in Gravity-Flow Racks with Classical and Quantum-Hybrid Computing
• Authors: 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-Boas,
• Abstract summary: Warehouses play a central role in industrial logistics, functioning as critical hubs for storing and organizing inventory to support efficient production.<n>We address the optimization of inventory allocation in warehouses equipped with gravity-flow racks, which are designed for First In, First Out (FIFO) logistics.<n>We propose an optimization strategy that simultaneously allocates multiple items, determining their placement across available shelves in a single decision step.
• Score: 31.458406135473805
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Constraint-Aware Quantum Optimization via Hamming Weight Operators [1.1463843149836523]
  Constrained optimization with strict linear constraints underpins applications in drug discovery, power grids, logistics, and finance.<n>We introduce Hamming Weight Operators, a new class of constraint-aware operators that confine quantum evolution strictly within the feasible subspace.<n>We validate our approach on benchmark tasks from both finance and high-energy physics, specifically portfolio optimization and two-jet clustering with energy balance.
  arXiv  Detail & Related papers  (2026-01-04T12:58:04Z)
• Optimizing Fairness in Production Planning: A Human-Centric Approach to Machine and Workforce Allocation [55.71151342699622]
  The proposed system is validated through 16 test sessions with domain experts from the automotive industry.<n>Results indicate that the CP-based scheduling approach produces compact, feasible production plans with low tardiness.
  arXiv  Detail & Related papers  (2025-10-01T16:41:18Z)
• QFOR: A Fidelity-aware Orchestrator for Quantum Computing Environments using Deep Reinforcement Learning [19.006907700170693]
  Quantum cloud computing enables remote access to quantum processors, yet the heterogeneity and noise of quantum hardware complicates resource orchestration.<n>Here, we propose QFOR, a Quantum Fidelityaware Orchestration of tasks across heterogeneous quantum nodes in cloud-based environments using Deep Reinforcement learning.<n>Our framework balances overall quantum task execution fidelity and time, enabling adaptation to different operational priorities.
  arXiv  Detail & Related papers  (2025-08-07T02:00:50Z)
• Quantum Annealing Hyperparameter Analysis for Optimal Sensor Placement in Production Environments [39.58317527488534]
  We show how quantum computing could contribute to cost-efficient, large-scale optimization problems once the hardware matures.<n>We transform the problem into a quadratic unconstrained binary optimization formulation with one-hot and binary encoding.<n>Our results demonstrate that quantum annealing is capable of solving instances derived from real-world scenarios.
  arXiv  Detail & Related papers  (2025-07-22T13:35:51Z)
• Unlocking early fault-tolerant quantum computing with mitigated magic dilution [47.23243191431113]
  We introduce mitigated magic dilution (MMD) as an approach to synthesise small-angle rotations.<n>We employ quantum error mitigation techniques to sample logical circuits given noisy encoded magic states.<n>This work paves the way for early fault-tolerant demonstrations on devices supporting millions of quantum operations.
  arXiv  Detail & Related papers  (2025-05-15T17:19:19Z)
• Preference Optimization for Combinatorial Optimization Problems [54.87466279363487]
  Reinforcement Learning (RL) has emerged as a powerful tool for neural optimization, enabling models learns that solve complex problems without requiring expert knowledge.<n>Despite significant progress, existing RL approaches face challenges such as diminishing reward signals and inefficient exploration in vast action spaces.<n>We propose Preference Optimization, a novel method that transforms quantitative reward signals into qualitative preference signals via statistical comparison modeling.
  arXiv  Detail & Related papers  (2025-05-13T16:47:00Z)
• Leveraging Robust Optimization for LLM Alignment under Distribution Shifts [51.74394601039711]
  Preference alignment methods are increasingly critical for steering large language models to generate outputs consistent with human values.<n>We propose a novel distribution-aware optimization framework that improves preference alignment despite such shifts.
  arXiv  Detail & Related papers  (2025-04-08T09:14:38Z)
• Application of quantum annealing for scalable robotic assembly line optimization: a case study [0.40498500266986387]
  We investigate applying quantum computing to the real-world based problem of Robotic Assembly Line Balancing (RALB) We transform the integer programming formulation into a quadratic unconstrained binary optimization problem, which is then solved using a hybrid quantum-classical algorithm on the D-Wave Advantage 4.1 quantum computer. In a case study, the quantum solution is compared to an exact solution, demonstrating the potential for quantum computing to enhance manufacturing productivity and reduce costs.
  arXiv  Detail & Related papers  (2024-12-12T12:49:34Z)
• Warehouse optimization using a trapped-ion quantum processor [30.432877421232842]
  We adapt a formulation of a warehouse optimization problem specifically tailored as a binary optimization problem. We implement it in a trapped-ion quantum computer.
  arXiv  Detail & Related papers  (2024-11-26T16:36:48Z)
• Exploring Utility in a Real-World Warehouse Optimization Problem: Formulation Based on Quantum Annealers and Preliminary Results [0.44241702149260353]
  We present a mechanism coined as Quantum Initialization for Warehouse Optimization Problem that resorts to D-Wave's Quantum Annealer. The module has been specifically designed to be embedded into already existing classical software dedicated to the optimization of a real-world industrial problem.
  arXiv  Detail & Related papers  (2024-09-15T11:58:07Z)
• Analyzing and Enhancing the Backward-Pass Convergence of Unrolled Optimization [50.38518771642365]
  The integration of constrained optimization models as components in deep networks has led to promising advances on many specialized learning tasks. A central challenge in this setting is backpropagation through the solution of an optimization problem, which often lacks a closed form. This paper provides theoretical insights into the backward pass of unrolled optimization, showing that it is equivalent to the solution of a linear system by a particular iterative method. A system called Folded Optimization is proposed to construct more efficient backpropagation rules from unrolled solver implementations.
  arXiv  Detail & Related papers  (2023-12-28T23:15:18Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Elastic Entangled Pair and Qubit Resource Management in Quantum Cloud Computing [73.7522199491117]
  Quantum cloud computing (QCC) offers a promising approach to efficiently provide quantum computing resources. The fluctuations in user demand and quantum circuit requirements are challenging for efficient resource provisioning. We propose a resource allocation model to provision quantum computing and networking resources.
  arXiv  Detail & Related papers  (2023-07-25T00:38:46Z)
• Formulation of the Electric Vehicle Charging and Routing Problem for a Hybrid Quantum-Classical Search Space Reduction Heuristic [0.0]
  We show how to exploit multilevel carriers of quantum information -- qudits -- for the construction of constrained quantum optimization algorithms. We propose a hybrid classical quantum strategy that allows us to sample constrained solutions while greatly reducing the search space of the problem.
  arXiv  Detail & Related papers  (2023-06-07T13:16:15Z)
• Maximize to Explore: One Objective Function Fusing Estimation, Planning, and Exploration [87.53543137162488]
  We propose an easy-to-implement online reinforcement learning (online RL) framework called textttMEX. textttMEX integrates estimation and planning components while balancing exploration exploitation automatically. It can outperform baselines by a stable margin in various MuJoCo environments with sparse rewards.
  arXiv  Detail & Related papers  (2023-05-29T17:25:26Z)
• Quantum Computing Applications for Flight Trajectory Optimization [5.858783038624031]
  Flight path optimization is an essential operation within the aerospace engineering domain with important ecological and economic considerations. In recent years, the quantum computing field has made significant strides, paving the way for improved performance over classical algorithms. We present our results from running the quantum algorithms on IBM hardware and discuss potential approaches to accelerate the incorporation of quantum algorithms within the problem domain.
  arXiv  Detail & Related papers  (2023-04-27T18:09:45Z)
• Multiobjective variational quantum optimization for constrained problems: an application to Cash Management [45.82374977939355]
  We introduce a new method for solving optimization problems with challenging constraints using variational quantum algorithms. We test our proposal on a real-world problem with great relevance in finance: the Cash Management problem. Our empirical results show a significant improvement in terms of the cost of the achieved solutions, but especially in the avoidance of local minima.
  arXiv  Detail & Related papers  (2023-02-08T17:09:20Z)
• Quantum Computing Methods for Supply Chain Management [9.793022720627066]
  We focus on applying quantum computing to operations management problems in industry. We develop a quantized policy iteration algorithm to solve an inventory control problem. Our simulations and experiments are powered by the IBM Qiskit and the qBraid system.
  arXiv  Detail & Related papers  (2022-09-17T05:00:33Z)
• DQC$^2$O: Distributed Quantum Computing for Collaborative Optimization in Future Networks [54.03701670739067]
  We propose an adaptive distributed quantum computing approach to manage quantum computers and quantum channels for solving optimization tasks in future networks. Based on the proposed approach, we discuss the potential applications for collaborative optimization in future networks, such as smart grid management, IoT cooperation, and UAV trajectory planning.
  arXiv  Detail & Related papers  (2022-09-16T02:44:52Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• Deep Policy Iteration with Integer Programming for Inventory Management [8.27175065641495]
  We present a framework for optimizing long-term discounted reward problems with large accessible action space and state dependent constraints.<n>Our proposed Programmable Actor Reinforcement Learning (PARL) uses a deep-policy method that leverages neural networks (NNs) to approximate the value function.<n>We benchmark the proposed algorithm against state-of-the-art RL algorithms and commonly used replenishments and find it considerably outperforms existing methods by as much as 14.7% on average.
  arXiv  Detail & Related papers  (2021-12-04T01:40:34Z)
• A Case Study on Optimization of Warehouses [2.2101681534594237]
  In warehouses, order picking is known to be the most labor-intensive and costly task in which the employees account for a large part of the warehouse performance. In this work, we aim at optimizing the storage assignment and the order picking problem within mezzanine warehouse with regards to their reciprocal influence.
  arXiv  Detail & Related papers  (2021-11-23T07:22:57Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• Space-efficient binary optimization for variational computing [68.8204255655161]
  We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem. We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
  arXiv  Detail & Related papers  (2020-09-15T18:17:27Z)
• Combining Deep Learning and Optimization for Security-Constrained Optimal Power Flow [94.24763814458686]
  Security-constrained optimal power flow (SCOPF) is fundamental in power systems. Modeling of APR within the SCOPF problem results in complex large-scale mixed-integer programs. This paper proposes a novel approach that combines deep learning and robust optimization techniques.
  arXiv  Detail & Related papers  (2020-07-14T12:38:21Z)
• Intelligent Warehouse Allocator for Optimal Regional Utilization [0.0]
  We use machine learning and optimization methods to build an efficient solution to this warehouse allocation problem. We conduct a back-testing by using this solution and validate the efficiency of this model by demonstrating a significant uptick in two key metrics Regional Utilization (RU) and Percentage Two-day-delivery (2DD)
  arXiv  Detail & Related papers  (2020-07-09T21:46:15Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.