台北捷運班表製作-以板南線為例

隨著捷運路線延伸，捷運系統在台北都會區交通地位倍增，以捷運公司製作班表人員而言，希望能以有效率並且能簡單操作試排出班表，另外以旅客的角度來說希望班距能在捷運公司承諾的範圍之內。本班表中旅運量已反應在每個時段班距的安排，列車可以視為在一個閉鎖區間內反覆行駛，若非必要並不須收發車，所以不似其他研究需使用複雜的演算法，本研究考慮到現實中所面對的困難，包括機廠收發車與終端站的折返，發展啟發式演算法以製作捷運一天班表。以C++程式語言作為工具，依照啟發式演算法製作班表，使用者輸入每個時段須要班距、終端站折返限制以及上下行基準車站，就可在3~5分鐘之內製作完一天的班表，班表當中除了包含所有列車到達各站時間以及離開各站時間之外，還包含機廠收發車時間、終端站使用月台數以及折返時間，此班表當中已考慮到發車衝突以及終端站前後列車時隔衝突，在轉換時段能快速恢復固定班距。

關鍵字

大眾運輸系統；機廠收發車；終端站衝突；啟發式演算法；列車排班

並列摘要

When the route of Taipei Rapid Transit has been developed, Taipei Rapid Transit has been the important public transport. As the role of timetable maker, the most principal work is scheduling the efficient timetable. Considering the demand reflecting on the headway, the headway has been set and timetable is developed. If headway is constant, the trains run on the route and it is not necessary to add trains from workshops or diminish trains. However, when the headway is changed, it is necessary to change the number of trains. As a result of the characters of the timetable of Taipei Rapid Transit, the heuristic is been developed to schedule the timetable of trains. In this research we develope the efficient heuristic alogrothm to schedule the timetable of the trains. The timetable maker input the headway, dwell time of terminuses and standard station, in the 3~5 minutes, the model can make the timetable of trains. The timetable includes the arrival time of stations、the departure time of station、the time of adding trains from wokeshops、the time of diminishing train、the number of palants of terminuses and the dwell time in terminus. The timetable has been considered the conflicts of adding trains from workshops and changing headway at terminus.

並列關鍵字

Public transport ； Workshop ； Conflicts of Terminus ； Heuristic ； Timetable of trains

參考文獻

蘇昭銘、程培倫、郭旻鑫，「捷運系統列車排程決策支援系統」，運輸季刊第三十卷第二期，民國九十二年六月，pp.409-437。

Alberto Caprara, Matteo Fishetti, Paolo Toth, (2002), “Modeling and Solving the Train Timetabling Problem.” , Operation Research, Vol. 50,No5,pp. 851-861.

Alain Billionnet, (2003), “Using Integer Programming to Solve the train-platforming problem.”, Transportation Science, Vol. 37, pp. 213-222.

Alberto Caprara, Michele Monaci, Paolo Toth, Pier Luigi Guida, (2006), “A Lagrangian Heuristic Algorithm for a Real-world Train Timetabling Problem”, Discrete Applied Mathematics 154, pp. 738-753.

Alberto Caprara, L. Kroon, M. Monaci, M. Peeters, P. Toth, (2006), “Rassenger Railway Optimization.” ,ARRIVAL-TR-0035.

國際替代計量

台北捷運班表製作-以板南線為例

全文下載

主題瀏覽