Searcharxiv⌕ Search

arXiv subjects

Paulo C. C. Bezerra

Publications and source records attributed to Paulo C. C. Bezerra.

2 recordsLinked to original sources

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

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.

quant-ph↗

Warehouse optimization using a trapped-ion quantum processor

Warehouse optimization stands as a critical component for enhancing operational efficiency within the industrial sector. By strategically streamlining warehouse operations, organizations can achieve significant reductions in logistical costs such as the necessary footprint or traveled path, and markedly improve overall workflow efficiency including retrieval times or storage time. Despite the availability of numerous algorithms designed to identify optimal solutions for such optimization challenges, certain scenarios demand computational resources that exceed the capacities of conventional computing systems. In this context, we adapt a formulation of a warehouse optimization problem specifically tailored as a binary optimization problem and implement it in a trapped-ion quantum computer.

quant-ph↗