臺灣博碩士論文加值系統

軌道車輛為其營運所需中最昂貴的設備之一，如何有效的運用此項資產，以達到高效率的實務規劃，對整體系統的營運而言極為重要。本研究旨在探討車輛資源規劃中的「運用路徑規劃」問題，其係在考量路線、場站容量、車輛特性以及維修等諸多限制條件下，透過接續各車次及任務以生成「運用路徑」，再藉由多條運用路徑滿足欲規劃週期內所有車次的需求，而後彙整為「車輛運用表」於時刻表改點間重複使用。實務作業中，有經驗的作業員可透過人工排訂一套良好的車輛運用表，然其僅為一組近似解而無法保障其為全域最佳解。又車輛運用為實務中較細節的課題，過去的學術文獻涉獵較少，且多將問題大幅簡化，以致難以取得一套真正可輔助實務規劃使用的決策系統。
有鑑於此，本研究同時透過文獻回顧並對實務單位進行專家訪談，雙管齊下彙整影響運用路徑規劃決策的目標及因子。而後透過具有週期性的圓形二維時空網路圖作為問題架構，進而建立兩組不同的數學模式輔以求解。為了精進求解時間以為實務支援決策之用，本研究採用變數產生法中的Gilmore-Gomory演算流程，再將問題進行解構並發展一個「運用路徑規劃求解演算法」，透過有力的對偶理論為基礎，以建立一套軌道車輛運用路徑規劃的決策工具。
本研究透過求解臺鐵局實務案例，以驗證並測試其正確性與可行性。其規劃時間較人工而言改善許多，在未考量後續人員規劃的情況下，可維繫最低的迴送成本，並有效降低現有的檢修次數，使總成本可減少約20~25%。研究成果貼近實務並具有顯著績效，適合用以延伸推廣，以作為輔助實務作業員從事運用路徑規劃決策所用。

Rolling stock is one of the most expensive assets of a railway agency or company. Therefore, efficient utilization of rolling stock is a very important objective pursued in practice. This study proposed a Rolling Stock Utilization Planning Tool to improve the efficiency of rolling stock usage by creating a utilization schedule to cover the trips in the timetable with the consideration of practical requirements, such as inspection regulation, depot capacity, rolling stock characteristics, and most important of all, the idea of schedule circulation.
Past studies usually simplified the problem by ignoring some of the important factors in practices; therefore, most of the railway agencies or companies still rely on experienced planners for this task. These practitioners can generally create an acceptable plan but there is no guarantee of the optimality. Consequently, there is a need for a planning tool which takes all important factors into account and provides optimal solutions to this problem.
In order to develop such tool, this research first identified the appropriate factors by reviewing literatures and interviews with practitoners. Then the Rolling Stock Utilization Planning Model is developed to minimize the deadhead cost and inspection cost in rolling stock utilization planning cycle. This study also presents the column generation method with Gilmore-Gomory algorithm to improve the solution efficiency, especially for large-scale problem.
The practical cases of Taiwan Railways Administration were used to demonstrate the validity and applicability of the proposed tool. The empirical results show that this optimization process can produce more efficient utilization plans with minimal deadhead distance and significant reduced number of inspections compared to the manual process. It’s equivalent to successfully reduce the total deadhead and inspection cost by 20%~25%. Using this decision support tool will help railways improve the efficiency of rolling stock utilization so as to provide reliable service to their customers.

口試委員審定書......I
謝辭......II
中文摘要......IV
英文摘要......V
目錄......VI
圖目錄......IX
表目錄......XI

