Optimization Algorithm for Inventory Management on Classical, Quantum and Quantum-Hybrid Hardware

• URL: http://arxiv.org/abs/2411.11756v1
• Date: Mon, 18 Nov 2024 17:36:45 GMT
• Title: Optimization Algorithm for Inventory Management on Classical, Quantum and Quantum-Hybrid Hardware
• 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: We focus on optimizing item allocation in warehouses that use gravity flow racks, which are designed for First In, First Out (FIFO) logistics. We introduce a novel strategy formulated as a QUBO problem, suitable for classical, quantum, and hybrid hardware implementations.
• Score: 33.7054351451505
• License:
• Abstract: Among the challenges of efficiently managing a factory, inventory management is essential for minimizing operational costs and delivery times. In this paper, we focus on optimizing item allocation in warehouses that use gravity flow racks, which are designed for First In, First Out (FIFO) logistics but present challenges due to the need for frequent item reinsertions during picking operations. We introduce a novel strategy formulated as a QUBO problem, suitable for classical, quantum, and hybrid hardware implementations. By leveraging advances in Adiabatic Quantum Computing and Quantum Annealing, we demonstrate the effectiveness of our strategy through simulations and real-world scenarios. The results highlight the potential of quantum-hybrid approaches to significantly enhance operational efficiency in warehouse management.

Related papers

• 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)
• 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)
• 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)
• 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)
• 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)
• 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)

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.