Travel time optimization on multi-AGV routing by reverse annealing
Open accessThe DOI matches its Crossref record; 46 of the 46 references it cites were found in a registry or an index.
Abstract
Quantum annealing has been actively researched since D-Wave Systems produced the first commercial machine in 2011. Controlling a large fleet of automated guided vehicles is one of the real-world applications utilizing quantum annealing. In this study, we propose a formulation to control the traveling routes to minimize the travel time. We validate our formulation through simulation in a virtual plant and authenticate the effectiveness for faster distribution compared to a greedy algorithm that does not consider the overall detour distance. Furthermore, we utilize reverse annealing to maximize the advantage of the D-Wave’s quantum annealer. Starting from relatively good solutions obtained by a fast greedy algorithm, reverse annealing searches for better solutions around them. Our reverse annealing method improves the performance compared to standard quantum annealing alone and performs up to 10 times faster than a commercial classical solver, Gurobi. This study extends a use of optimization with general problem solvers in the application of multi-AGV systems and reveals the potential of reverse annealing as an optimizer.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Figures





Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source doesn’t support the claim as written.
In the citing paper
“Haba et al. 19 demonstrated that a classical solver (integer programming) could be faster than QA for small problems, e.g., ~100 decision variables.”
From Quantum annealing for combinatorial optimization: a benchmarking study (2025) · cites this paper as [19]
Checked by a reasoning model — may be wrong.
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Consequently, these benchmarking studies show that QA methods and their classical counterparts can exhibit similar solution quality and time complexity.”
From Quantum annealing for combinatorial optimization: a benchmarking study (2025) · cites this paper as [19]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“However,duetothelimitednumberofqubitsandtheirconnectivity, the QAhardwaredidnot show such an advantage over classical methods in past benchmarking studies.”
From Quantum annealing for combinatorial optimization: a benchmarking study (2025) · cites this paper as [19]
Experimental — accuracy not yet measuredThe check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“Whilepreviousbenchmarkingstudiesshowedsomeadvantages of QA, most used low-dimensional or the sparse con fi gurations of QUBO matrices due to the lack of available qubits in the QA hardware and poor topology to connect qubits 17 -19 .”
From Quantum annealing for combinatorial optimization: a benchmarking study (2025) · cites this paper as [19]
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Ising formulations of many NP problems
Lucas, A. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00005 · Cited by 2,512
Quantum annealing in the transverse Ising model
Kadowaki, T., & Nishimori, H. (1998) · Physical Review E · doi:10.1103/physreve.58.5355 · Cited by 2,339
An Automatic Method of Solving Discrete Programming Problems
Land, A. H., & Doig, A. G. (1960) · Econometrica · doi:10.2307/1910129 · Cited by 1,942
Quantum annealing with manufactured spins
Johnson, M. W., Amin, M. H. S., Gildert, S., Lanting, T., Hamze, F., Dickson, N., Harris, R., Berkley, A. J., Johansson, J., Bunyk, P., et al. (2011) · Nature · doi:10.1038/nature10012 · Cited by 1,891
Colloquium : Quantum annealing and analog quantum computation
Das, A., & Chakrabarti, B. K. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1061 · Cited by 700
Amin, M. H., Andriyash, E., Rolfe, J., Kulchytskyy, B., & Melko, R. (2018) · Physical Review X · doi:10.1103/physrevx.8.021050 · Cited by 520
Traffic Flow Optimization Using a Quantum Annealer
Neukart, F., Compostella, G., Seidel, C., von Dollen, D., Yarkoni, S., & Parney, B. (2017) · Frontiers in ICT · doi:10.3389/fict.2017.00029 · Cited by 458
Scheduling and routing algorithms for AGVs: A survey
Qiu, L., Hsu, W.-J., Huang, S.-Y., & Wang, H. (2002) · International Journal of Production Research · doi:10.1080/00207540110091712 · Cited by 402
Mathematical foundation of quantum annealing
Morita, S., & Nishimori, H. (2008) · Journal of Mathematical Physics · doi:10.1063/1.2995837 · Cited by 381
Research works printed but not linked: 2
- Ide, N., Asayama, T., Ueno, H. & Ohzeki, M. Maximum likelihood channel decoding with quantum annealing machine, in 2020 International Symposium on Information Theory and Its Applications (ISITA), 91–95 (2020).
- Maruyama, N., Ohzeki, M. & Tanaka, K. Graph minor embedding of degenerate systems in quantum annealing. arXiv:2110.10930 [quant-ph] (2021). · arXiv
Cited by
Quantum annealing for combinatorial optimization: a benchmarking study
Kim, S., Ahn, S.-W., Suh, I.-S., Dowling, A. W., Lee, E., & Luo, T. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01020-1 · Cited by 46
“Whilepreviousbenchmarkingstudiesshowedsomeadvantages ofQA,mostusedlow-dimensionalorthesparsecon fi gurations of QUBO matrices due to the lack of available qubits in the QA hardware and poor topology to connect qubits 17 – 19 .”
Routing and scheduling optimization for urban air mobility fleet management using quantum annealing
Haba, R., Mano, T., Ueda, R., Ebe, G., Takeda, K., Terabe, M., & Ohzeki, M. (2025) · Scientific Reports · doi:10.1038/s41598-025-86843-w · Cited by 34
Self-citationQuadratic Unconstrained Binary Formulation for Traffic Signal Optimization on Real-World Maps
Shikanai, R., Ohzeki, M., & Tanaka, K. (2025) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.94.024001 · Cited by 27
Self-citationEfficient Algorithm for Binary Quadratic Problem by Column Generation and Quantum Annealing
Hirama, S., & Ohzeki, M. (2023) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.92.113002 · Cited by 22
Self-citationHybrid quantum-classical computation for automatic guided vehicles scheduling
Śmierzchalski, T., Pawłowski, J., Przybysz, A., Pawela, Ł., Puchała, Z., Koniorczyk, M., Gardas, B., Deffner, S., & Domino, K. (2024) · Scientific Reports · doi:10.1038/s41598-024-72101-y · Cited by 21
Metadata
- Authors
- Haba, R., Ohzeki, M., & Tanaka, K.
- Affiliations
- Tohoku University (JP)
- Tokyo Institute of Technology (JP)
- Corresponding author
- Haba, Renichiro
- Venue
- Scientific Reports
- Published
- 2022-10-22
- Volume
- 12
- Issue
- 1
- Pages
- 17753-17753
- ISSN
- 2045-2322 (ISSN-L)
- PMC
- PMC9588084
- OpenAlex
- W4307137897
- Cited by
- 43
- References
- 43
- Citations by year
- 2026: 9 · 2025: 21 · 2024: 8 · 2023: 5
- FWCI
- 3.90
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- cc-by
- creativecommons.org/licenses/by/4.0 (tdm)
- creativecommons.org/licenses/by/4.0 (vor)
- Locations
- Scientific Reports (publishedVersion, cc-by)
- PubMed Central (publishedVersion, cc-by)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- arXiv (Cornell University)
- Funders
- JSPS KAKENHI (20H02168, 18H03303)
- JST-CREST (JPMJCR1402)
- MEXT-Quantum Leap Flagship Program (JPMXS0120352009)
- Topics
- Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Vehicle Routing Optimization Methods
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Advanced Manufacturing and Logistics Optimization
- Keywords
- automated guided vehicles, travel time minimization, reverse annealing, quantum annealing, D-Wave quantum annealer, hybrid quantum-classical optimization, greedy algorithm, detour distance
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Travel time optimization on multi-AGV routing by reverse annealing. https://app.cochat.ai/papers/10.1038/s41598-022-22704-0
- The paper
- Haba, R., Ohzeki, M., & Tanaka, K. (2022). Travel time optimization on multi-AGV routing by reverse annealing. Scientific Reports. https://doi.org/10.1038/s41598-022-22704-0
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.