第一章 緒論......1
1.1 研究背景......1
1.2 研究動機......3
1.3 研究內容與範疇......5
1.4 研究目的......6
1.5 研究方法......8
1.6 研究流程......8
第二章 文獻回顧......11
2.1 軌道運輸規劃流程......11
2.2 軌道車輛運用路徑規劃問題......13
2.2.1 機車運用路徑規劃......15
2.2.2 非動力車輛運用路徑規劃......18
2.2.3 混合機車與非動力車輛運用路徑規劃......19
2.2.4 車組式車輛運用路徑規劃......23
2.3 文獻回顧綜合討論......30
2.3.1 目標函數......31
2.3.2 限制條件與子問題......31
2.3.3 數學模式建立方法......34
2.3.4 綜合整理......35
第三章 臺鐵車輛運用路徑規劃實務......39
3.1 臺鐵車輛資源規劃實務導論......39
3.2 臺鐵車輛運用路徑規劃實務導論......42
3.2.1 臺鐵車輛運用路徑規劃人員執掌......42
3.2.2 臺鐵車輛運用路徑涵蓋之車輛任務......44
3.2.3 臺鐵運用表之判讀......46
3.3 臺鐵車輛運用路徑規劃實務決策邏輯與流程......48
3.3.1 實務規劃決策因子彙整......50
3.3.2 數學符號定義......55
3.3.3 人工規則與選取機制定義......57
3.3.4 實務運用路徑規劃決策流程......61
3.4 臺鐵運用表更新案例......68
3.4.1 案例一......69
3.4.2 案例二......70
3.4.3 案例三......71
第四章 軌道車輛運用路徑規劃數學模式建立......75
4.1 運用路徑規劃數學模式建立方法回顧......75
4.1.1 多元物流問題法之模式評析......76
4.1.2 指派（Assignment）問題法之模式評析......84
4.1.3 數學模式建立方法綜合討論......85
4.2 問題架構定義與決策因子彙整......85
4.3 運用路徑規劃最佳化模式......90
4.3.1 建立網路模式與數學符號說明......90
4.3.2 運用路經規劃數學模式一：混合整數規劃直觀模式......100
4.3.3 運用路經規劃數學模式二：二元整數規劃加速模式......108
4.3.4 場站與路線容量延伸模式......118
4.4 數學規劃模式綜合討論......119
第五章 軌道車輛運用路徑規劃求解演算法之研發......123
5.1 各類解構機制應用於運用路徑規劃之評析......123
5.2 變數產生法簡介......126
5.3 基於變數產生法拆解問題......128
5.3.1 受制主問題......130
5.3.2 子問題......136
5.4 車輛運用路徑規劃變數產生法演算流程......141
第六章 實證案例分析......147
6.1 比較基準定義與說明......148
6.2 案例一：小規模虛擬測試案例......150
6.2.1 案例一輸入參數資訊......150
6.2.2 案例一求解結果......152
6.3 案例二：花蓮機務段DR2900與DR3000型柴聯自強號車隊......156
6.3.1 案例二輸入參數資訊......156
6.3.2 案例二求解結果......158
6.4 案例三：新竹機務段EMU500與EMU600型電聯區間車車隊......160
6.4.1 案例三輸入參數資訊......160
6.4.2 案例三求解結果......163
6.5 案例綜合討論......164
第七章 結論與建議......167
7.1 結論......168
7.2 研究貢獻......171
7.3 建議......174
7.3.1 實務應用建議......175
7.3.2 後續研究建議......179
參考文獻......181
附錄一　臺灣鐵路管理局各型機車檢修週期表......191
附錄二　案例二求解結果......195
附錄三　案例三求解結果......209
作者簡歷......233

