考量時間與轉乘次數之捷運搭乘路線規劃

Abstract

大眾運輸系統是現今社會不可或缺的一部分，捷運更是其中非常重要的一部分，隨著時間與技術的進步，捷運的規模越來越大，路網圖越來越複雜，相同起訖站間可能的路徑也越來越多，因此也面臨路徑推薦系統的升級，以提升旅客搭乘體驗。本研究針對臺北捷運系統，結合實際路網與班次時刻資料，建立一個考慮轉乘次數與搭乘時間的動態路徑規劃模型。透過Dijkstra's Algorithm (Dijkstra, 1959) 與Yen's Algorithm (Yen, 1971) 計算出多條時間最短且轉乘數最少的路徑，提供乘客多元選擇以改善搭乘體驗。

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.