請用此 Handle URI 來引用此文件：
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/98954完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 洪一薰 | zh_TW |
| dc.contributor.advisor | I-Hsuan Hong | en |
| dc.contributor.author | 洪詩媛 | zh_TW |
| dc.contributor.author | Shih-Yuan Hung | en |
| dc.date.accessioned | 2025-08-20T16:25:17Z | - |
| dc.date.available | 2025-08-21 | - |
| dc.date.copyright | 2025-08-20 | - |
| dc.date.issued | 2025 | - |
| dc.date.submitted | 2025-08-13 | - |
| dc.identifier.citation | 維基媒體專案貢獻者. (2025, July 12). 臺北捷運. 維基百科，自由的百科全書. https://zh.wikipedia.org/zh-tw/%E8%87%BA%E5%8C%97%E6%8D%B7%E9%81%8B
臺北大眾捷運股份有限公司. (n.d.). 路網圖、各站資訊及時刻表. 臺北大眾捷運股份有限公司. https://www.metro.taipei/cp.aspx?n=91974F2B13D997F 臺北大眾捷運股份有限公司. (n.d.-a). 臺北大眾捷運股份有限公司. 臺北大眾捷運股份有限公司. https://web.metro.taipei/img/ALL/stationprofile/089.jpg 臺北大眾捷運股份有限公司. (n.d.-b). 臺北大眾捷運股份有限公司. 臺北大眾捷運股份有限公司. https://web.metro.taipei/img/ALL/stationprofile/086.jpg 臺北大眾捷運股份有限公司. (n.d.-c). 願景、使命與核心價值. 臺北大眾捷運股份有限公司. https://www.metro.taipei/cp.aspx?n=AE0EC5DA7D0804D4 臺北大眾捷運股份有限公司. (n.d.-d). 路線及班距. 臺北大眾捷運股份有限公司. https://www.metro.taipei/cp.aspx?n=EAD981369A065968&s=1CC297E1D0B4C7B1 Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: Theory, Algorithms, and applications. Prentice Hall. Auer, H., & Perger, T. (2020). Energy efficient route planning for electric vehicles with special consideration of the topography and battery lifetime. Energy Efficiency, 13, 1705–1726. https://doi.org/10.1007/s12053-020-09900-5 Bertolini, L., le Clercq, F., & Kapoen, L. (2005). Sustainable accessibility: A conceptual framework to integrate transport and land use plan-making. Transport Policy, 12(3), 207–220. https://doi.org/10.1016/j.tranpol.2005.01.006 Bozyigit, A., Nasiboglu, E., & Alankus, G. (2017). Public transport route planning: Modified Dijkstra's Algorithm. In 2017 International Conference on Computer Science and Engineering (UBMK) (pp. 502–505). https://doi.org/10.1109/UBMK.2017.8093444 Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1, 269–271. https://doi.org/10.1007/BF01386390 Farhan, M. (2019). Traffic Routing Algorithm for Road Network. Scientific Bulletin, 24, 131–138. https://doi.org/10.2478/bsaft-2019-0015 Guo, J., Guo, B., Song, G., & Liu, T. (2024). Solving the Robust Shortest Path Problem with Multimodal Transportation. Mathematics, 12(19), 2978. https://doi.org/10.3390/math12192978 Hadi, H., & Ibrahim, I. (2025). A comprehensive review of shortest path Algorithms for network routing. Asian Journal of Research in Computer Science, 18(3), 584. https://doi.org/10.9734/ajrcos/2025/v18i3584 Idri, A., Oukarfi, M., Boulmakoul, A., Masri, A., & Zeitouni, K. (2017). A new time-dependent shortest path Algorithm for multimodal transportation network. Procedia Computer Science, 113, 692–697. https://doi.org/10.1016/j.procs.2017.05.379 Ulum, U., Chulkamdi, M., & Santi, I. (2025). Implementation of Dijkstra Algorithm in determining the fastest route for goods delivery. Journal of Artificial Intelligence and Engineering Applications (JAIEA). https://doi.org/10.59934/jaiea.v4i2.923 Yen, J. Y. (1971). Finding the K shortest loopless paths in a network. Management Science, 17(11), 712–716. https://doi.org/10.1287/mnsc.17.11.712 Yu, X., Cao, H., Cao, K., Zhu, L., & Zou, L. (2024). Considering the optimization design of urban bus network scheduling. Applied Sciences, 14(14), 6337. https://doi.org/10.3390/app14146337 Zhan, F. B., & Noon, C. E. (1998). Shortest path Algorithms: An evaluation using real road networks. Transportation Science, 32(1), 65–73. https://doi.org/10.1287/trsc.32.1.65 Zhang, X., Liu, M., Li, P., Wang, G., Hu, J., Chan, K., & Qiu, J. (2019). Yen’s Algorithm-based charging facility planning considering congestion in coupled transportation and power systems. IEEE Transactions on Transportation Electrification, 5(4), 1134–1144. https://doi.org/10.1109/TTE.2019.2959716 | - |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/98954 | - |
| dc.description.abstract | 大眾運輸系統是現今社會不可或缺的一部分，捷運更是其中非常重要的一部分，隨著時間與技術的進步，捷運的規模越來越大，路網圖越來越複雜，相同起訖站間可能的路徑也越來越多，因此也面臨路徑推薦系統的升級，以提升旅客搭乘體驗。本研究針對臺北捷運系統，結合實際路網與班次時刻資料，建立一個考慮轉乘次數與搭乘時間的動態路徑規劃模型。透過Dijkstra's Algorithm (Dijkstra, 1959) 與Yen's Algorithm (Yen, 1971) 計算出多條時間最短且轉乘數最少的路徑，提供乘客多元選擇以改善搭乘體驗。 | zh_TW |
| dc.description.abstract | Public transportation systems are an indispensable part of modern society, with metro systems playing an especially important role. As time and technology advance, metro networks have become increasingly extensive and complex, resulting in a growing number of possible routes between the same origin and destination stations. This complexity presents a challenge for route recommendation systems, which must be upgraded to enhance the passenger experience. This study focuses on the Taipei Metro system, integrating the actual network and timetable data to develop a dynamic route planning model that considers both the number of transfers and travel time. By applying Dijkstra's Algorithm (Dijkstra, 1959) and Yen's Algorithm (Yen, 1971), the model identifies multiple shortest-time routes with minimal transfers, offering passengers a variety of options to improve their overall commuting experience. | en |
| dc.description.provenance | Submitted by admin ntu (admin@lib.ntu.edu.tw) on 2025-08-20T16:25:17Z No. of bitstreams: 0 | en |
| dc.description.provenance | Made available in DSpace on 2025-08-20T16:25:17Z (GMT). No. of bitstreams: 0 | en |
| dc.description.tableofcontents | 目次 i
圖次 ii 表次 iv 誌謝 v 中文摘要 vi 英文摘要 vii 第一章 緒論 1 第二章 文獻回顧 2 第三章 問題描述 4 3.1 SPP問題描述 4 3.2 臺北捷運資料與路網圖成本說明 5 第四章 研究方法 18 4.1 演算法 18 4.2 實驗結果 23 第五章 結論 34 參考文獻 35 | - |
| dc.language.iso | zh_TW | - |
| dc.subject | 路徑規劃 | zh_TW |
| dc.subject | 最短路徑 | zh_TW |
| dc.subject | 捷運 | zh_TW |
| dc.subject | Dijkstra's Algorithm | zh_TW |
| dc.subject | Yen's Algorithm | zh_TW |
| dc.subject | Metro | en |
| dc.subject | Route Planning | en |
| dc.subject | Shortest Path | en |
| dc.subject | Yen's Algorithm | en |
| dc.subject | Dijkstra's Algorithm | en |
| dc.title | 考量時間與轉乘次數之捷運搭乘路線規劃 | zh_TW |
| dc.title | Metro Route Planning Considering Travel Time and Number of Transfers | en |
| dc.type | Thesis | - |
| dc.date.schoolyear | 113-2 | - |
| dc.description.degree | 碩士 | - |
| dc.contributor.oralexamcommittee | 黃奎隆;陳文智 | zh_TW |
| dc.contributor.oralexamcommittee | Kwei-Long Huang;Wen-Chih Chen | en |
| dc.subject.keyword | 路徑規劃,最短路徑,捷運,Dijkstra's Algorithm,Yen's Algorithm, | zh_TW |
| dc.subject.keyword | Route Planning,Shortest Path,Metro,Dijkstra's Algorithm,Yen's Algorithm, | en |
| dc.relation.page | 37 | - |
| dc.identifier.doi | 10.6342/NTU202504286 | - |
| dc.rights.note | 同意授權(全球公開) | - |
| dc.date.accepted | 2025-08-15 | - |
| dc.contributor.author-college | 工學院 | - |
| dc.contributor.author-dept | 工業工程學研究所 | - |
| dc.date.embargo-lift | 2025-08-21 | - |
| 顯示於系所單位： | 工業工程學研究所 | |
文件中的檔案：
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-113-2.pdf | 1.73 MB | Adobe PDF | 檢視/開啟 |
系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。