參考文獻
1.Ahuja, R. K., Cunha, C.B., and Sahin, G. 2005. Network models in railroad planning and scheduling. Tutorials in Operations Research. 1: 54-101.
2.Ahuja R. K., Dewan P., Jaradat M., Jha K. C., and Kumar A. 2006. An optimization-based decision support system for train scheduling. Technical report, Innovative Scheduling, Gainesville, FL, USA.
3.Alexandersson, G., Hulten, S., Fearnley, N. and Longva, F. 2010. Impact of regulation on the performances of long-distance transport services: A comparison of the different approaches in Sweden and Norway. Research in Transportation Economics. 29(1): 212-218.
4.Alfieri, A., Groot, R., Kroon, L., and Schrijver, A., 2002. Efficient circulation of railway rolling stock. ERIM Technical report - Research in Management. Erasmus Research Institute of Management, Rotterdam, Netherlands.
5.Alfieri, A., Groot, R., Kroon, L., and Schrijver, A. 2006. Efficient circulation of railway rolling stock. Transportation Science. 40(3): 378-391.
6.Alvelos, F. 2005. Branch-and-Price and Multicommodity Flows. Ph. D. Thesis. Engenharia de Producao e Sistemas - Area de Investigacao Operacional. Universidade do Minho, Portugal.
7.American Association of State Highway and Transportation Officials (AASHTO) 2007. Transportation - Invest in our future: America''s freight challenge. Washington, D. C., USA, AASHTO.
8.Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., and Vance, P.H. 1998. Branch-and-price: column generation for solving huge integer programs. Operation Research. 46(3): 316-329
9.Benders, J.F. 1962. Partitioning procedures for solving mixed-variables programming problems. Nunerische Mathematik. 4(1): 238-252.
10.Ben-Khedher, N., Kintanar, J., Queille, C., and Stripling, W. 1998. Schedule Optimization at SNCF: from conception to day of departure. Interfaces. 28(1): 6-23.
11.Berger, R.T., Coullard, C.R., and Daskin, M.S. 2007. Location-routing problems with distance constraints. Transportation Science. 41(1): 29-43.
12.Blakely, E.J., and Leigh, N.G. 2010. Planning local economic development: Theory and practice. 4th ed. California, USA, SAGE Publications, Inc.
13.Booler, J.M.P. 1980. The solution of a railway locomotive scheduling problem. Journal of the Operational Research Society. 31(10): 943-948.
14.Budai, G., Maroti, G., Dekker, R., Huisman, D., and Kroon, L. 2010. Rescheduling in passenger railways: the rolling stock rebalancing problem. Journal of Scheduling. 13(3): 281-297.
15.Bussieck, M. R., Winter, T., and Zimmermann, U.T. 1997. Discrete optimization in public rail transport. Mathematical Programming. 79: 415–444.
16.Cacchiani, V., Caprara, A. and Toth, P. 2010. Solving a real-world train-unit assignment problem. Mathematical Programming Series B. 124: 207-231.
17.Cacchiani, V., Caprara, A. and Toth, P. 2012. A Lagrangian heuristic for at train-unit assignment problem. Discrete Applied Mathematics. In Press.
18.Cadarso, L., and Marin, A. 2010. Robust routing of rapid transit rolling stock. Public Transport. 2(1-2): 51-68.
19.Cadarso, L., and Marin, A. 2011. Robust rolling stock rapid transit networks. Computers and Operations Research. 38: 1131-1142.
20.Chen, D.S., Batson, R.G., and Dang, Y. 2010. Applied interger programming. 1st ed. Hoboken, New Jersey, USA, McGraw-Hill.
21.Chen, Y., and Alexander, W. 2012. Green infrastructure: The effects of urban rail transit on air quality. American Economic Journal: Economic Policy. 4(1): 58-97.
22.Cheng, Y. H., and Tsao, H. L. 2010. Rolling stock maintenance strategy selection and spares parts estimation. International Journal of Production Economics. 128(1): 404-412.
23.Chung, J. W., Oh, S. M., and Choi, I. C. 2009. A hybrid genetic algorithm for train sequencing in the Korean railway. Omega. 37(3): 555-565.
24.Cordeau, J.F., Soumis, F., and Desrosiers, J. 2000. A Benders decomposition approach for locomotive and car assignment problem. Transportation Science. 34(2): 133-149.
25.Cordeau, J.F., Desaulniers, G., Lingaya, N., Soumis, F., and Desrosiers, J. 2001a. Simultaneous locomotive and car assignment at VIA Rail Canada. Transportation Research Part B: Methodological. 35(8): 51–71.
26.Cordeau, J.F., Soumis, F., and Desrosiers, J. 2001b. Simultaneous assignment of locomotives and cars to passenger trains. Operations Research. 49: 531–548.
27.Crainic, T.G., and Roy, J. 1988. OR tools for tactical freight transportation planning. European Journal of Operational Research. 33(3): 290-297.
28.Dantzig, G.B., and Wolfe, P. 1960. Decomposition principle for linear programs. Operations Research. 8(1): 101–111.
29.Dejax, P.J., and Crainic, T.G. 1987. A review of empty flows and fleet management models in freight transportation. Transportation Science. 21(4): 227-247.
30.Desrosiers, J., Sournis, F., and Desrochers, M. 1984. Routing with time windows by column generation. Networks. 14: 545-565.
31.Desrosiers, M., and Soumis, F. 1989. A column generation approach to the urban transit crew scheduling problem. Transportation science. 23(1): 1-13.
32.Dumas, Y., Desrosiers, J., and Soumis, F. 1991. The pickup and delivery problem with time windows. European Journal of Operational Research. 54: 7–22.
33.Eidenbenz, S., Pagourtzis, A., and Widmayer, P. 2003. Flexible train rostering. Proceedings of International Symposium on Algorithms and Computation, Lecture Notes in Computer Science. 2906: 615-624.
34.Erlebach, T., Gantenbein, M., Hurlimann, H., Neyer, G., Pagourtzis, A., Penna, P., Schlude, K., Steinhofel, K., Taylor, D.S., and Widmayer, P. 2001. On the complexity of train assignment problems. Proceedings of International Symposium on Algorithms and Computation, Lecture Notes in Computer Science. 2223: 390-402.
35.Everett, H.I. 1963. Generalized Lagrange multiplier method for solving problems of optimum allocation of resources. Operations Research. 11(3): 399-417.
36.Fioole, P.J., Kroon, L., Maro’ti., G., and Schrijver, A. 2006. A rolling stock circulation model for combining and splitting of passenger trains. European Journal of Operational Research. 174: 1281–1297.
37.Florian, M., Bushell, G., Ferland, J., Guerin, G., and Nastansky, L. 1976. The engine scheduling problem in a railway network. INFOR. 14(2):121-138.
38.Forbes, M.A., Holt, J.N., and Watts, A. W. 1991. Exact solution of locomotive scheduling problems. Journal of the Operational Research Society. 42(10): 825-831.
39.Freling, R., Lentink, R.M., Kroon, L.D., and Huisman, H. 2005. Shunting of passenger train units in a railway station. Transportation Science. 39 (2): 261–272.
40.GAMS Development Corporation. 2008. GAMS- A user''s guide. GAMS Development Corporation: Washington, DC.
41.Geng, J.C. 2008. Study on optimization of EMUs scheduling for passenger -dedicated line. Journal of Xi-hua University Natural Science. 27(6): 83-86.
42.Gilmore, P.C., and Gomory, R.E. 1961. A linear programming approach to the cutting-stock problem. Operations Research. 9: 849-859.
43.Gilmore, P.C., and Gomory, R.E. 1963. A linear programming approach to the cutting-stock problem- Part II. Operations Research. 11: 863-888.
44.Givoni, M. and Rietveld, P. 2007. The access journey to the railway station and its role in passengers'' satisfaction with rail travel. Transport Policy. 14(5): 357-365.
45.Haase, K. Desaulniers, G., and Desrosiers, J. 2001. Simultaneous vehicle and crew scheduling in urban Mass Transit Systems. Transportation Science. 35(3): 286-303.
46.Haghani A.E. 1989. Formulation and solution of a combined train routing and makeup, and empty car distribution model. Tanspoortation Research. 23B(6): 433-452.
47.Haghani, A.E. 1987. Rail freight transportation: a review of recent optimization models for train routing and empty car distribution. Journal of Advanced Transportation. 21(2): 147-172.
48.Holmberg, K., and Yuan, D. 2003. A multicommodity network flow problem with side constraints on paths solved by column generation. Journal on Computing. 15(1): 42-57.
49.Hong, S.P., Kim, K.M., Lee, K., and Park, B.H. 2009. A pragmatic algorithm for the train-set routing: The case of Korea high-speed railway. Omega. 37: 637-645.
50.Huisman, D. 2007. A column generation approach for the rail crew re-scheduling problem. European Journal of Operational Research. 180: 163-173.
51.Iacono, M., Levinson, D., and Geneidy, A. 2008. Models of transportation and land use change: A guide to the territory. Journal of Planning Literature. 22(4): 323-341.
52.Jong, J.C., Suen, C.S., and Chang, S.K., 2012. A Decision Support System to Optimal Railway Stopping Patterns: Application to the Taiwan High Speed Rail. Transportation Research Record: Journal of the Transportation Research Board. In Press.
53.Kalvelagen, E. 2003. Column generation with GAMS. http://www.amsterdamoptimization.com/pdf/colgen.pdf, accessed 10 March 2011. Amsterdam Optimization Modeling Group.
54.Kuo, C.C., and Nicholls, G.M. 2007. A mathematical modeling approach to improving locomotive utilization at a freight railroad. Omega. 35: 472-485.
55.Lai, Y. C., Zeng, W. W., and Liu, K. C. 2011. Development of an operational rolling stock assignment model for Taiwan high speed rail. Proceedings of 9th World Congress on Railway Research. Lille, France.
56.Laporte, G., and Louveaux, F.V. 1993.The integer L-shaped method for stochastic integer programs with complete recourse. Operations Research Letters. 13: 133-142.
57.Lingaya, N., Cordeau, J.F., Desaulniers, G., Desrosiers, J., and Soumis, F. 2002. Operational car assignment at VIA Rail in Canada. Transportation Research Part B: Methodological. 36: 755–778.
58.Lu, A., and Marsh, A. 2011. Zen and the art of commuter rail operations: Taiwan Railways Administration’s design, operations, and philosophy. Proceedings of 90th Transportation Research Board. Washington, DC, USA.
59.Maroti, G., and Kroon, L. 2005. Maintenance routing for train units: the transition model. Transportation Science. 39(4): 518-525.
60.Maroti, G., and Kroon, L. 2007. Maintenance routing for train units: The interchange model. Computers and Operations Research. 34(4): 1121-1140.
61.Meyer, M., and Miller, E. J. 2001. Urban transportation planning: A decision-oriented approach. 2nd ed. Boston, Massachustees, USA, McGraw-Hill.
62.McCartney, S., and Stittle, J. 2012. ‘Engines of Extravagance’: The privatised British railway rolling stock industry. Critical Perspectives on Accounting. 23(2): 153-167.
63.Nishi, T., and Muroi, Y., and Inuiguchi, M. 2011. Column generation with dual inequalities for railway crew scheduling problems. Public Transport. 3(1): 25-42.
64.Otsuki, T., Aisu, H., and Tanaka, T., 2010. A search-based approach to the railway rolling stock allocation problem. Proceedings of International Symposium on Algorithms and Computation, Lecture Notes in Computer Science. 6509: 131-143.
65.Peeters, M., and Kroon, L. 2008. Circulation of railway rolling stock: A branch-and-price approach. Computers and Operations Research. 35: 538-556.
66.Poudenx, P. 2008. The effect of transportation policies on energy consumption and greenhouse gas emission from urban passenger transportation. Transportation Research Part A: Policy and Practice. 42(6): 901-909.
67.Profillidis, V.A. 2006. Railway management and engineering. 3rd ed. Hampshire, England, Ashgate Publishing Company.
68.Ramani, K.V. 1981. An information system for allocating coach stock on Indian Railways. Interfaces. 11(3): 44–51.
69.Ramani, K.V., and Mandal, B.K. 1992. Operational planning of passenger trains in Indian Railways. Interfaces. 22(5): 39–51.
70.Rastke, A., Horstel, J., and Schumacher, A. 1996. Optimised rostering and maintaining of high speed rail system. Computers in Railways V. 1: 403-409.
71.Rietveld, P. 2000. The accessibility of railway stations: the role of the bicycle in The Netherlands. Transportation Research Part D: Transport and Environment. 5(1): 71-75.
72.Rouillon, S., Desaulniers, G., and Soumis, F. 2006. An extended branch-and-bound method for locomotive assignment. Transportation Research Part B: Methodological. 40: 404-423.
73.Rus, G., and Nombela, G. 2007. Is Investment in high speed rail socially profitable? Journal of Transport Economics and Policy. 41(1): 3-23.
74.Sahin, B., Yilmaz, H., Ust, Y., Guneri, A.F., and Gulsun, B. 2009. An approach for analysing transportation costs and a case study. European Journal of Operational Research. 193(1): 1-11.
75.Sato, K., and Fukumura, N. 2010. An algorithm for freight train driver rescheduling in disruption situations. Quarterly Report of RTRI. 51(2): 72-76.
76.Sato, K., and Fukumura, N. 2011. Freight locomotive rescheduling algorithm during disordered train operation. Quarterly Report of RTRI. 52(2): 81-85.
77.Schrijver, A. 1993. Minimum circulation of railway stock. CWI Quarterly. 3: 205-217.
78.Sun, K., and Li, H. 2010. Scheduling problems with multiple maintenance activities and non-preemptive jobs on two identical parallel machines. International Journal of Production Economics. 124(1): 151-158.
79.Sussman, J. 2000. Introduction to transportation systems. 1st ed. Boston, Massachustees, USA, Artech House.
80.Thomet, M.A. 1971. A user-oriented freight railroad operating policy. IEEE Systems, Man, and Cybernetics Society. 1(4): 349-356.
81.Tsai, T.H., Lee, C.K. and Wei, C.H. 2009. Neural network based temporal feature models for short-term railway passenger demand forecasting. Expert Systems with Applications. 36(2): 3728-3736.
82.Wang, I.L., and Lin, I.C. 2010. Solving the railway cyclic crew rostering problem. Proceedings of the 23rd International Chinese Transportation Professional Association Annual Meeting & the 8th Asia Pacific Transportation Development Conference. Tainan, Taiwan.
83.Wey, W.M., and Chang, Y.H. 2009. A comparative location study for the joint development station of a mass rapid transit system: a case in Taichung City in Taiwan. Environment and Planning B: Planning and Design. 36: 573-587.
84.Wright, M.B., 1989. Applying stochastic algorithms to a locomotive scheduling problem. Journal of the Operational Research Society. 40(2): 187-192.
85.Xie, M., Mao, B., Ho, T.K., Chen, Z., and Bai, Y. 2010. Modeling circulation of train-set with multiple routing. Journal of Transportation Systems Engineering and Information Technology. 10(3): 50-57.
86.Yu., G. 1998. Operations Research in the airline industry. Boston, Massachustees, USA, Kluwer Academic Publishers.
87.Ziarati, K., Soumis, F., Desrosiers, J., Grlinas, S., and Saintonge, A. 1997. Locomotive assignment with heterogeneous consists at CN North America. European Journal of Operational Research. 97: 281-292.
88.Ziarati, K., Soumis, F., Desrosiers, J., and Solomon, M.M. 1999. A branch-first, cut-second approach for locomotive assignment. Management Science. 45(8): 1156-1168.
89.Zhao, P., and Tomii, N. 2004. An algorithm for train-set scheduling on weekday based on probabilitistic local search. Systems Engineering-Theory and Practice. 24(2): 123-129.
90.日本車輌製造株式会社，台湾向け鉄道車両の受注に関するお知らせ，日本車輌製造株式会社新聞稿，平成22年（2011年）。
91.王國琛，結合限制規劃與數學規劃求解大型後艙空勤組員排班問題，國立交通大學運輸科技與管理學研究所碩士論文，民國九十一年。
92.李治綱、林正章，鐵路系統列車服務計劃模式之發展與應用，行政院國家科學委員會專題研究計畫成果報告，行政院國家科學委員會，民國八十八年。
93.李治綱、謝汶進，應用雙層次規劃於高速鐵路列車服務設計之研究，運輸計畫季刊，第三十一卷，第一期，頁95-119，民國九十一年。
94.何進郊，客貨車檢修，臺灣鐵路管理局員工訓練中心，民國七十八年。
95.姜渝生，台灣地區整體軌道路網建構之重要課題，經濟前瞻，第九十七期，頁101-104，民國九十四年。
96.凌宇康，應用可靠度為中心維修方式規劃軌道車輛維修階層之研究－以台鐵電聯車動力系統為例，國立交通大學運輸科技與管理學研究所碩士論文，民國九十五年。
97.凌瑞賢，運輸規劃原理與實務，鼎漢國際工程顧問股份有限公司出版，台北，民國九十三年。
98.張有恆，軌道運輸管理，華泰文化事業股份有限公司，台北，民國九十七年。
99.張倍瑜、李昱逵、張學孔，台北大眾捷運後期路網替選方案之評估研究，中華民國運輸年會98年學術論文研討會，桃園縣，民國九十八年。
100.張學孔，高速鐵路運量預測模式之檢核與發展，行政院國家科學委員會專題研究計畫成果報告，行政院國家科學委員會，民國八十八年。
101.陶治中、劉嵩瀚，固定與移動自動閉塞區間制下多車種列車運行之模擬模式研究，運輸計畫季刊，第三十七卷，第三期，頁293-330，民國九十七年。
102.葉珮婷，應用變數產生法求解有時間窗限制的收送貨問題，國立交通大學運輸科技與管理學研究所碩士論文，民國九十八年。
103.曾微雯，研發台灣高速鐵路列車組指派最佳化模式，國立臺灣大學土木工程研究所碩士論文，民國一百年。
104.蕭國文，臺鐵機務成本實務運用與分析，臺鐵資料，第三百四十四期，頁53-70，民國九十九年。
105.鍾慧諭、黃于真，鐵道運輸需求預測與分析，臺灣整體鐵道網規劃願景研討會，新北市，民國一百零一年。
106.鍾慧諭、陳柏君、葉叔達，鐵道路網規劃成果，臺灣整體鐵道網規劃願景研討會，新北市，民國一百零一年。
107.盧宗成，捷運司機員排班問題之研究－以台北捷運公司為例，國立交通大學運輸科技與管理學研究所碩士論文，民國八十九年。
108.蘇昭銘、程培倫、郭旻鑫，捷運系統列車排程決策支援系統，運輸計畫季刊，第三十卷，第二期，頁409-437，民國九十年。