| 研究生: |
梁峻銓 Witra Liangdy |
|---|---|
| 論文名稱: |
利用量子計算求解最佳航機路線問題 Using Quantum Computation to Solve Optimal Aircraft Routing Problems |
| 指導教授: |
楊憲東
Yang, Ciann-Dong |
| 學位類別: |
碩士 Master |
| 系所名稱: |
工學院 - 航空太空工程學系 Department of Aeronautics & Astronautics |
| 論文出版年: | 2023 |
| 畢業學年度: | 111 |
| 語文別: | 英文 |
| 論文頁數: | 80 |
| 中文關鍵詞: | 航機路線 、飛行計畫 、量子計算 、量子工程 、量子演算法 、量子控制 |
| 外文關鍵詞: | Aircraft Routing, Flight Planning, Quantum Computers, Quantum Engineering, Quantum Algorithm, Quantum Control |
| 相關次數: | 點閱:202 下載:21 |
| 分享至: |
| 查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報 |
近年以來,計算和設計航空機路線在航空業得到了廣泛應用,成為一個非常重要的項目。每家航空公司都必須經歷這個流程才能製定新的航線。因此,許多航空公司租賃或購買計算和設計航空機路線系統(Flight Plan Routing and Traffic Management System)。然而,在使用這些系統時,經常遭遇到系統當機,導致在尋找最佳航線時需要花大量的時間。另外,由這些系統生成的航線選項非常有限,給航空公司帶來了許多困擾和不便。因此,許多航空公司開始涉足量子計算領域,以找到更好的解決當前航空機路線問題的方法。
本論文的主要目的是提出量子計算已經開始逐漸解決航空機路線問題。本研究利用5量子位元(qubits)的量子演算法,可以同時模擬並快速生成所有可能的航空機路線,並判斷出最佳航線。在這方面,研究分為兩個部分進行討論。第一部分是根據設定的條件和規劃的路線,利用量子近似最佳算法在量子計算機上計算出最佳航線;第二部分是將這些算法應用於實際的航班情況,利用航空公司提供的航班和飛行數據,使用量子近似最佳算法在量子計算機中找到最佳航線。
最後,通過使用IBM和Cirq量子計算機進行實驗和模擬,本研究驗證了使用量子計算機計算航空機路線的可行性,並且比傳統計算機更好。然而,遺憾的是,這項研究仍處於初期階段,仍存在一些缺陷,並需要更好的硬件設備來提供更好的結果和應用。
In recent years, the aviation industry has seen widespread application of computing and designing aircraft routes, making it an incredibly important aspect. Every airline must go through this process to establish new routes. Consequently, many airlines choose to lease or purchase systems like the Flight Plan Routing and Traffic Management System for computing and designing aircraft routes. However, these systems often encounter frequent crashes, resulting in significant time delays when searching for the best routes. Additionally, the options generated for routes are quite limited, causing various challenges and inconveniences for airlines. As a result, many airlines have started exploring the field of quantum computing to find better solutions for their current aircraft route problems.
The main purpose of this thesis is to demonstrate the gradual resolution of aircraft route issues through the application of quantum computing. This study utilizes a 5-qubit quantum computer and quantum algorithms to simultaneously simulate and quickly generate all possible aircraft routes, ultimately determining the optimal route. The research is divided into two main parts. Firstly, it involves setting specific conditions and planning routes, where the quantum approximate optimization algorithm is utilized on a quantum computer to calculate the best route. Secondly, the study applies these algorithms to real flight scenarios, utilizing flight and navigation data provided by airlines and employing the quantum approximate optimization algorithm to find the optimal route within a quantum computer.
Finally, through experimentation and simulation using IBM and Cirq quantum computers, this research validates the feasibility of utilizing quantum computers for aircraft route calculations, showing their superiority over traditional computers. However, it is important to note that this research is still in its early stages and has certain limitations, which need to be supported and supplemented with improved hardware for better results and practical applications.
[1] A. Azadeh, M. H. Farahani, H. Eivazy, S. Nazari-Shirkouhi, and G. Asadipour, "A hybrid meta-heuristic algorithm for optimization of crew scheduling," IEEE Transactions on Applied Soft Computing, vol. 13, no. 1, pp. 158-164, 2013.
[2] P. Varshney, A. S. Krishnakumar, G. V. Kumar, and A. Kumar, "Optimal Flight Route Planning: A Comprehensive Review," IEEE Transactions on Intelligent Transportation Systems, vol. 19, no. 3, pp. 948-965, 2018.
[3] S. Kumar and K. Sycara, "A Review of the Airline Fleet Assignment Problem," IEEE Transactions on Intelligent Transportation Systems, vol. 3, no. 4, pp. 301-313, 2002.
[4] D. P. DiVincenzo, “Quantum computation,” Science, vol. 270, no. 5234, pp. 255–261, 1995.
[5] H. A. Bhat, F. A. Khanday, B. K. Kaushik, F. Bashir and K. A. Shah, "Quantum Computing: Fundamentals, Implementations and Applications," in IEEE Open Journal of Nanotechnology, vol. 3, pp. 61-77, 2022.
[6] Z. Wang, S. Hadfield, Z. Jiang, and E. G. Rieffel, "Quantum approximate optimization algorithm for MaxCut: A fermionic view," Physical Review A, vol. 97, no. 2, pp. 11, 2018.
[7] E. Farhi, J. Goldstone, and S. Gutmann, "A Quantum Approximate Optimization Algorithm," arXiv e-prints, arXiv:1411.4028, 2014.
[8] P. Vikstål, M. Grönkvist, M. Svensson, M. Andersson, G. Johansson, and G. Ferrini, "Applying the Quantum Approximate Optimization Algorithm to the Tail-Assignment Problem," Physical Review Applied, vol. 14, no. 3, pp. 1-8, 2020.
[9] A. F. S. Torres Lopes, "Quantum Computing for Optimizing Routes in Smart Cities," Master thesis, Computer Science and Engineering, University of Porto, 2021.
[10] T. Stollenwerk, S. Hadfield and Z. Wang, "Toward Quantum Gate-Model Heuristics for Real-World Planning Problems," in IEEE Transactions on Quantum Engineering, vol. 1, pp. 1-16, 2020.
[11] J. Preskill, "Quantum Computing in the NISQ era and beyond," Quantum, vol. 2, pp. 79, 2018.
[12] C. Ryan-Anderson, "Quantum Algorithms, Architecture, and Error Correction," arXiv e-prints, arXiv:1812.04735, 2018.
[13] L. Zhou, S.-T. Wang, S. Choi, H. Pichler, and M. D. Lukin, "Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices," Physical Review X, vol. 10, no. 2, pp. 2-10, 2020.
[14] M. Grönkvist, "The Tail Assignment Problem,", PhD thesis, Computer Science and Engineering, University of Gothenburg, 2005.
[15] Y. Kharkov, A. Ivanova, E. Mikhantiev, and A. Kotelnikov, "Arline Benchmarks: Automated Benchmarking Platform for Quantum Compilers," arXiv e-prints, arXiv:2202.14025, 2022.
[16] Abhijith J., Adetokunbo Adedoyin, John Ambrosiano, Petr Anisimov, William Casper, Gopinath Chennupati, Carleton Coffrin, Hristo Djidjev, David Gunter, Satish Karra, Nathan Lemons, Shizeng Lin, Alexander Malyzhenkov, David Mascarenas, Susan Mniszewski, Balu Nadiga, Daniel O'malley, Diane Oyen, Scott Pakin, Lakshman Prasad, Randy Roberts, Phillip Romero, Nandakishore Santhi, Nikolai Sinitsyn, Pieter J. Swart, James G. Wendelberger, Boram Yoon, Richard Zamora, Wei Zhu, Stephan Eidenbenz, Andreas Bärtschi, Patrick J. Coles, Marc Vuffray, and Andrey Y. Lokhov, "Quantum Algorithm Implementations for Beginners," ACM Transactions on Quantum Computing, vol. 3, no. 4, article no. 18, 2022.
[17] D. A. Lidar and T. A. Brun, "Quantum Error Correction," Cambridge University Press, 2009.
[18] L. Sansoni, "Integrated Devices for Quantum Information with Polarization Encoded Qubits,” Springer Cham, pp. 87-96, 2014.
[19] J. Wang, G. Guo, and Z. Shan, "SoK: Benchmarking the Performance of a Quantum Computer," Entropy, vol. 24, pp. 1467, 2022.
[20] G. H. King, B. C. Leishman, et al., "Uncertainty analysis for airline route planning," in Proceedings of the AIAA Guidance, Navigation, and Control Conference, 2011.
[21] H. Makhanov, K. Setia, J. Liu, V. Gomez-Gonzalez, and G. Jenaro-Rabadan, "Quantum Computing Applications for Flight Trajectory Optimization," arXiv e-prints, arXiv:2304.14445, 2023.
[22] M. Swayne, "$5 million From Boeing Will Support UCLA Quantum Science and Technology Research", The Quantum Insider, 2022.
[23] R. J. Thompson, N. Nguyen, T. Smith, H. Nishimura, K. Williams, and M. Kagele, "Promising Quantum Computing Applications in Aerospace", American Physical Society, 2023.
[24] J. Whitney, "NASA and DLR jointly developing quantum computer software", Military Aerospace Electronics, 2022.
[25] R. Yue, Z. Yuan, X. Xue, and Z. Liu, "Quantum approximate optimization for combinatorial problems with constraints," Information Sciences, vol. 619, pp. 98-125, 2023.
[26] A. Lucas, "Ising formulations of many NP problems," Frontiers in Physics, vol. 2, p. 5, 2014.
[27] E. Crosson, E. Farhi, C. Y. Lin, H. Lin, and P. Shor, "Different Strategies for Optimization Using the Quantum Adiabatic Algorithm," arXiv e-prints, arXiv:1401.7320, 2014.
[28] J. Cook, S. Eidenbenz, and A. Bärtschi, "The Quantum Alternating Operator Ansatz on Maximum k-Vertex Cover," in 2020 IEEE International Conference on Quantum Computing and Engineering (QCE), pp. 83-92, 2020.
[29] W. Lechner, "Quantum Approximate Optimization with Parallelizable Gates," in IEEE Transactions on Quantum Engineering, vol. 1, pp. 1-6, 2020.
[30] J. Gambetta, "Expanding the Algorithm of IBM Quantum Computing System," IBM Quantum Research, 2022.
[31] Y. Zhang, H. Zhang, and L. Wang, "Emergency Aircraft Routing Using Multi-Objective Optimization," in IEEE Transactions on Intelligent Transportation Systems, vol. 17, no. 6, pp. 1751-1764, 2016.
[32] C. Zhang, "Two-Stage Heuristic Algorithm for Aircraft Recovery Problem," Discrete Dynamics in Nature and Society, vol. 2017, pp. 1-12, 2017.
[33] A. Lucas, "Ising formulations of many NP problems," Frontiers in Physics, vol. 2, 2014.
[34] L. N. Martins, A. P. Rocha, and A. J. M. Castro, "A QUBO Model to the Tail Assignment Problem," in 2021 - Proceedings of the 13th International Conference on Agents and Artificial Intelligence (ICAART), vol. 2, pp. 899-906, 2021.
[35] Z. Huang, Q. Li, J. Zhao, and M. Song, "Variational Quantum Algorithm Applied to Collision Avoidance of Unmanned Aerial Vehicles," Entropy, vol. 24, no. 11, pp. 1685, 2022.
[36] J. Choi, S. Oh, S. Park, J.-K. Kim, and J. Kim, "Proper Cost Hamiltonian Design for Combinatorial Optimization Problems: A Boolean Function Approach," in 2021 International Conference on Information Networking (ICOIN), pp. 469-472, 2021.
[37] B. Wang, F. Hu and C. Wang, "Optimization of quantum computing models inspired by D-wave quantum annealing," Tsinghua Science and Technology, vol. 25, no. 4, pp. 508-515, 2020.
[38] C.H. Cho, C.Y. Chen, K.C. Chen, T.W. Huang, M.C. Hsu, N.P. Cao, B. Zeng, S.G. Tan, and C.R. Chang, "Quantum computation: Algorithms and Applications," Chinese Journal of Physics, vol. 72, pp. 248-269, 2021.
[39] D. Cuomo, M. Caleffi, K. Krsulich, F. Tramonto, G. Agliardi, E. Prati, and A. S. Cacciapuoti, "Optimized Compiler for Distributed Quantum Computing," Association for Computing Machinery (ACM) Transactions on Quantum Computing, vol. 4, no. 2, pp. 1-29, 2023.
[40] J. Weidenfeller, L. C. Valor, J. Gacon, C. Tornow, L. Bello, S. Woerner, and D. J. Egger, "Scaling of the quantum approximate optimization algorithm on superconducting qubit based hardware," Quantum, vol. 6, pp. 870, 2022.
[41] S. D. Simone, "Google Cirq: a Python Open Souce Library for Quantum Computing", Information Quality (infoQ), 2018.
[42] M. Held and R. M. Karp, "The traveling-salesman problem and minimum spanning trees," Operations Research, vol. 18, no. 6, pp. 1138-1162, 1970.
[43] S. Ruan, S. Marsh, X. Xue, Z. Liu, J. Wang, "The Quantum Approximate Algorithm for Solving Traveling Salesman Problem," Computers, Materials & Continua, vol. 63, no. 3, pp. 1237-1247, 2020.
[44] Ministry of Transportation, "Garuda Indonesia’s Research and Development(R&D) Team," 2022.
[45] J. Wang, G. Guo, and Z. Shan, "SoK: Benchmarking the Performance of a Quantum Computer," Entropy, vol. 24, no. 10, p. 1467, 2022.
[46] S. Resch and U. R. Karpuzcu, "Benchmarking Quantum Computers and the Impact of Quantum Noise," arXiv e-prints, arXiv:1912.00546, 2019.
[47] A. Zewe, "A new way for quantum computing systems to keep their cool," Massachusetts Institute of Technology (MIT) News, 2023.