2018年我國進入高齡社會，除了老年人口數增加，身心障礙者也逐年提升，多年來政府為行動不便人士提供點到點的交通接送服務，滿足其行之需求，然而我國城市與偏鄉地區醫療資源差距懸殊，在偏鄉地區除了醫療資源分布不均，就醫距離也相對遙遠，儼然成為我國當前重要之課題。
本研究以花蓮縣復康巴士為主要研究對象，以2016年的歷史預約資料分析使用者的搭乘頻率，採取兩階段的方式優化車輛派遣系統，第一階段根據醫院地點劃分場站之服務範圍及按高頻率之使用者配置場站的車輛數量，第二階段以高頻率之使用者按醫療院所進行分群，並訂定媒合共乘條件，降低乘客之不滿意度，有效減少空駛里程及提高車輛利用率，幫助運營單位建立派遣規則。

Our country has entered an aged society in 2018. With the increasing in elderly population, People with disabilities has also increased year by year. The government has provided door-to-door transportation services for people with disabilities to meet their travel needs. However, there is a huge gap in healthcare resources between urban and rural areas in our country. Besides, the uneven distribution of healthcare resources in rural areas,and the travel distance to hospital is also relatively long, which seems to be an important issue in our country.
This research focuses on the rehabilitation bus of Hualien County. Use the historical data of appointment in 2016 to analyze the user's ride frequency. We take a two-phase approach to optimize the vehicle dispatching system. In the first phase, we divide the service area of the deports based on the hospital locations and allocate the number of vehicle to deports based on the users with high riding frequency. In the two phase, groups are divided by hospitals based on the users with high riding frequency. In this study, we establish matching carpool rules to reduce the level of dissatisfaction and improve the vehicle utilization rate to help operating department establish dispatching rules.

第一章 緒論 1
1.1 研究背景與動機 1
1.2 研究目的 8
1.3 研究範圍 8
1.4 研究流程 8
第二章 文獻回顧 11
2.1 無障礙運輸服務 11
2.2 相關文獻 14
2.2.1 車輛途程問題（Vehicle routing problem） 14
2.2.2 撥召問題（Dial-a-Ride Problem, DARP） 16
2.3 分群演算法（Cluster Algorithm） 20
2.4 車輛管理（Fleet Management） 23
第三章 研究方法 25
3.1 背景介紹 25
3.1.1 建構模型 26
3.1.2 求解工具 26
3.2 模型假設及建立 26
3.2.1 場站車輛配置改善 26
3.2.2 提前預約車輛派遣 28
第四章 案例分析 41
4.1 花蓮縣復康巴士實際營運情形 41
4.2 場站車輛配置改善 43
4.3 提前預約車輛派遣 46
4.4 本研究與陳柔安（2020）之研究結果比較 65
第五章 結論與建議 67
5.1 結論 67
5.2 未來研究 68
參考文獻 69

