臺灣人文及社會科學引文索引資料庫系統

:::

詳目顯示

回上一頁
第 1 筆 / 總合 1 筆   第一頁 上一頁 下一頁 最後一頁
/1頁
題名：高速鐵路列車服務之設計模式
作者：謝汶進
作者(外文)：Wein-Jin Hsieh
校院名稱：國立成功大學
系所名稱：交通管理學系
指導教授：李治綱
學位類別：博士
出版日期：2001
主題關鍵詞：高速鐵路；旅運需求；列車服務設計；數學規劃；列車時刻表；High-Speed Rail；Rail Transportation；Train Demand；Train Service Plan；Mathematical Programming；Time Table
原始連結：連回原系統網址new window
相關次數：
  • 被引用次數被引用次數:期刊(0) 博士論文(0) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:0
  • 共同引用共同引用:0
  • 點閱點閱:63
高速鐵路為西部走廊城際客運一新的運輸工具，有系統研究有效之高速鐵路系統服務計劃相關的管理方法與程序實為當前之重要課題。具體而言，鐵路列車之運行是以時刻表為主要依據。在鐵路旅客運輸實務上，為了方便旅客使用與簡化規劃分析工作，通常採用規則式班表，亦即以每小時為週期之規則式發車。因此，依據旅運需求分析之結果，鐵路營運者在軌道容量硬體設施與列車車隊規模供給能量限制下進行規則時段（regular interval）(例如：一小時)之列車服務設計，再提供運務作業單位規劃製作列車運行圖，最後制定供旅客使用之列車時刻表。
依據上述之程序進行列車服務之設計，通常不考慮旅客對列車服務之選擇行為，但隨著城際客運運輸市場之競爭日益激烈下，列車服務設計之好壞將直接影響旅運需求量。故對於高速鐵路營運者而言，必須了解旅客對於其服務方式之可能反應，才可能進一步地探討有效之列車服務，並配合設計以一個小時為基礎之時刻表之工作，以提昇高速鐵路的運輸效能。
因此，本研究包括三個部份，首先探討旅客對於高速鐵路服務方式之選擇行為，建立列車服務之旅客選擇模式，分析方法上將旅客對列車服務之選擇行為建構成一個路徑選擇問題；亦即將列車服務計劃轉換為一個列車服務之路網，旅客之各種旅行成本轉換為各路段上之一般化旅行成本；再據之以確定性使用者均衡、及羅吉特（Logit）與普羅比（Probit）等隨機使用者均衡方法求解。其結果可以求得各種列車停站方式在各路段之運量，用以分析實施該列車服務方式之旅運需求。
其次，依據營運者與旅客不同之觀點，詳盡地探討分析反映旅運需求變化之列車服務設計問題架構，可應用雙層次規劃列車服務計劃之設計模式進行。其中，上述之旅客選擇之列車需求模式為列車服務計劃設計模式之下層問題；營運者服務計畫特性之選擇為上層問題，路線容量、車隊規模等為其限制式。其次，針對上述之雙層式列車服務之設計模式中，旅客之旅行成本將受到上層問題中列車服務計劃決策變數之影響，本研究以敏感度分析為基礎(Sensitivity Analysis - Based, SAB)之演算法來求解。
最後，在鐵路路線軌道與場站設置限制下，以尖峰小時理想時刻表為基礎，並參酌台灣高速鐵路處理列車運行衝突的實務經驗，建立列車排點數學規劃模式，確實地排除各列車排點的衝突，除了求取合適之列車時刻表與運行圖，更冀望能提昇高速鐵路之營運績效。
Service design is one of most importation tasks in the strategic and tactical planning process for a Taiwan high-speed rail (HSR) operator. The design of passenger train services is generally considered with the regular interval, or periodic timetable. In a fixed interval (e.g. in one hour), service plan decisions are selections of stop pattern and service frequency. In a service plan, passengers of different origin-destination may take the same train together. One passenger’s choice is dependent on other passenger’s choices, when seating capacity and crowding effect are considers. Therefore, we need a passenger’s choice model to estimate the demand of each type of train service with the fixed O/D demand, or the passenger’s response to a specific service plan. In order to design a good service plan, the knowledge of passenger’s choice of train service is essential.
Therefore, this research includes three parts. In the first part, the study focuses on the discussion of train demand issues and some passenger’s choice modeling techniques of train service. The passenger’s choice of train service in the model is a route choice problem with a train service network and a generalized cost function. The generalized cost includes in-vehicle travel time, access/egress travel time, waiting and transfer time, fare, and the discomfort index for the crowding in the train. The discomfort index is a flow-dependent variable, that is, its value is dependent on the number of passengers in the train. The passenger’s choice behavior can be formulated as a deterministic user equilibrium problem and a stochastic logit choice problem. It follows that; many available traffic assignment techniques can be applied to investigating such a route choice problem.
Secondly, The study presents a modeling framework for solving the service plan problem of Taiwan high-speed rail. The framework explicitly considers both the Passenger’s and the operator’s viewpoints in a bi-level program. The passenger’s choice model is the lower level problem in the bi-level program. The upper-level problem is an operator’s model for choosing the stop pattern and frequency of train service, with the constraints of line capacity, fleet size, and so on. The iterative sensitivity-based algorithm solves the bi-level programming problem. The lower level problem and the upper level problem are solved iteratively each iteration. When the low level problem is solved, the sensitivity of the upper level decision variable results in a function of lower level flow variables. The sensitivity function will then be used in solving the upper level problem. At last, a numerical example will show the function and performance of the model for the service design problem of Taiwan high speed rail.
Thirdly, The study presents a mathematical programming model for the train dispatch problem. The primary challenge in such a problem is to determine the appropriate time and location for each conflicting train to overtake another train. The purpose of the model is to construct an efficient train diagram and timetable for a realistic railway system. The model was tested with some examples of Taiwan high speed train service plan to show its function and effectiveness for the train dispatch problem.
1. 交通部高速鐵路工程籌備處，「高速鐵路營運績效之研究」，民國82年3月。
2. 交通部高速鐵路工程籌備處，「高速鐵路增設苗栗、彰化及雲林車站之初步評估」，民國85年12月。
3. 李宇欣、陳立文，以鄰近搜尋法求解鐵路排點與錯會車問題，新世紀軌道運輸國際學術研討會，頁267-278，民國八十九年十月。
4. 李治綱、陳鑑康，列車運行績效之模擬分析，運輸計劃季刊，第二十四卷，第一期，頁1-14，民國84年。new window
5. 張有恆，「大眾捷運系統營運與管理」，華泰書局，民國83年7月。
6. 沈進成，「高速鐵路系統最適停站方式之研究」，成功大學博士論文，民國八十五年六月。new window
7. 卓訓榮，最短路徑與廣義反矩陣敏感度分析方法之比較，運輸計劃季刊，第二十一卷，第一期，頁23-34，民國八十一年。
8. 卓訓榮、羅仕京，以廣義反矩陣之特性推導路徑非負流量之研究，運輸學刊，第十一卷，第二期，頁39-48，民國八十八年。new window
9. 施崇棠，「列車運行表製定之電腦化」，交通大學管理科學研究所碩士論文，民國六十五年七月。new window
10. 黃信隆，「列車排點電腦化應用於台鐵之研究」，交通大學管理科學研究所碩士論文，民國六十六年六月。
11. 郭柏君，「台鐵西部幹線城際客運列車系統規劃」，交通大學碩士論文，民國八十五年六月。
12. 張蓴著，「鐵路運輸學理論與實務」-修訂本，台灣商務印書館，民國八十年九 月。
13. 蕭銘雄，「考慮活動與旅運的旅行時間價值研究」，成功大學博士論文，民國86年6月。new window
14. Akamatsu, T., (1996), ”Cyclic Flows, Markov Process and Stochastic Traffic Assignment”, Transportation Research, Vol. 30B, No. 5, pp. 369-386.
15. Anthony, R. N. (1965), Planning and Control System: A Framework for Analysis, Harvard, Boston.
16. Assad, A. A. (1980a), ”Modelling for Rail Networks：Toward a Routing-Makeup model”, Transportation Research, Vol.14B, pp.205-220.
17. Assad, A. A. (1980b), ”Models for Rail Transportation”, Transportation Research, Vol.14A, No. 1/2, pp.205-220.
18. Bell, M. G. H., (1995), ”Alternatives to Dial’s Logit Assignment Algorithm”, Transportation Research, Vol. 29B, No.3, pp. 287-295.
19. Ben-Ayed, O., Boyce, D. E. and Blair, C. E. (1988), ”A General Bilevel Linear Programming Formulation of the Network Design Problem”, Transportation Research, Vol.22B, pp.311-318.
20. Ben-Ayed, O. and Blair, C. E. (1990), " Computational Difficulties of Bilevel Linear Programming", Operations Research, Vol. 38, pp.556-560.
21. Berg, J. H. A. V. D. and Odijk, M. A. (1994), “DONS: Computer Aided Design of Regular Service Timetables”, In Computers in Railway IV, Vol. 2, Edited by Murthy, T.K.S., Mellitt, B., Brebbia, C.A., Sciutto, G., and Sone, S., pp. 109-117, Computational Mechanics Publications, Southampton, U. K.
22. Bussieck, M. R., Kreuzer, P. and Zimmermann, U. T. (1996), ”Optimal Line for Railway System”, European Journal of Operational Research, Vol. 96, No. 3, pp.54-63.
23. Bussieck, M. R., Winter, T. and Zimmermann, U. T. (1997), ”Discrete Optimization in Public Rail Transport”, Mathematical Programming, Vol. 79, pp.415-444.
24. Cai, X. and Goh, C.J. (1994), “A Fast Heuristic for the Train Scheduling Problem”, Computers and Operations Research, V.21, pp. 499-510.
25. Cantarella, G. E., and Cascetta, E. (1995), ”Dynamic Process and Equirlibrium in Transportation Networks: Towards a Unifying Theory”, Transportation Science, Vol.29, No.3, pp.305-329.
26. Caprara, A., Fischetti, M., Toth, P., Vigo, D., and Guida, P. L. (1997), ”Algorithms for railway Crew Management”, Mathematical Programming, Vol. 79, pp.125-141.
27. Carey, M. (1994a), ”A Model and Strategy for Train Pathing with Choice of Lines, Platforms, and Routes”, Transportation Research, Vol. 28B, No.5, pp.333-353.
28. Carey, M. (1994b), ”Extending A Train Pathing Model from One-Way to Two-Way Track”, Transportation Research, Vol. 28B, No.5, pp.395-400.
29. Carraresi, P., Malucelli, F. and Pallottino, S. (1996), ”Regional Mass Transit Assignment With Resource Constraints”, Transportation Research, Vol. 30B, No.1, pp.81-98.
30. Ceder, A. (1988) “Designing Transit Short-Turn Trips with the Elimination of Imbalanced Loads”, In Computer-Aided Transit Scheduling, Edited by Daduna, J. R., and Anthony, W., pp.288-303, Springer-Verlag, Berlin Heidelberg, Germany.
31. Ceder, A. (1991), “A Procedure to Adjust Transit Trip Departure Times through Minimizing the Maximum Headway”, Computers and Operations Research, V.18, No.5, pp.417-431.
32. Chen, H. and Yao, D. D. (1993), “Dynamic Scheduling of A Multiclass Fluid Network.” Operations Research, Vol.41, No. 6, pp.1104-1115.
33. Claessens, M. T. (1994), ”A Mathematical Programming Model to Determine a Set of Operation Lines at Minimal Costs”, COMPRAIL’94, pp.117-123.
34. Crainic, T.G., Ferland, J. A. and Rousseau, J. M. (1984), ”A Tactical Planning Model for Rail Freight Transportation”, Transportation Science, Vol.18, No.2, pp.165-184.
35. Crainic, T.G. and Roy, J. (1988), ”OR Tools for Tactical Freight Transportation Planning”, European Journal of Operational Research, Vol.33, pp.290-297.
36. Crainic, T.G., Florian, M. and Leal, J. (1990), ”A Model for the Strategic Planning of National Freight Transportation by Rail”, Transportation Science, Vol.24, No.1, pp.1-24.
37. Cury, J. E., Gomide, F. A. E. and Mendes, M. J. (1980), “A Methodology fot Generation of Optimal Schedules for An Underground Railway Systems”, IEEE Trans. Automat. Contr, Vol.25, No.2, pp.217-222.
38. Daganzo, C. F., (1983), ”Stochastic Network Equilibrium with Multiple Vehicle Types and Asymmetric, Indefinite Link Cost Jacobians”, Transportation Science, Vol. 17, pp. 282-300.
39. Den Brok, M. and Vissers, R. VRT. (1994), “A New Systems Architecture for Planning and Control of Train Traffic in The Netherlands”, In Computers in Railway IV, Vol. 2, Edited by Murthy, T.K.S., Mellitt, B., Brebbia, C.A., Sciutto, G., and Sone, S., pp. 19-26, Computational Mechanics Publications, Southampton, U. K.
40. Dial, R. B. (1971), “A Probabilistic Multipath Traffic Assignment Model which Obviate the Need for Path Enumeration”, Transportation Research, Vol. 5, pp. 83-111.
41. Dreier, J. and Brockmann, U. (1996), “Integrated Syetem Planning for Railways”, In Computers in Railway V, Vol. 1, Edited by Allan, J., Brebbia, R. J., Hill, R. J., Sciutto, G., and Sone, S., pp.155-168, Computational Mechanics Publications, Southampton, U. K.
42. Dupuis, P. and Nagurney, A. (1993), ”Dynamical Systems and Variational Inequalities”, Ann. Oper. Res, Vol.44, pp.9-42.
43. Fiacco, A. V. (1983), Introduction to Sensitivity and Stability Analysis in Nonlinear Programming. Academic Press, New York.
44. Fisk, C. S. (1980), ”Some Developments in Equilibrium Traffic Assignment”, Transportation Research, Vol.14B, pp.243-255.
45. Fisk, C. S. (1984), ”Game Theory and Transportation Systems Modelling”, Transportation Research, Vol.18B, No.4/5, pp.301-313.
46. Fowkes, T., and Nash, C. (1991), Analysis Demand for Rail Travel, Avebury Academic Publishing Group.
47. Garfinkel, R. S. and Nemhauser, G. L. (1972), Integer Programming. John Wiley & Sone, Inc.
48. Genser, R. (1977), “Scheduling and maintenance planning in rail transportation”, In Optimization Applied to Transportation Systems, Edited by Strobel, H., Genser, R., and Etschmaier, M., pp. 91-118, International Institute for Applied System Analysis, Laxenburg, Austria.
49. Gertabakh, I. and Serafini, P. (1991), ”Periodic Transportation Schedules with Fixed Departure Times”, European Journal of Operational Research, Vol.50, pp.298-309.
50. Goh, C.J. and Mees, A. I. (1991), “Optimal Control on a Graph with Application to Train Scheduling Problem”, Mathematical Computing Modelling, V.15, No.2, pp. 49-58.
51. Haghani, A. E. (1987), ”Rail Freight Transportation：A Review of Recent Optimization Models for Train Routing and Empty Car Distribution”, Journal of Advanced Transportation, Vol.21, No.2, pp.147-172.
52. Haghani, A. E. (1989), ”Formulation and Solution of a Combined Train Routing and Makeup, and Empty Car Distribution Model”, Transportation Research, Vol. 23B, No.6, pp.433-452.
53. Han, A. F. (1987), “Assessment of Transfer Penalty to Bus Riders in Taipei：A Disaggregate Demand Modeling Approach”, Transportation Research Record, 1139, pp.8-14.
54. Harker, P. T. (1990), “The Use of ATCS in Scheduling and Operating Railroads: Models, Algorithms and Applications”, Transportation Research Record, 1263, pp. 101-110.
55. Heber, K. and Uhlmann, M. (1992), “Computer-aided timetable diagram generation-situation and experience at the Dresden Regional headquaters of the Deutsche Reichsbahn”, Rail International, pp.14-19.
56. Hooghiemstra, J. S. (1996), “Design of Regular Interval Timetables for Strategic and Tactical Railway Planning”, In Computers in Railway V, Vol. 1, Edited by Allan, J., Brebbia, R. J., Hill, R. J., Sciutto, G., and Sone, S., pp.393-402, Computational Mechanics Publications, Southampton, U. K.
57. Jovanovic, D. (1989), Improving Railroad On-time Performance: Models, Algorithms and Applications, Ph.D.Thesis, University of Pennsylvania, U. S. A.
58. Jovanovic, D. and Harker, P.T. (1990), “A Decision Support System for Train Dispatching: An Optimization-Based Methodology”, Journal Transportation Research Forum 31, pp.25-37.
59. Jovanovic, D. and Harker, P.T. (1991a) “Tactical Scheduling of Rail Operations : the SCAN I System.”, Transportation Science. V.25, N.4, pp.46-64.
60. Jovanovic, D. and Harker, P. T. (1991b), “Decision Support System for Train Dispatching : An Optimization-Based Methodology”, Transportation Research Record 1314, pp.31-40.
61. Karry, D. R. (1993), Learning Methods in Optimization: With Application to Railroad Control, Ph.D. dissertation, Decision Science Department, The Wharton School, University of Pennsylvania, U.S.A.
62. Karry, D. R. and Harker, P. T. (1995), ”Real-Time Scheduling of Freight Railroads”, Transportation Research, Vol. 29B, No.3, pp.213-229.
63. Kataoka, K. and Komaya, K. (1994), “Computer-Aided Railway Scheduling Systems for Highdensity Train Operations”, In Computers in Railway IV, Vol. 2, Edited by Murthy, T.K.S., Mellitt, B., Brebbia, C.A., Sciutto, G., and Sone, S., PP. 43-50, Computational Mechanics Publications, Southampton, U. K.
64. Keaton, M. H. (1989), ”Designing Optimal Railroad Operating Plans：Lagrangian Relaxation and A Heuristic Approaches”, Transportation Reasearch, Vol.23B, No.6, pp.415-431.
65. Keaton, M. H. (1992), ”Designing Railroad Operating Plans：A Dual Adjustment Method for Implementing Lagrangian Relaxation”, Transportation Science, Vol.26, No.4, pp.263-279.
66. Kroon, L. G. and Zwaneveld, P. J. (1997), ” Routing Trains Through Railway Stations：Complexity Issuse”, European Journal of Operational Research, Vol. 98, No.3, pp.485-598.
67. Lardinois, C., Crainic, T.G. and Dion, J. (1992), ”An Interactive Graphic Approach for The Integrated Design of Intercity Transportation Timetables and Vehicle Operations”, Computers Operational Research, Vol.19, No.2, pp.139-149.
68. Mees, A. I. (1991), “Railway Scheduling by Network Optimization”, Mathematical Computing. Modelling, Vol.15, No.1, pp.33-42.
69. Nemhauser, G. L. and Wolsey, L. A., (1988), Integer and Combinatorial Optimization. New York: Wiley.
70. Odijk, M. A. (1996), ”A Constraint Generation Algorithm for the Construction of Periodic Railway Timetables”, Transportation Research, Vol. 30B, No.6, pp.455-464.
71. Odijk, M. A., Maarschalkerweerd, M. S. R. A. M. and Weits, E. A. G. (1996), “Timetable-Independend Design and Analysis of Railway Infrastructure”, In Computers in Railway V, Vol. 1, Edited by Allan, J., Brebbia, R. J., Hill, R. J., Sciutto, G., and Sone, S., pp.3-12, Computational Mechanics Publications, Southampton, U. K.
72. Oppenheim, N. (1995), Urban Travel Demand Modeling, Wiley Interscience.
73. Perko, L. (1991), Differential Equations and Dynamical Systems, Springer-Verlag, New York.
74. Petersen, E. R., Taylor, A. J. and Martland, C. D. (1986), “An Introduction to Computer Assisted Train Dispatch”, Journal of Advanced Transportation, Vol.20, pp.63-72.
75. Petersen, E. R., and Merchant, R. (1981), “Scheduling of Trains in A Linear Railway System”, INFOR. Vol.19, pp.246-258.
76. Sauder, R. L. and Westerman, W. M. (1983), “Computer-Aided Train Dispatching: decision support through optimization”, Interfaces, Vol.13, pp.24-37.
77. Searle, S. R., (1971), Linear Models. New York: Wiley.
78. Serafini, P. and Ukovich, W. (1989), “A Mathematical Model for Periodic Scheduling Problems”, SIAM Journal on Discrete Mathematics, Vol.2, No.4, pp.550-581.
79. Sheffi, Y., (1985), Urban Transportation Networks：Equilibrium Analysis with Mathematical Programming Methods. Prentice-Hall, Englewood Cliffs, NJ.
80. Sone, S. (1992), ”Novel Train Stopping Patterns for High-Frequency, High-Speed Train Scheduling”, COMPRAIL’92, pp.107-118.
81. Sone, S. (1994), ”High-Speed, High-Density Train Allocation”, COMPRAIL’94, pp.11-18.
82. Szpigel, B. (1973), Optimal Train Scheduling on A Single Track Railway. In M. Ross (eds) Operation Reseach''72 North - Holland.
83. Tobin, R. L., and Friesz, T. L., (1988), "Sensitivity Analysis for Equilibrium Network Flow", Transportation Science, Vol. 22, No. 4, pp.242-250
84. Van Vliet, Y., (1981), ”Selected Node-Pair Analysis in Dial Assignment Algorithm”, Transportation Research, Vol. 15B, pp.65-68.
85. Wheeler, C. F. (1988), ”Scheduling Techniques for Maximizing Urban Passenger Rail Service while Minimizing Vehicle Requirements”, LIGHT RAIL TRANSIT: New System Successes at Affordable Prices, pp.645-656.
86. White, W. W. (1972), ”Dynamic Trans-shipment Networks: An Algolithm and Its Applications to the Distribution of Empty Conainters”, Network, Vol. 2, No.3, pp.211-236.
87. Wren, A., Kwan, R. S. K. and Parker, M. E. (1994), “Scheduling of Rail Driver Duties”, In Computers in Railway IV, Vol. 2, Edited by Murthy, T.K.S., Mellitt, B., Brebbia, C.A., Sciutto, G., and Sone, S., PP. 81-90, Computational Mechanics Publications, Southampton, U. K.
88. Wu, J. H., Florian, M., and Marcotte, P., (1994), "Transit Equilibrium Assignment：Model and Solution Algorithms", Transportation Science, Vol. 28, No. 3, pp.193-203
89. Yang, H., and Bell, G. H., (1998), ”Models and Algorithms for Road Network Design：A Review and some Developments”, Transport Reviews, Vol.18, No.3, pp.257-278.
90. Yu, J. C., and Lall, U., (1985), ”System and Route Optimization Model for Minimizing Urban Transit Operating Deficits”, Transportation Research Record, 1013, pp. 9-19.
91. Zwaneveld, P. J., Kroon, L. G., Romeijn, H. E. and Salomon, M.(1996), ”Routing Train Through Railway Stations：Model Formulation and Algorithms”, Transportation Science, Vol.30, No.3, pp.181-198.
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
QR Code
QRCODE

臺灣人文及社會科學引文索引資料庫

目前上線人數：671（臺灣：649，外國：22） ／ 本年度總使用人次：2393369 ／ 訪客人次（自102年09月）：68200362
國家圖書館著作權聲明 Copyright © 2013 All rights reserved.
本館地址: 100201臺北市中山南路20號． 本館地圖及交通資訊．
總機：(02)23619132．最佳瀏覽解析度為1024x768以上