Hybrid quantum-classical computation for automatic guided vehicles scheduling

• URL: http://arxiv.org/abs/2309.03088v2
• Date: Wed, 8 May 2024 08:25:03 GMT
• Title: Hybrid quantum-classical computation for automatic guided vehicles scheduling
• Authors: Tomasz Śmierzchalski, Łukasz Pawela, Zbigniew Puchała, Mátyás Koniorczyk, Bartłomiej Gardas, Sebastian Deffner, Krzysztof Domino,
• Abstract summary: State-of-the-art hybrid quantum-classical solvers are developed to address the business-centric optimization problem of scheduling Automatic Guided Vehicles. In our study, the hybrid solvers exhibit non-zero quantum processing times, indicating a significant contribution of the quantum component to solution efficiency. Our research paves the way for the near-future business adoption of hybrid quantum-classical solutions for AGV scheduling.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Motivated by global efforts to develop quantum computing for practical, industrial-scale challenges, we showcase the effectiveness of state-of-the-art hybrid quantum-classical solvers in addressing the business-centric optimization problem of scheduling Automatic Guided Vehicles (AGVs). These solvers leverage a noisy intermediate-scale quantum (NISQ) device, specifically a D-Wave quantum annealer. In our study, the hybrid solvers exhibit non-zero quantum processing times, indicating a significant contribution of the quantum component to solution efficiency. This hybrid methodology performs comparably to existing classical solvers, thus indicating `quantum readiness' for scheduling tasks. Our analysis focuses on a practical, business-oriented scenario: scheduling AGVs within a factory constrained by limited space, simulating a realistic production setting. Our new approach concerns mapping a realistic AGV problem onto a problem reminiscient of railway scheduling and demonstrating that the AGV problem more suits quantum computing than the railway counterpart and is more dense in terms of an average number of constraints per variable. We demonstrate that a scenario involving 15 AGVs, which holds practical significance due to common bottlenecks like shared main lanes leading to frequent deadlocks, can be efficiently addressed by a hybrid quantum-classical solver within seconds. Consequently, our research paves the way for the near-future business adoption of hybrid quantum-classical solutions for AGV scheduling, anticipating that forthcoming improvements in manufacturing efficiency will increase both the number of AGVs deployed and the premium on factory space.

Related papers

• A Hybrid Quantum-Classical Approach to the Electric Mobility Problem [0.8796261172196743]
  We suggest a hybrid quantum-classical routine for the NP-hard Electric Vehicle Fleet Charging and Allocation Problem. We benchmark the performance of the decomposition technique with classical and quantum-inspired metaheuristics. The major advantage of the proposed approach is that it enables quantum-based methods for this realistic problem with many inequality constraints.
  arXiv  Detail & Related papers  (2023-10-04T12:14:56Z)
• Solving rescheduling problems in heterogeneous urban railway networks using hybrid quantum-classical approach [0.16874375111244325]
  We address the applicability of hybrid quantum-classical solvers for practical railway rescheduling management problems. We build an integer linear model for the given problem and solve it with D-Wave's quantum-classical hybrid solver. The proposed approach is demonstrated on a real-life heterogeneous urban network in Poland.
  arXiv  Detail & Related papers  (2023-09-13T07:19:32Z)
• 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 Annealing for Single Image Super-Resolution [86.69338893753886]
  We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem. The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
  arXiv  Detail & Related papers  (2023-04-18T11:57:15Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• Supply Chain Logistics with Quantum and Classical Annealing Algorithms [0.0]
  Noisy intermediate-scale quantum (NISQ) hardware is almost universally incompatible with full-scale optimization problems of practical importance. We investigate a problem of substantial commercial value, multi-truck vehicle routing for supply chain logistics, at the scale used by a corporation in their operations. Our work gives a set of techniques that can be adopted in contexts beyond vehicle routing to apply NISQ devices in a hybrid fashion to large-scale problems of commercial interest.
  arXiv  Detail & Related papers  (2022-05-09T17:36:21Z)
• Reducing the cost of energy estimation in the variational quantum eigensolver algorithm with robust amplitude estimation [50.591267188664666]
  Quantum chemistry and materials is one of the most promising applications of quantum computing. Much work is still to be done in matching industry-relevant problems in these areas with quantum algorithms that can solve them.
  arXiv  Detail & Related papers  (2022-03-14T16:51:36Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)
• Quantum computing approach to railway dispatching and conflict management optimization on single-track railway lines [0.4724825031148411]
  We consider a practical railway dispatching problem: delay and conflict management on a single-track railway line. We introduce a quadratic unconstrained binary optimization (QUBO) model of the problem in question, compatible with the emerging quantum annealing technology. As a proof-of-concept, we solve selected real-life problems from the Polish railway network using D-Wave quantum annealers.
  arXiv  Detail & Related papers  (2020-10-16T08:17:57Z)

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.