交通部運輸研究所（民國99年），需求反應式公共運輸系統之整合研究（1/3）
白峻安（2015）。利用類電磁演算法求解於需求反應式撥召問題－以新北市復康巴士為例。淡江大學運輸管理學系碩士班碩士論文，新北市。
沈宗緯, 洪迎哲, & 林雨萱. （2019）. 最鄰近點為準之集群調整法於求解具容量限制之車輛途程問題. 運輸學刊, 31（4）, 449-480.
林民浩, 郭年真, 陳威全, & 溫在弘. （2016）. 剖析台灣民眾的就醫流動: 利用引力模式評估就醫距離與醫療資源分布的影響. 台灣公共衛生雜誌, 35（2）, 136-151.
胡大瀛, 廖彩雲, & 陳德政. （2009）. 即時交通資訊下車輛配送模擬評估架構之建立. 運輸學刊, 21（2）, 207-249.
陳冠宇（2017）。以螞蟻演算法求解動態車輛途程問題。元智大學工業工程與管理學系碩士論文，桃園縣。
陳柔安（2020）。復康巴士派遣最佳化決策支援系統_ 以花蓮縣派遣數據分析為例。國立東華大學運籌管理研究所碩士論文，花蓮縣。
蔡孟儒. （2013）. 求解動態撥召問題: 以復康巴士為例. 淡江大學資訊管理學系碩士班學位論文, 1-67.
盧宗成, 顏上堯, & 林韋捷. （2017）. 電動車共享系統車隊布署最佳化模式. 運輸計劃季刊, 46（2）, 191-216.
Bramel, J., & Simchi-Levi, D. (1995). A location based heuristic for general routing problems. Operations research, 43(4), 649-660.
Cokyasar, T., & Larson, J. (2020). Optimal assignment for the single-household shared autonomous vehicle problem. Transportation Research Part B: Methodological, 141, 98-115.
Colorni, A., Dorigo, M., & Maniezzo, V. (1992, September). An Investigation of some Properties of an" Ant Algorithm". In Ppsn (Vol. 92, No. 1992).
Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management science, 6(1), 80-91.
Detti, P., Papalini, F., & de Lara, G. Z. M. (2017). A multi-depot dial-a-ride problem with heterogeneous vehicles and compatibility constraints in healthcare. Omega, 70, 1-14.
Erdem, M., & Koç, Ç. (2019). Analysis of electric vehicles in home health care routing problem. Journal of Cleaner Production, 234, 1471-1483.
Flynt, A., & Dean, N. (2016). A survey of popular R packages for cluster analysis. Journal of Educational and Behavioral Statistics, 41(2), 205-225.
Hu, T. Y., & Chang, C. P. (2015). A revised branch‐and‐price algorithm for dial‐a‐ride problems with the consideration of time‐dependent travel cost. Journal of Advanced Transportation, 49(6), 700-723.
Jain, A. K. (2010). Data clustering: 50 years beyond K-means. Pattern recognition letters, 31(8), 651-666.
Jin, W. L., Martinez, I., & Menendez, M. (2021). Compartmental model and fleet-size management for shared mobility systems with for-hire vehicles. Transportation Research Part C: Emerging Technologies, 129, 103236.
Jiao, Z., Ran, L., Guan, L., Wang, X., & Chu, H. (2017, June). Fleet management for electric vehicles sharing system under uncertain demand. In 2017 International Conference on Service Systems and Service Management (pp. 1-6). IEEE.
Kang, D., & Levin, M. W. (2021). Maximum-stability dispatch policy for shared autonomous vehicles. Transportation Research Part B: Methodological, 148, 132-151.
Kaufman, L., & Rousseeuw, P. J. (2009). Finding groups in data: an introduction to cluster analysis (Vol. 344). John Wiley & Sons.
Liu, R., Xie, X., Augusto, V., & Rodriguez, C. (2013). Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care. European Journal of Operational Research, 230(3), 475-486.
Lopez, C., Leclercq, L., Krishnakumari, P., Chiabaut, N., & Van Lint, H. (2017). Revealing the day-to-day regularity of urban congestion patterns with 3D speed maps. Scientific Reports, 7(1), 1-11.
Lu, C. C., Yan, S., Li, H. C., Diabat, A., & Wang, H. T. (2021). Optimal fleet deployment for electric vehicle sharing systems with the consideration of demand uncertainty. Computers & Operations Research, 105437.
Madhulatha, T. S. (2011, July). Comparison between k-means and k-medoids clustering algorithms. In International Conference on Advances in Computing and Information Technology (pp. 472-481). Springer, Berlin, Heidelberg.
Madsen, O. B., Ravn, H. F., & Rygaard, J. M. (1995). A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives. Annals of operations Research, 60(1), 193-208.
Melachrinoudis, E., Ilhan, A. B., & Min, H. (2007). A dial-a-ride problem for client transportation in a health-care organization. Computers & Operations Research, 34(3), 742-759.
Ning, F., Jiang, G., Lam, S. K., Ou, C., He, P., & Sun, Y. (2021). Passenger-centric vehicle routing for first-mile transportation considering request uncertainty. Information Sciences, 570, 241-261.
Oliveira, B. B., Carravilla, M. A., Oliveira, J. F., & Toledo, F. M. (2014). A relax-and-fix-based algorithm for the vehicle-reservation assignment problem in a car rental company. European Journal of Operational Research, 237(2), 729-737.
Paquay, C., Crama, Y., & Pironet, T. (2020). Recovery management for a dial-a-ride system with real-time disruptions. European Journal of Operational Research, 280(3), 953-969.
Park, H. S., & Jun, C. H. (2009). A simple and fast algorithm for K-medoids clustering. Expert systems with applications, 36(2), 3336-3341.
Pisinger, D., & Ropke, S. (2007). A general heuristic for vehicle routing problems. Computers & operations research, 34(8), 2403-2435.
Rickert, T., & Reeves, K. (1998). Mobility for all: Accessible transportation around the world.
Tari, F. G., & Hashemi, Z. (2018). Prioritized K-mean clustering hybrid GA for discounted fixed charge transportation problems. Computers & Industrial Engineering, 126, 63-74.