隨著我國老年人口及身心障礙人口數不斷增加，政府為減輕家庭在長照及身障人數照護上之負擔，提供點到點的交通接送服務以協助行動不便人士外出就醫、就業等需求，而偏鄉地區因醫療資源不足且距離醫療機構較遠之因素，點到點的交通接送服務更扮演著重要角色。
點到點交通接送服務在學術研究中以撥召問題被廣泛討論及研究，且國內、外撥召服務運作多年不乏成功案例，然而，多數案例以運輸距離較短的都市地區為主，本研究以花蓮縣復康巴士為主要研究對象，針對偏鄉長距離運輸特性，對場站車輛配置、車輛派遣決策支援模式等進行優化與改善，期能有效減少空駛里程、提高車輛利用率、強化媒合共乘服務、減少民眾的不滿意度。
本研究同時以花蓮縣復康巴士2016年預約資料為基礎，探討復康巴士服務運營單位應如何調配提前預約及當日預約數量比例，滿足使用者之交通接送需求。

As the elderly population and the number of people with disabilities in our country continue to increase, the government provides door-to-door transportation services to help families reducing the heavy burdens by taking care of their families to call a doctor, work, and so on. Due to the lack of medical resources and the distance to the hospital, the door-to-door transportation service plays an important role in rural areas.
The door-to-door transportation service has been widely discussed and studied in academic research on the dial-a-ride problem, and there have been many successful cases of dial-a-ride problems in domestic and foreign for many years. However, most cases are based on urban areas with short travel distances. This study focuses on the rehabilitation bus of Hualien County. According to the characteristics of long-distance transportation in rural areas, we optimize and improve the vehicle allocation of the depot and vehicle dispatching decision support system to look forward to reducing empty mileage effectively, improve the vehicle utilization rate and the number of carpools, and also reduce the level of dissatisfaction.
Our research is based on the historical data of appointment from the rehabilitation bus of Hualien County in 2016. We discuss how the operating unit should allocate the number of reservations in advance and last-minute reservations under the existing vehicle scale to meet users' demands.

第一章 緒論 1
1.1 研究背景與動機 1
1.2 研究目的 6
1.3 研究範圍 6
1.4 研究流程 7
第二章 文獻回顧 9
2.1 國內外復康巴士營運模式介紹 9
2.2 撥召問題 12
2.2.1 車輛途程問題（Vehicle routing problem） 12
2.2.2 撥召問題（Dial-a-Ride Problem, DARP） 14
2.3 設施選址問題（Facility Location Problem） 19
2.3.1 P-中位問題（P-Median Problem） 19
2.3.2 P-中心問題（P-Center Problem） 20
2.3.3 最大覆蓋區位問題（Maximal Covering Location Problem） 21
2.4 分群（Cluster Problem） 23
2.5 車輛管理（Fleet Management） 25
2.6 小結 30
第三章 研究方法 31
3.1 研究課題 31
3.1.1 建構模型 32
3.1.2 求解工具 33
3.2 模型假設及建立 34
3.2.1 場站配置改善 34
3.2.2 提前預約車輛派遣 36
3.2.3 當日預約車輛派遣 52
第四章 案例分析 61
4.1 花蓮縣復康巴士實際營運情況 61
4.2 場站配置改善 63
4.3 提前預約車輛派遣 66
4.4 當日預約車輛派遣 82
第五章 結論與建議 89
5.1 結論 89
5.2 管理意涵 92
5.3 未來研究 94
參考文獻 97

