Evidence map›Paper›PMID 41331310›Full record

ArticleScientific reports2025

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

Thinh Nguyen Quang, Kosuke Matsuyama, Keisuke Shimizu, Hiroki Sugano, Eiji Kurimoto, Masahiro Miki, Jumpei Suzuki, Ziyi Chen, Hasitha Muthumala Waidyasooriya, Masanori Hariyama and 3 more

Abstract read
In one paragraph

Article in Scientific reports, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

13 authors.

Thinh Nguyen QuangSmart Business Solutions Division, Sharp Corporation, Nara, Japan. nguyenquang.thinh@mail.sharp.
Kosuke MatsuyamaSmart Business Solutions Division, Sharp Corporation, Nara, Japan.
Keisuke ShimizuSmart Business Solutions Division, Sharp Corporation, Nara, Japan.
Hiroki SuganoSmart Business Solutions Division, Sharp Corporation, Nara, Japan.
Eiji KurimotoSmart Business Solutions Division, Sharp Corporation, Nara, Japan.
Masahiro MikiSmart Business Solutions Division, Sharp Corporation, Nara, Japan.
Jumpei SuzukiSmart Business Solutions Division, Sharp Corporation, Nara, Japan.
Ziyi ChenSmart Business Solutions Division, Sharp Corporation, Nara, Japan.
Hasitha Muthumala WaidyasooriyaGraduate School of Information Sciences, Tohoku University, Miyagi, Japan.
Masanori HariyamaGraduate School of Information Sciences, Tohoku University, Miyagi, Japan.
Masaru HitomiGraduate School of Information Sciences, Tohoku University, Miyagi, Japan.
Kenta SawamuraGraduate School of Information Sciences, Tohoku University, Miyagi, Japan.
Masayuki OhzekiGraduate School of Information Sciences, Tohoku University, Miyagi, Japan.

Funding

New Energy and Industrial Technology Development Organization JPNP23003
6 · The paper itself

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.

Identifiers

PMID41331310
PMCPMC12714809

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.