臺灣博碩士論文加值系統

隨著氣候變遷與全球暖化，鼓勵民眾搭乘公共運輸已經是普世價值，不但可以減少私人運具使用造成之廢氣排放與道路擁擠，同時對於弱勢族群、高齡民眾、未成年學童、身心障礙使用者等無法或不便使用私人運具的族群，提供基本民行之保障，進而減少可能之運輸安全肇事事故之發生。
以我國為例，都會地區搭乘大眾運輸工具已是常態，但偏鄉地區大眾運輸使用率卻相對較低，近年來花東地區公共運輸市占率往往遠低於全國帄均，甚至敬陪末座。客運站點設置過遠、候車或換車時間較長等都是民眾不願搭乘大眾運輸工具之原因。伴隨著臺灣人口老年化，高齡駕駛汽機車情形逐年增加，尤其是偏鄉地區長者們多半自行處理生活起居，舉凡就醫回診、外出購物、旅行出遊等，往往因為駕駛者反應較慢且駕駛技術退化，衍生不少交通事故，造成更多社會問題。
除此之外，未成年學童上下學，往往因為父母離鄉背井外出工作，多數僅能由年邁的長輩接送，甚至未成年無照駕駛也時有所聞。為改善偏鄉公共運輸服務品質與效能，輔導業者投入發展需求反應式公共運輸系統，期望能滿足偏鄉居民基本民行，進而減少私人運具使用與交通事故。
花東地區因地緣狹長，公路公共運輸系統其定線定班的服務未能滿足當地需求，因此政府推動發展需求反應式公共運輸系統(DRTS)，然而現行的DRTS大多需要較長的前置預約時間，且偏鄉地區民眾需求較少，所處位置也較為分散。本研究探討在不同時段之需求，分別運用指派問題(Assignment Problem)與同時接送車輛途程派遣問題(Simultaneously Pick-up and Delivery Vehicle Routing Problem)，進行定線定班(FRFS)DRTS 兩種系統之派遣規劃。
實驗分析中，首先以運用LINGO 最佳化軟體測詴小型路網之可運行性，再針對目前政府於花蓮縣玉里鎮施行全國第一個以計程車為運具之需求反應式公共運輸系統(DRTS)，運用兩種情境模式進行實際案例分析。分析結果顯示，在定線定班模式，藉由分析歷史資料，於不同時段派遣不同車型；在需求反應式公共運輸系統，同樣運用過去資料推估站點需求量，運用最短路徑求得接送順序。期望透過本研究給予業者建議，建構出最佳行經路線，達到降低成本、提高服務效率。

While the increasing consciousness on climate changes and global warming in recent years, encouraging people to take public transportation is an important issue. Taking public transportation not only solve the problem of road congestion that caused by the increasing of holding private transport and utilization rate of private transport but also provide convenient service for the elderly, underage children and people with physical disability.
Take Taiwan for example, taking public transportation in urban area is normal, but utilization rate of public transport is rare. In recent years, the market share of the public transportation in Hualien and Taitung area is much lower than the national average. The bus stops are too far and waiting time is too long are reasons that why people don’t use public transit. Due to population aging, elderly drivers represent an increasing proportion of car drivers. More elder drivers ride motorcycle to see a doctor, go shopping or travel especially in rural area. However, it happens more transportation accidents because aging affects the reaction time and impacts driving safety.
Due to Hualien and Taitung’s topography, the Fixed Routes and Fixed Scheduling (FRFS) Service is not satisfied for local demands. Therefore, government promotes Demand Responsive Transport System (DRTS). However, the current DRTS needs longer pre-appointment time and demand of rural area is rare. The objective of this paper is to develop dispatch planning for FRFS of DRTS. According to demand that has occurred over a different time period, we use Assignment Problem and Simultaneously Pick-up and Delivery Vehicle Routing Problem.
In case analysis, we use LINGO to test the feasibility of small network at first, then use two scenario analysis focus on the first DRTS based on taxi in Yuli Township, Hualien. According to the result, we dispatch different types of vehicle in different time period by analyzing historical data for the FRFS. For DRTS, we also use historical data to estimate demand of each station and then plan the shortest travel paths. This paper looks forward to give taxi carrier some suggestions about lowering operation costs and improve efficiency of service.

致謝 I
摘要 III
Abstract V
目錄 VII
圖目錄 IX
表目錄 XI
第一章 緒論 1
1.1 研究背景與動機 1
1.2 研究目的 6
1.3 研究範圍 6
1.4 研究流程 7
第二章 文獻回顧 9
2.1 國外需求反應式公共運輸系統之運作模式 9
2.1.1 瑞典哥德堡市FlexRoute系統 9
2.1.2 美國佛羅里達州FlexBus 系統 10
2.1.3 日本德島縣井川町「需求交通系統計畫」 10
2.2 車輛途程問題 10
2.2.1 車輛途程問題之定義 11
2.2.2 車輛途程問題之模型 13
2.3 需求反應式公共運輸系統 18
2.3.1 需求反應式公共運輸系統之定義 18
2.3.2 需求反應式公共運輸系統之模型 20
2.4 指派問題 26
2.5 求解方法 27
第三章 研究方法 29
3.1 研究問題 29
3.2 模型建構 30
3.2.1 模型假設 33
3.2.2 參數設定 34
3.2.3 模型建立 36
第四章 案例分析 41
4.1 玉里DRTS實際營運情況 41
4.1.1 DRTS事前預約 44
4.1.2 DRTS實際乘車體驗 48
4.2 測試數值 49
4.2.1 測試數值設計 50
4.2.2 測試數值求解結果 58
4.3 玉里路網 64
4.3.1 玉里路網設計 66
4.3.2 玉里路網求解結果 70
4.3.3 敏感度分析 76
第五章 結論與建議 79
5.1 結論 79
5.2 管理意涵 81
5.2.1 政府方面 81
5.2.2 計程車業者方面 82
5.3 未來研究建議 83
參考文獻 84

