PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
December 6, 2025Scientific Reports3 citationsOpen Access

Quantum annealing-based route optimization for commercial AGV operating systems in large-scale logistics warehouses

View Full Paper
KMKosuke MatsuyamaKSKeisuke ShimizuEKEiji Kurimoto

Key Points

  • Quantum Annealing reduces sampling time by 28.2% compared to conventional methods, improving AGV routing efficiency.
  • Simulation results show the approach handles up to 10,000 variables while ensuring collision avoidance and safety.
  • The study introduces computational techniques for optimizing routing in large-scale AGV systems amidst growing logistics complexity.
  • Findings highlight scalability and practical applicability of the proposed methods in real-world warehouse environments.

Abstract

Abstract This study proposes a new approach to optimizing the routing of Automated Guided Vehicles (AGVs) in large-scale logistics warehouses using Quantum Annealing. As logistics operations grow, efficient AGV routing becomes critical for ensuring safety, reliability, and throughput, particularly in high-density environments. To address the complexity of real-world systems, we introduce an enhanced cost function that incorporates a real-time priority factor to improve both routing performance and operation safety. In this paper, we present a secure and computationally efficient candidate route generation method, along with an Optimization Problem Clustering technique that decomposes the large problem into smaller, tractable subproblems to reduce computational complexity. The proposed methods are designed to incorporate real-time operational data to ensure collision avoidance, maintain safe operations, and enhance routing efficiency in realistic large-scale warehouse environments. We validate the proposed methods using a state-of-the-art Quantum Annealing machine, benchmarking against both classical and quantum-inspired solvers. Integration with a commercial AGV Operating System (AOS) is demonstrated, enabling seamless connectivity with classical solvers via a local network and with Quantum Annealing and Quantum-inspired solvers via cloud infrastructure. Simulations involving 1000 AGVs show that the proposed route generation method reduces the number of optimization variables by an average of 96% for small-scale to medium-scale systems and 78% for large-scale systems, while also improving route quality. The clustering method reduces the maximum problem size to under 10,000 variables, enabling scalable and safe control of large AGV fleets. Furthermore, a complexity-based problem formulation reduces sampling time by approximately 28.2% compared to conventional size-based approaches for problems ranging from 1000 to 10,000 variables. These results demonstrate the practical viability of Quantum Annealing for managing large-scale AGV Operating Systems and underscore the potential of the proposed methods for advancing logistics optimization in real-world warehouse environments.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Matsuyama et al. (2025) studied this question.

synapsesocial.com/papers/69337cefb3f947a0a125a380https://doi.org/10.1038/s41598-025-28481-w
Ask AI
Helpful
Bookmark
Share
View Full Paper

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Optimization by Simulated Annealing1983 · 45,065 citations
  2. 2Benchmark of quantum-inspired heuristic solvers for quadratic unconstrained binary optimization2022 · 68 citations
  3. 3Applying the Hubbard-Stratonovich Transformation to Solve Scheduling Problems Under Inequality Constraints With Quantum Annealing2021 · 12 citations
  4. 4A Hybrid Solution Method for the Capacitated Vehicle Routing Problem Using a Quantum Annealer2019 · 192 citations
  5. 5Support vector machines on the D-Wave quantum annealer2019 · 183 citations