王峻祺（2018年8月6日）。預約不成率達四分之一 花蓮復康巴士增至20輛。2020年6月10日，取自自由時報：https://news.ltn.com.tw/news/life/breakingnews/2511048。
行政院（2020年2月3日）。長照2.0，照顧的長路上更安心。2020年6月9日，取自行政院：https://www.ey.gov.tw/Page/5A8A0CB5B41DA11E/dd4675bb-b78d-4bd8-8be5-e3d6a6558d8d。
杜品萱（2019）。個案電力公司之最佳中繼站選址模型。東華大學運籌管理研究所碩士倫文。
林于鈞（2018）。我國個案電力公司的物流網路重整與最佳化。東華大學運籌管理研究所碩士倫文。
林秀姿、洪欣慈、蔡佩蓉（2018年1月）。相同健保費，看病命運大不同。2020年6月10日，取自聯合報：https://udn.com/upf/newmedia/2018_data/rural_medical/。
林家賢（2016年3月16日）。你家開車到最近的大醫院要多久時間？ 3張圖帶你看全台緊急醫療資源差距。2020年6月9日，取自關鍵評論網: https://www.thenewslens.com/article/38122。
洪堂堯（2017）。運用 p-中心模式選擇搶修設施設置地點：以台灣電力公司雲林區營業處南區巡修課為例。中正大學企業管理研究所。
胡大瀛、廖彩雲、陳德政（2009）。即時交通資訊下車輛配送模擬評估架構之建立。運輸學刊，21（2），207-249。
袁雨安（2018）。以滾動方式配置與調度出租車輛之研究。東華大學運籌管理研究所碩士倫文。
張靖、鄧淑貞、李泰琳、謝秉融、陳玫君、林怡德（2007）。貨車動態車輛指派與路徑規劃模式之研究。行政院國家科學委員會專題研究計畫成果報告。
陳家和、丁慶榮（2005）。應用螞蟻演算法於時窗限制車輛途程問題之研究。運輸學刊，17（3），261-280。
陳惠國、林奕隆、王宣（2013）。應用修正式蜂群最佳化演算法求解撥召問題-以復康巴士問題為例。運輸學刊，25（3），279-308。
楊豐梅、華國偉、鄧猛、黎建強（2005）。選址問題研究的若干進展。運籌與管理，14（6），1-7。
衛萬明、廖晉廷（2009）。都市停車場區位選擇之研究。設計學報（Journal of Design），9（1）。
Arora, P., & Varshney, S. (2016). Analysis of k-means and k-medoids algorithm for big data. Procedia Computer Science, 78, 507-512.
Bae, H., & Moon, I. (2016). Multi-depot vehicle routing problem with time windows considering delivery and installation vehicles. Applied Mathematical Modelling, 40(13-14), 6536-6549.
Bernábe-Loranca, B., Gonzalez-Velázquez, R., Olivares-Benítez, E., Ruiz-Vanoye, J., & Martínez-Flores, J. (2014). Extensions to K-Medoids with Balance Restrictions over the Cardinality of the Partitions. Journal of applied research and technology, 12(3), 396-408.
Blanquero, R., Carrizosa, E., & Boglárka, G. (2016). Maximal covering location problems on networks with regional demand. Omega, 64, 77-85.
Cheng, C. B., & Wang, K. P. (2009). Solving a vehicle routing problem with time windows by a decomposition technique and a genetic algorithm. Expert Systems with Applications, 36(4), 7758-7763.
Church, R. L., & ReVelle, C. S. (1976). Theoretical and computational links between the p‐median, location set‐covering, and the maximal covering location problem. Geographical Analysis, 8(4), 406-415.
Contardo, C., & Martinelli, R. (2014). A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. Discrete Optimization, 12, 129-146.Arora, P., & Varshney, S. ((2016)). Analysis of k-means and k-medoids algorithm for big data. Procedia Computer Science, 78, 507-512.
Cordeau, J. F. (2006). A branch-and-cut algorithm for the dial-a-ride problem. Operations Research, 54(3), 573-586.
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, 175(3), 1605-1615.
Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management science, 6(1), 80-91.
De Almeida Correia, G. H., & Antunes, A. P. (2012). Optimization approach to depot location and trip selection in one-way carsharing systems. Transportation Research Part E: Logistics and Transportation Review, 48(1), 233-247.
Dell'Amico, M., Fischetti, M., & Toth, P. (1993). Heuristic algorithms for the multiple depot vehicle scheduling problem. Management Science, 39(1), 115-125.
Dong, W., Zhou, K., Qi, H., He, C., & Zhang, J. (2018). A tissue P system based evolutionary algorithm for multi-objective VRPTW. Swarm and evolutionary computation, 39, 310-322.
Frade, I., & Ribeiro, A. (2015). Bike-sharing stations: A maximal covering location approach. Transportation Research Part A: Policy and Practice, 82, 216-227.
Häme, L., & Hakula, H. (2013). Dynamic journeying under uncertainty. European Journal of Operational Research, 225(3), 455-471.
Ho, S. C., Szeto, W. Y., Kuo, Y. H., Leung, J. M., Petering, M., & Tou, T. W. (2018). A survey of dial-a-ride problems: Literature review and recent developments. Transportation Research Part B: Methodological, 111, 395-421.
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.
Lois, A., & Ziliaskopoulos, A. (2017). Online algorithm for dynamic dial a ride problem and its metrics. Transportation research procedia, 24, 377-384.
London for Transport. (2019). Annual Report and Statement of Accounts. London.
Luo, Y., & Schonfeld, P. (2012). Fleet size metamodel for dial-a-ride services with time constraints. In Sustainable Transportation Systems: Plan, Design, Build, Manage, and Maintain (pp. 257-267).
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.
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.
Monnerat, F., Dias, J., & Alves, M. J. (2019). Fleet management: A vehicle and driver assignment model. European Journal of Operational Research, 278(1), 64-75.
Murawski, L., & Church, R. L. (2009). Improving accessibility to rural health services: The maximal covering network improvement problem. Socio-Economic Planning Sciences, 43(2), 102-110.
Nair, R., & Miller-Hooks, E. (2011). Fleet management for vehicle sharing operations. Transportation Science, 45(4), 524-540.
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.
Pfrommer, J., Warrington, J., Schildbach, G., & Morari, M. (2014). Dynamic vehicle redistribution and online price incentives in shared mobility systems. IEEE Transactions on Intelligent Transportation Systems, 15(4), 1567-1578.
Poulhès, A., & Berrada, J. (2017). User assignment in a smart vehicles’ network: dynamic modelling as an agent-based model. Transportation Research Procedia, 27, 865-872.
Rangel, E. M., Hendrix, W., Agrawal, A., Liao, W. K., & Choudhary, A. (2016). AGORAS: A fast algorithm for estimating medoids in large datasets. Procedia Computer Science, 80, 1159-1169.
Schilde, M., Doerner, K. F., & Hartl, R. F. (2011). Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports. Computers & operations research, 38(12), 1719-1730.