{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,13]],"date-time":"2026-11-13T03:50:04Z","timestamp":1794541804334,"version":"4.9.1"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,9,18]],"date-time":"2024-09-18T00:00:00Z","timestamp":1726617600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,9,18]],"date-time":"2024-09-18T00:00:00Z","timestamp":1726617600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004281","name":"Narodowe Centrum Nauki","doi-asserted-by":"publisher","award":["2020\/38\/E\/ST3\/00269"],"award-info":[{"award-number":["2020\/38\/E\/ST3\/00269"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001870","name":"Fundacja na rzecz Nauki Polskiej","doi-asserted-by":"publisher","award":["TEAM NET POIR.04.04.00-00- 17C1\/18-00"],"award-info":[{"award-number":["TEAM NET POIR.04.04.00-00- 17C1\/18-00"]}],"id":[{"id":"10.13039\/501100001870","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Ministry of Culture and Innovation and the National Research, Development and Innovation Office within the Quantum Information National Laboratory of Hungary","award":["Grant No. 2022-2.1.1-NL-2022-00004"],"award-info":[{"award-number":["Grant No. 2022-2.1.1-NL-2022-00004"]}]},{"DOI":"10.13039\/100000925","name":"John Templeton Foundation","doi-asserted-by":"publisher","award":["Grant No. 62422."],"award-info":[{"award-number":["Grant No. 62422."]}],"id":[{"id":"10.13039\/100000925","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004442","name":"Narodowym Centrum Nauki","doi-asserted-by":"publisher","award":["2022\/47\/B\/ST6\/02380"],"award-info":[{"award-number":["2022\/47\/B\/ST6\/02380"]}],"id":[{"id":"10.13039\/501100004442","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci Rep"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Motivated by recent efforts to develop quantum computing for practical, industrial-scale challenges, we demonstrate the effectiveness of state-of-the-art hybrid (not necessarily quantum) solvers in addressing the business-centric optimization problem of scheduling Automatic Guided Vehicles (AGVs). Some solvers can already leverage noisy intermediate-scale quantum (NISQ) devices. In our study, we utilize D-Wave hybrid solvers that implement classical heuristics with potential assistance from a quantum processing unit. This hybrid methodology performs comparably to existing classical solvers. However, due to the proprietary nature of the software, the precise contribution of quantum computation remains unclear. Our analysis focuses on a practical, business-oriented scenario: scheduling AGVs within a factory constrained by limited space, simulating a realistic production setting. Our approach maps a realistic AGVs problem onto one reminiscent of railway scheduling and demonstrates that the AGVs problem is better suited to quantum computing than its railway counterpart, the latter being denser in terms of the average number of constraints per variable. The main idea here is to highlight the potential usefulness of a hybrid approach for handling AGVs scheduling problems of practical sizes. We show that a scenario involving up to 21 AGVs, significant due to possible deadlocks, can be efficiently addressed by a hybrid solver in seconds.<\/jats:p>","DOI":"10.1038\/s41598-024-72101-y","type":"journal-article","created":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T18:55:51Z","timestamp":1726772151000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Hybrid quantum-classical computation for automatic guided vehicles scheduling"],"prefix":"10.1038","volume":"14","author":[{"given":"Tomasz","family":"\u015amierzchalski","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jakub","family":"Paw\u0142owski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Artur","family":"Przybysz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"\u0141ukasz","family":"Pawela","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zbigniew","family":"Pucha\u0142a","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M\u00e1ty\u00e1s","family":"Koniorczyk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bart\u0142omiej","family":"Gardas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sebastian","family":"Deffner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Krzysztof","family":"Domino","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,9,18]]},"reference":[{"key":"72101_CR1","doi-asserted-by":"publisher","unstructured":"Shor, P.\u00a0W. Algorithms for quantum computation: discrete logarithms and factoring. In Proceedings 35th annual symposium on foundations of computer science, 124\u2013134. https:\/\/doi.org\/10.1109\/SFCS.1994.365700 (IEEE, 1994).","DOI":"10.1109\/SFCS.1994.365700"},{"key":"72101_CR2","unstructured":"Preskill, J. Quantum computing and the entanglement frontier. arXiv preprint[SPACE]arXiv:1203.5813 (2012)."},{"key":"72101_CR3","doi-asserted-by":"publisher","first-page":"79","DOI":"10.22331\/q-2018-08-06-79","volume":"2","author":"J Preskill","year":"2018","unstructured":"Preskill, J. Quantum computing in the NISQ era and beyond. Quantum 2, 79. https:\/\/doi.org\/10.22331\/q-2018-08-06-79 (2018).","journal-title":"Quantum"},{"key":"72101_CR4","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1038\/d41586-019-02936-3","volume":"574","author":"M Brooks","year":"2019","unstructured":"Brooks, M. Beyond quantum supremacy: The hunt for useful quantum computers. Nature 574, 19\u201321. https:\/\/doi.org\/10.1038\/d41586-019-02936-3 (2019).","journal-title":"Nature"},{"key":"72101_CR5","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1038\/s41586-019-1666-5","volume":"574","author":"F Arute","year":"2019","unstructured":"Arute, F. et al. Quantum supremacy using a programmable superconducting processor. Nature 574, 505\u2013510. https:\/\/doi.org\/10.1038\/s41586-019-1666-5 (2019).","journal-title":"Nature"},{"key":"72101_CR6","doi-asserted-by":"publisher","first-page":"191","DOI":"10.3390\/e25020191","volume":"25","author":"K Domino","year":"2023","unstructured":"Domino, K. et al. Quantum annealing in the NISQ era: railway conflict management. Entropy 25, 191. https:\/\/doi.org\/10.3390\/e25020191 (2023).","journal-title":"Entropy"},{"key":"72101_CR7","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevApplied.14.034009","volume":"14","author":"P Vikst\u0142","year":"2020","unstructured":"Vikst\u0142, P. et al. Applying the quantum approximate optimization algorithm to the tail-assignment problem. Phys. Rev. Appl. 14, 034009. https:\/\/doi.org\/10.1103\/PhysRevApplied.14.034009 (2020).","journal-title":"Phys. Rev. Appl."},{"key":"72101_CR8","doi-asserted-by":"publisher","unstructured":"Geitz, M., Grozea, C., Steigerwald, W., St\u00f6hr, R. & Wolf, A. Solving the Extended Job Shop Scheduling Problem with AGVs\u2013Classical and Quantum Approaches. In International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research, pp. 120\u2013137. https:\/\/doi.org\/10.1007\/978-3-030-19212-9 (Springer, 2022).","DOI":"10.1007\/978-3-030-19212-9"},{"key":"72101_CR9","unstructured":"Katzgraber, H. Searching for applications of quantum computing in industry. Bull. Am. Phys. Soc. (2024). https:\/\/meetings.aps.org\/Meeting\/MAR24\/Session\/Y49.1."},{"key":"72101_CR10","unstructured":"D-Wave Systems Inc. Hybrid Solver for Quadratic Optimization [WhitePaper] (2022). https:\/\/www.dwavesys.com\/media\/soxph512\/hybrid-solvers-for-quadratic-optimization.pdf, visited 2023.08.31"},{"key":"72101_CR11","doi-asserted-by":"publisher","first-page":"3802","DOI":"10.1080\/00207543.2018.1504248","volume":"57","author":"DA Rossit","year":"2019","unstructured":"Rossit, D. A., Tohm\u00e9, F. & Frutos, M. Industry 4.0: smart scheduling. Int. J. Prod. Res. 57, 3802\u20133813. https:\/\/doi.org\/10.1080\/00207543.2018.1504248 (2019).","journal-title":"Int. J. Prod. Res."},{"key":"72101_CR12","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1016\/j.procir.2016.01.129","volume":"40","author":"T Stock","year":"2016","unstructured":"Stock, T. Opportunities of sustainable manufacturing in industry 4.0. Proc. CIRP 40, 536\u2013541. https:\/\/doi.org\/10.1016\/j.procir.2016.01.129 (2016).","journal-title":"Proc. CIRP"},{"key":"72101_CR13","doi-asserted-by":"publisher","first-page":"3534","DOI":"10.1109\/TII.2018.2824324","volume":"14","author":"Y Luo","year":"2018","unstructured":"Luo, Y., Duan, Y., Li, W., Pace, P. & Fortino, G. A novel mobile and hierarchical data transmission architecture for smart factories. IEEE Trans. Industr. Inf. 14, 3534\u20133546. https:\/\/doi.org\/10.1109\/TII.2018.2824324 (2018).","journal-title":"IEEE Trans. Industr. Inf."},{"key":"72101_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106371","volume":"142","author":"M Zhong","year":"2020","unstructured":"Zhong, M., Yang, Y., Dessouky, Y. & Postolache, O. Multi-AGV scheduling for conflict-free path planning in automated container terminals. Comput. Ind. Eng. 142, 106371. https:\/\/doi.org\/10.1016\/j.cie.2020.106371 (2020).","journal-title":"Comput. Ind. Eng."},{"key":"72101_CR15","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1080\/00207540110091712","volume":"40","author":"L Qiu","year":"2002","unstructured":"Qiu, L., Hsu, W.-J., Huang, S.-Y. & Wang, H. Scheduling and routing algorithms for AGVs: A survey. Int. J. Prod. Res. 40, 745\u2013760. https:\/\/doi.org\/10.1080\/00207540110091712 (2002).","journal-title":"Int. J. Prod. Res."},{"key":"72101_CR16","doi-asserted-by":"crossref","unstructured":"Vivaldini, K.\u00a0C., Rocha, L.\u00a0F., Becker, M. & Moreira, A.\u00a0P. Comprehensive review of the dispatching, scheduling and routing of AGVs. In CONTROLO\u20192014\u2013proceedings of the 11th Portuguese conference on automatic control, 505\u2013514 (Springer, 2015).","DOI":"10.1007\/978-3-319-10380-8_48"},{"key":"72101_CR17","unstructured":"Le-Anh, T. Intelligent control of vehicle-based internal transport systems. 51 (Erasmus University Rotterdam, 2005). http:\/\/hdl.handle.net\/1765\/6554."},{"key":"72101_CR18","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/S0377-2217(99)00311-2","volume":"126","author":"I Sabuncuoglu","year":"2000","unstructured":"Sabuncuoglu, I. & Bay\u0131z, M. Analysis of reactive scheduling problems in a job shop environment. Eur. J. Oper. Res. 126, 567\u2013586. https:\/\/doi.org\/10.1016\/S0377-2217(99)00311-2 (2000).","journal-title":"Eur. J. Oper. Res."},{"key":"72101_CR19","doi-asserted-by":"publisher","first-page":"4533","DOI":"10.1007\/s12652-018-1137-0","volume":"10","author":"G Li","year":"2019","unstructured":"Li, G., Li, X., Gao, L. & Zeng, B. Tasks assigning and sequencing of multiple AGVs based on an improved harmony search algorithm. J. Ambient. Intell. Humaniz. Comput. 10, 4533\u20134546. https:\/\/doi.org\/10.1007\/s12652-018-1137-0 (2019).","journal-title":"J. Ambient. Intell. Humaniz. Comput."},{"key":"72101_CR20","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2023.3295348","author":"Y-I Kim","year":"2023","unstructured":"Kim, Y.-I. & Reveliotis, S. A heuristic approach to the problem of min-time coverage in constricted environments. IEEE Trans. Control Netw. Syst.[SPACE]https:\/\/doi.org\/10.1109\/TCNS.2023.3295348 (2023).","journal-title":"IEEE Trans. Control Netw. Syst."},{"key":"72101_CR21","doi-asserted-by":"publisher","first-page":"12205","DOI":"10.1038\/s41598-024-62821-6","volume":"14","author":"L Tang","year":"2024","unstructured":"Tang, L., Yang, C., Wen, K., Wu, W. & Guo, Y. Quantum computing for several agv scheduling models. Sci. Rep. 14, 12205. https:\/\/doi.org\/10.1038\/s41598-024-62821-6 (2024).","journal-title":"Sci. Rep."},{"key":"72101_CR22","doi-asserted-by":"crossref","unstructured":"Haba, R., Ohzeki, M. & Tanaka, K. Travel time optimization on multi-AGV routing by reverse annealing. arXiv preprint[SPACE]arXiv:2204.11789 (2022).","DOI":"10.1038\/s41598-022-22704-0"},{"key":"72101_CR23","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1609\/socs.v7i1.18390","volume":"7","author":"T Tran","year":"2016","unstructured":"Tran, T. et al. A hybrid quantum-classical approach to solving scheduling problems. In Proceedings of the International Symposium on Combinatorial Search 7, 98\u2013106. https:\/\/doi.org\/10.1609\/socs.v7i1.18390 (2016).","journal-title":"In Proceedings of the International Symposium on Combinatorial Search"},{"key":"72101_CR24","doi-asserted-by":"publisher","first-page":"13","DOI":"10.3389\/fict.2019.00013","volume":"6","author":"S Feld","year":"2019","unstructured":"Feld, S. et al. A hybrid solution method for the capacitated vehicle routing problem using a quantum annealer. Front. ICT 6, 13. https:\/\/doi.org\/10.3389\/fict.2019.00013 (2019).","journal-title":"Front. ICT"},{"key":"72101_CR25","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0304-4149(89)90040-9","volume":"33","author":"B Apolloni","year":"1989","unstructured":"Apolloni, B., Carvalho, C. & De Falco, D. Quantum stochastic optimization. Stoch. Process. Appl. 33, 233\u2013244. https:\/\/doi.org\/10.1016\/0304-4149(89)90040-9 (1989).","journal-title":"Stoch. Process. Appl."},{"key":"72101_CR26","doi-asserted-by":"publisher","first-page":"5355","DOI":"10.1103\/PhysRevE.58.5355","volume":"58","author":"T Kadowaki","year":"1998","unstructured":"Kadowaki, T. & Nishimori, H. Quantum annealing in the transverse using model. Phys. Rev. E 58, 5355. https:\/\/doi.org\/10.1103\/PhysRevE.58.5355 (1998).","journal-title":"Phys. Rev. E"},{"key":"72101_CR27","unstructured":"Farhi, E., Goldstone, J., Gutmann, S. & Sipser, M. Quantum Computation by Adiabatic Evolution. arXiv preprint [SPACE]arXiv:quant-ph\/0001106 (2000)."},{"key":"72101_CR28","volume-title":"Quantum spin glasses, annealing and computation","author":"S Tanaka","year":"2017","unstructured":"Tanaka, S., Tamura, R. & Chakrabarti, B. K. Quantum spin glasses, annealing and computation (University Press, Cambridge, 2017)."},{"key":"72101_CR29","doi-asserted-by":"publisher","first-page":"5","DOI":"10.3389\/fphy.2014.00005","volume":"2","author":"A Lucas","year":"2014","unstructured":"Lucas, A. Ising formulations of many NP problems. Front. Phys. 2, 5. https:\/\/doi.org\/10.3389\/fphy.2014.00005 (2014).","journal-title":"Front. Phys."},{"key":"72101_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-019-2213-x","volume":"18","author":"S Karimi","year":"2019","unstructured":"Karimi, S. & Ronagh, P. Practical integer-to-binary mapping for quantum annealers. Quant. Inf. Process. 18, 1\u201324. https:\/\/doi.org\/10.1007\/s11128-019-2213-x (2019).","journal-title":"Quant. Inf. Process."},{"key":"72101_CR31","doi-asserted-by":"publisher","first-page":"81032","DOI":"10.1109\/ACCESS.2021.3081685","volume":"9","author":"K Tamura","year":"2021","unstructured":"Tamura, K., Shirai, T., Katsura, H., Tanaka, S. & Togawa, N. Performance comparison of typical binary-integer encodings in an using machine. IEEE Access 9, 81032\u201381039 (2021).","journal-title":"IEEE Access"},{"key":"72101_CR32","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10479-022-04634-2","volume":"314","author":"F Glover","year":"2022","unstructured":"Glover, F., Kochenberger, G., Hennig, R. & Du, Y. Quantum bridge analytics i: a tutorial on formulating and using qubo models. Ann. Oper. Res. 314, 141\u2013183 (2022).","journal-title":"Ann. Oper. Res."},{"key":"72101_CR33","doi-asserted-by":"publisher","unstructured":"Karimi, S. & Ronagh, P. A subgradient approach for constrained binary optimization via quantum adiabatic evolution. Quant. Inf. Process 16. https:\/\/doi.org\/10.1007\/s11128-017-1639-2 (2017).","DOI":"10.1007\/s11128-017-1639-2"},{"key":"72101_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2021.100622","volume":"44","author":"N Gusmeroli","year":"2022","unstructured":"Gusmeroli, N. & Wiegele, A. EXPEDIS: An exact penalty method over discrete sets. Discret. Optim. 44, 100622. https:\/\/doi.org\/10.1016\/j.disopt.2021.100622 (2022).","journal-title":"Discret. Optim."},{"key":"72101_CR35","unstructured":"Quintero\u00a0Ospina, R.\u00a0A., Zuluaga, L., Terlaky, T. & Vera, J. Polyhedral structure of penalty constants in quadratic unconstrained binary optimization and applications to quantum computing. In APS March Meeting Abstracts, vol. 2023, B70\u2013007 (2023). https:\/\/ui.adsabs.harvard.edu\/abs\/2023APS..MARB70007Q."},{"key":"72101_CR36","doi-asserted-by":"publisher","unstructured":"Garc\u00eda, M.\u00a0D., Ayodele, M. & Moraglio, A. Exact and sequential penalty weights in quadratic unconstrained binary optimisation with a digital annealer. In Proceedings of the Genetic and Evolutionary Computation Conference Companion, 184\u2013187, https:\/\/doi.org\/10.1145\/3520304.3528925 (2022).","DOI":"10.1145\/3520304.3528925"},{"key":"72101_CR37","unstructured":"D-Wave Systems Inc. QPU-Specific Physical Properties: Advantage_system6.2 (2023)."},{"key":"72101_CR38","unstructured":"D-Wave Systems Inc. Hybrid Solver for Constrained Quadratic Model [WhitePaper] (2022). https:\/\/www.dwavesys.com\/media\/rldh2ghw\/14-1055a-a_hybrid_solver_for_constrained_quadratic_models.pdf, visited 2023.08.31"},{"key":"72101_CR39","unstructured":"Koniorczyk, M., Krawiec, K., Botelho, L., Be\u0161inovi\u0107, N. & Domino, K. Solving rescheduling problems in heterogeneous urban railway networks using hybrid quantum-classical approach. arXiv preprint[SPACE]arXiv:2309.06763 (2023)."},{"key":"72101_CR40","doi-asserted-by":"publisher","first-page":"4053","DOI":"10.1080\/002075499189925","volume":"37","author":"C Kim","year":"1999","unstructured":"Kim, C., Tanchoco, J. & Koo, P.-H. AGV dispatching based on workload balancing. Int. J. Prod. Res. 37, 4053\u20134066. https:\/\/doi.org\/10.1080\/002075499189925 (1999).","journal-title":"Int. J. Prod. Res."},{"key":"72101_CR41","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0965-8564(95)00011-9","volume":"30","author":"JJ Evers","year":"1996","unstructured":"Evers, J. J. & Koppers, S. A. Automated guided vehicle traffic control at a container terminal. Transp. Res. Part A Policy Pract. 30, 21\u201334. https:\/\/doi.org\/10.1016\/0965-8564(95)00011-9 (1996).","journal-title":"Transp. Res. Part A Policy Pract."},{"key":"72101_CR42","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0166-3615(99)00068-8","volume":"42","author":"Y-C Ho","year":"2000","unstructured":"Ho, Y.-C. A dynamic-zone strategy for vehicle-collision prevention and load balancing in an AGV system with a single-loop guide path. Comput. Ind. 42, 159\u2013176. https:\/\/doi.org\/10.1016\/S0166-3615(99)00068-8 (2000).","journal-title":"Comput. Ind."},{"key":"72101_CR43","doi-asserted-by":"publisher","unstructured":"Pinedo, M.\u00a0L. Scheduling, vol.\u00a029 (Springer, 2012). https:\/\/doi.org\/10.1007\/978-1-4614-2361-4.","DOI":"10.1007\/978-1-4614-2361-4"},{"key":"72101_CR44","doi-asserted-by":"publisher","unstructured":"Cai, J., Macready, W.\u00a0G. & Roy, A. A practical heuristic for finding graph minors. https:\/\/doi.org\/10.48550\/arXiv.1406.2741. arXiv preprint[SPACE]arXiv:1406.2741. (2014).","DOI":"10.48550\/arXiv.1406.2741"},{"key":"72101_CR45","doi-asserted-by":"publisher","first-page":"2389","DOI":"10.1016\/j.dam.2012.06.004","volume":"160","author":"J Darlay","year":"2012","unstructured":"Darlay, J., Brauner, N. & Moncel, J. Dense and sparse graph partition. Discret. Appl. Math. 160, 2389\u20132396. https:\/\/doi.org\/10.1016\/j.dam.2012.06.004 (2012).","journal-title":"Discret. Appl. Math."},{"key":"72101_CR46","doi-asserted-by":"publisher","first-page":"eaav2372","DOI":"10.1126\/sciadv.aav2372","volume":"5","author":"H Goto","year":"2019","unstructured":"Goto, H., Tatsumura, K. & Dixon, A. R. Combinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems. Sci. Adv. 5, eaav2372. https:\/\/doi.org\/10.1126\/sciadv.aav2372 (2019).","journal-title":"Sci. Adv."},{"key":"72101_CR47","doi-asserted-by":"publisher","first-page":"eabe7953","DOI":"10.1126\/sciadv.abe7953","volume":"7","author":"H Goto","year":"2021","unstructured":"Goto, H. et al. High-performance combinatorial optimization based on classical mechanics. Sci. Adv. 7, eabe7953. https:\/\/doi.org\/10.1126\/sciadv.abe7953 (2021).","journal-title":"Sci. Adv."}],"container-title":["Scientific Reports"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s41598-024-72101-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-024-72101-y","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-024-72101-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T19:00:59Z","timestamp":1726772459000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s41598-024-72101-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,18]]},"references-count":47,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["72101"],"URL":"https:\/\/doi.org\/10.1038\/s41598-024-72101-y","relation":{},"ISSN":["2045-2322"],"issn-type":[{"value":"2045-2322","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9,18]]},"assertion":[{"value":"8 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 September 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 September 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"21809"}}