交通部運輸研究所(民100)。先進科技運用於公共運輸系統之整理發展架構、指標與推動策略規劃。交通部運輸研究所。
胡大瀛, 廖彩雲 & 陳德政(民98)。即時交通資訊下車輛配送模擬評估架構之建立。運輸學刊第二十一卷，第二期，頁207-250。
陳怡安(民98)。鄉村地區高齡者需求回應運輸服務系統之規劃研究-以台南縣西港鄉為例。中華大學運輸科技與物流管理學系碩士論文，未出版，新竹市。
陳俊穎與蘇昭銘(民103)。以接駁需求反應式公車服務模型解決偏遠地區運輸問題之初探。都市交通半年刊第二十九卷，第一期，頁 32-41。
黃漢瑄(民95)。撥召服務最佳化指派作業之研究。淡江大學運輸管理學系運輸科學碩士論文，未出版，新北市。
楊淑芳(民95)。以巨集啟發式演算法求解即時資訊下之中型車共乘問題。淡江大學運輸管理學系運輸科學碩士論文，未出版，新北市。
蘇昭銘, 王貴枝, 王張煒 & 何文基(民101)。滿足無縫運輸觀點之需求反應式大眾運輸服務派遣系統。
An, Yu , Zhang, Yu and & Zeng, Bo. (2015). The Reliable Hub-and-spoke Design Problem: Models and Algorithms. Transportation Research Part B, Vol. 77.
Arnold, P., Peeters, D., & Thomas, I. (2004). Modelling a Rail/Road Intermodal Transportation System. Transportation Research Part E, Vol. 40, pp. 255-270.
Baker, B. M., & Sheasby, J. (1999). Extensions to the generalized assignment heuristic for vehicle routing. European Journal of Operational Research, Vol. 119(1), pp. 147-157.
Berbeglia, G., J.-F. Cordeau, & G. Laporte. (2010). Dynamic Pickup and Delivery Problems. European Journal of Operational Research, Vol. 202(1), pp. 8-15.
Carotenuto, P., Serebriany, A., & Storchi, G. (2011). Flexible Services for People Transportation: A Simulation Model in a Discrete Events Environment. Procedia Social and Behavioral Sciences, Vol. 20, pp. 846-855.
Chen, H. K., Hsueh, C. F., & Chang, M. S. (2006). The Real-time Time-dependent Vehicle Routing Problem. Transportation Research Part E, Vol. 42, pp. 383-408.
Christofides, N., Mingozzi, A. & Toth, P. (1981). Exact Algorithms for the Vehicle Routing Problem, Based on Spanning Tree and Shortest Path Relaxations . Mathematical Programming, Vol. 20, pp. 255-282.
Chu, P.C., & Beasley, J.E. (1997). A Genetic Algorithm for the Generalised Assignment Problem. Computers & Operations Research, Vol. 24(1), pp. 17-23.
Clarke, G., & J. W. Wright. (1964). Scheduling of Vehicles from a Central Depot to a Number of Delivery Points. Operations Research, Vol. 12, pp. 568-581.
Cordeau, J. & Laporte G. (2003). The Dial-a-Ride(DARP): Variants, modeling issues and algorithms. Quarterly Journal of the Belgian, French and Italian Operations Research, Vol. 1, pp. 89-101.
Cordeau, J.-F., & G. Laporte. (2007). The Dial-a-ride Problem: Models and Alogorithms. Annals of Operations Research, Vol. 153, Vol. 1, pp. 29-46.
Coslovich, L., Pesenti, R., & Ukovich, W. (2006). A Two-Phase Insertion Technique of Unexpected Customers for A Dynamic Dial-a-Ride Problem. European Journal of Operational Research, Vol. 175, pp. 1605-1615.
Dantzig, G. B., & J. M. Ramser. (1959). The Truck Dispatching Problem. Management Science, Vol. 6, pp. 81-91.
Fisher, M. L., & R. Jaikumar. (1981). A Generalized Assignment Heuristic for the Vehicle Routing Problem. Network, Vol. 11, pp. 109-124.
Forsyth, P. & Wren, A. (1997). An Ant System for Bus Driver Scheduling. International Workshop on Computer-Aided Scheduling of Public Transport, Vol. 7, (pp. 87-100). Boston.
Fortuhi, F., & Huynh, N. (2016). Reliable Intermodal Freight Network Expansion with Demand Uncertainties and Network Disruptions. Networks and Spatial Economics, pp. 1-29.
Gillett, B. E., & L. R. Miller. (1974). A Heuristic Algorithm for the Vehicle-dispatch Problem. Operations Research, Vol. 21, pp. 340-349.
Groothedde, B., Ruijgrok, C., & Tavasszy, L. (2005). Towards Collaborative, Intermodal Hub Networks: A Case Study in The Fast Moving Consumer Goods Market. Transportation Research Part E, Vol. 41, pp. 567-583.
Haghani, A., & Jung, S. (2005). A Dynamic Vehicle Routing Problem with Time-dependent Travel Times. Computer & Operations Research, Vol. 32, pp. 2959-2986.
Hernández-Pérez, H., & J.-J. Salazar-González. (2007). The One-commodity Pick-up-and-delivery Traveling Salesman Problem: Inequalities and Algorithms. Networks, Vol. 50(4), pp. 258-272.
Hu, T. Y., & Chang, C. P. (2013). Exact Algorithm for Dial-a-Ride Problems with Time-Dependent Travel Cost. Journal of the Eatern Asia Society for Transportation Studies, Vol. 10, pp. 916-933.
Huang, G., & Lim, A. (2006). A hybrid genetic algorithm for the Three-Index Assignment Problem. European Journal of Operational Research, Vol. 172(1), pp. 249-257.
Ishfaq, R., & Sox, C. R. (2011). Hub Location-Allocation in Intermodal Logistic Networks. European Journal of Operational Research, Vol. 210, pp. 213-230.
Kieu, L. M., Bhaskar, A., Almedia, P., Sabar, N., & Chung, E. (2016). Transferring Demand Prediction for Timed Transfer . Journal of Advanced Transportation, Vol. 50, pp. 1972-1989.
Kirchler, D., & R. W. Calvo. (2013). A Granular Tabu Search Algorithm for the Dial-a-ride Problem. Transportation Research Part B: Methodological, Vol. 56, pp. 120-135.
Laporte, G. (2009). Fifty Years of Vehicle Routing. Transportation Science, Vol. 43(4), pp. 408-416.
Luo, Y., & Schonfeld, P. (2011). Online Rejected-Reinsertion Heuristics for Dynamic Multivehicle Dial-a-Ride Problem. Transportation Research Record, Vol. 2218, pp. 59-67.
Markovic, N., Nair, R., Schonfeld, P., Miller-Hooks E., & Mohebbi, M. (2015). Optimizing Dial-a-ride Service in Maryland: Benefits of Computerized Routing Scheduling. Transportation Research Part C, Vol. 55, pp. 156-165.
Martello, S. & Toth, P. (1987). Linear Assignment Problems. Annals of Discrete Mathematics, Vol. 31, pp. 259-282.
Masson, R., Lehuédé P., & Péton O. (2014). The Dial-a-Ride Problem with Transfers. Computers & Operations Research, Vol. 41, pp. 12-23.
Molenbruch, Y., Braekers, K., Caris, A. & Berghe, G. V. (2017). Multi-directional Local Search for a Bi-objective Dial-a-ride Problem in Patient Transportation. Computers & Operations Research, Vol. 77, pp. 58-71.
Núñez, A., Cortés, C. E., Sáez, D., Schutter, B. D., & Gendreau, M. (2014). Multiobjective Model Predictive Control for Dynamic Pickup and Delivery Problems. Contril Engineering Practice, pp. 73-86.
Paquette, J., J. F. Cordeau, G. Laporte, & M. M. Pascoal. (2013). Combining Multicriteria Analysis and Tabu Search for Dial-a-ride Problems. Transportation Research Part B: Methodological, Vol. 52, pp. 1-16.
Powell, W. B. (1996). A Stochastic Formulation of the Dynamic Assignment Problem, with an Application to Truckload Motor Carriers. Transportation Science, Vol. 30(3), pp. 195-219.
Ross, G. T., & Soland R. M. (1975). A branch and bound algorithm for the generalized assignment problem. Mathematical Programming, Vol. 8(1), pp. 91-103.
Savelsbergh, M. W. (1985). Local Search in Routing Problems with Time Windows. Annals of Operations Reasearch, Vol. 4, pp. 285-305.
Schilde, M., Doerner, K. F., & Hartl, R. F. (2014). Integrating Stochastic Time-Dependent Travel Speed in Solution Methods for The Dynamics Dial-a-Ride Problem. European Journal of Operational Research, Vol. 238, pp. 18-30.
Solomon, M. M. (1987). Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints. Operations Research, Vol. 35, pp. 254-265.
Vodopivec, N., Tobias, D., Miller-Hooks, E., and Schonfeld, P. (2015). Taxis as a Recourse Option for Ridersharing Service. Transportation Research Board, Vol. 2536, pp. 86-97.
Wang, S., Liu, Z., & Bell, M. G.H. (2015). Profit-based maritime container assignment models for liner shipping networks. Transportation Research Part B: Methodological, Vol. 72, pp. 59-76.