隨著近年來國內社會福利制度的日趨健全，身心障礙者運輸問題日益受到社會大眾關注，建立及門服務之撥召運輸系統已是政府相關機構之施政方針，該系統之特點在於路線及班表深具彈性，且能配合不特定運輸需求者之上下車時間及地點來規劃。
　　從國外撥召運輸系統營運案例發現，隨著其服務範圍擴大，路線規劃的複雜度將巨幅增加，若未妥善處置將降低系統營運之有效性。研究以現行已實際商業營運之台北市復康巴士為研究對象，現行台北市復康巴士係由台北市政府交通局採公開招標方式，委由民間業者營運，其預約服務系統之路線規劃方式，為待預約時間截止後，以人工比對方式將所有需求資料依經驗進行路線編排。此種運作模式固然易於實行，但較缺乏彈性，無法於顧客進行預約時即進行共乘媒合並告知顧客，對目前已嚴重供不應求的台北市復康巴士而言，此種作法勢必無法提高系統營運績效以滿足顧客需求。
　　本文之主要目的，便是以台北市復康巴士現營業者所提供之預約服務為基礎，探討其路線規劃問題之特性並研擬合適之求解策略，藉由動態即時的處理方式來取代目前的人工靜態處理方式。本研究以啟發式尋優法排定車輛路線及班表，經由案例測試可以提高共乘次數、有效發揮運能，對於乘客與業者都有明顯效益。

　　Recently, more attention is being focused on the disabilities and elders to their transportation demand. This makes the dial-a-ride system which is provided with high accessibility and mobility an important issue in Taiwan.
　　The Dial-a-Ride Problem (DARP) consists of designing vehicle routes for many users who specify diversified pick-up and drop-off requests between various origins and destinations. The aim is to plan a set of minimum cost vehicle routes capable of accommodating as many users as possible, under a set of practical constraints. One purpose of this article is to find the main features of the problem associated with Fu-kang Bus’s specific routing concerns.
　　One drawback of the Taipei Fu-kang Bus is the route planners sequenced the stops on the routes themselves. When they had enough experience, this method worked fairly well, but it took more time and didn’t ride-sharing matching immediately. Another purpose of this article is to improve the operational inefficiencies when the customers are online.
　　The heuristic algorithm designed for the realistic problem could reduce operating costs, and save more manpower by organizing routes to minimize the number of direct trips and thereby reduce the number of vehicles.

1.張有恆，都市公共運輸第二版，華泰文化事業公司，民國91年
2.張本和、洪軍爝，「伊甸復康巴士車隊管理系統規劃與實施成效分析」，TAIWAN’S International Conference ＆ Exhibition on ITS 2000，民國89年
3.許晉嘉，宅配業貨物配送路線規劃問題之研究，國立成功大學交通管理科學研究所碩士論文，民國92年
4.曾俊傑，撥召公車路線設計之研究，國立交通大學交通運輸工程研究所碩士論文，民國82年
5.游進俊，靜態撥召服務問題啟發式解法之研究，國立交通大學土木工程研究所碩士論文，民國83年
6.蘇昭銘，「先進撥召公車系統雛形之研究」，行政院國家科學委員會補助專題研究計畫成果報告，民國88年
7.蘇昭銘，「智慧型撥召公車系統之測試研究」，行政院國家科學委員會補助專題研究計畫成果報告，民國90年
8.蘇昭銘、楊琮平，「先進撥召公車營運管理系統之研究」，中華管理學報第一卷第一期第89-114頁，民國89(1)年
9.蘇昭銘、楊琮平等，「新竹科學工業園區彈性路線接駁公車系統之發展構想」，第八屆海峽兩岸都市交通學術研討會，民國89(2)年
10.台北市政府公車處，「台北市公共汽車管理處新聞稿」，民國91年12月10日
11.張凱勝，台北市復康巴士與捷運整合服務之研究，國立台灣大學土木工程學研究所碩士論文，民國93年
12.Anily, S. and Mosheiov, G., “The traveling salesman problem with delivery and backhauls,” Operations Research Letters, Vol. 16, pp. 11-18, 1994.
13.Bell, W. J., Dalberto, L. M., Fisher, M. L. Greenfield, A. J., Jaikumar, R., Kedia, P., Mack, R. G. and Prutzman, P. J., “Improving the distribution of industrial gases with and on-line computerized routing and scheduling optimizer,” Interfaces, Vol. 13, pp. 4-23, 1983.
14.Bodin, L. D. and Sexton, T., “The multi-vehicle subscriber dial-a-ride problem,” TIMS Studies in Management Science, Vol. 2, pp. 73-86, 1986.
15.Borndorfer, R., Klostermeier, F., Grotschel, M. and Kuttner, C., Telebus Berlin: Vehicle scheduling in a dial-a-ride system. Technical Report SC 97–23, Konrad-Zuse-Zentrum fur Informationstechnik Berlin, 1997.
16.Casco, D. O., Golden, B. L. and Wasil, E. A., “Vehicle routing with backhauls: models, algorithm and case studies,” in Vehicle Routing: Methods and Studies, eds. Golden, B. L. and Assad, A. A., North Holland: Amsterdam, 1988.
17.Charikar, M. and Raghavachari, B., “The Finite Capacity Dial-A-Ride Problem,” Proceedings of the 39th Annual Symposium on Foundations of Computer Science, pp. 458, 1998.
18.Cordeau, J. F. and Laporte, G. “A tabu search heuristic for the static multi-vehicle dial-a-ride problem,” Transportation Research Part B, Vol. 37, pp. 579-594, 2003a.
19.Cordeau, J. F. and Laporte, G., “The Dial-a-Ride Problem (DARP): Variants, Modeling Issues and Algorithms,” 4OR-Quarterly Journal of the Belgian, French and Italian Operations Research Societies, Vol. 1, pp. 89-101, 2003b.
20.Desrosiers, J., Dumas, Y., and Soumis, F., “A dynamic programming solution of the large-scale single vehicle dial-a-ride problem with time windows,” American Journal of Mathematical and Management Sciences, Vol. 6, pp. 301-325, 1986.
21.Diana, M., and Dessouky, M. M., “A new regret insertion heuristic for solving large-scale dial-a-ride problems with windows,” Transportation Research Part B, Vol. 38, pp.539-557, 2004.
22.Desrosiers, J., Dumas,Y., Soumis, F., Taillefer, S., and Villeneuve, D., “An algorithm for mini-clustering in handicapped transport,” Les Cahiers du GERAD, G-91-02, Ecole des Hautes Etudes Commerciales, Montreal, 1991.
23.Dumas,Y., Desrosiers, J., and Soumis, F., “Large scale multi-vehicle dial-a-ride problems,” Les Cahiers du GERAD, G-89-30, Ecole des Hautes Etudes Commerciales, Montreal, 1989.
24.Feuersteina, E., and Stougie, L., “On-line single-server dial-a-ride problems,” Theoretical Computer Science, Vol. 268, Issue 1, pp. 91-105, 2001.
25.Gendreau, M., Laporte, G., and Vigo, D., “Heuristics for the traveling salesman problem with pickup and delivery,” Computers and Operations Research, Vol.26, No.7, pp. 699-714, 1999.
26.Hunsaker, B. & Savelsbergh, M.W.P., “Efficient Feasibility Testing for Dial-a-Ride Problems,” Operations Research Letters, No. 30, pp. 169-173, 2002.
27.Ichoua, S., Gendreau, M. and Potvin, J. Y., “Diversion issues in real-time vehicle dispatching,” Transportation Science, Vol. 34, No. 4, pp. 426-438, 2000.
28.Ioachim, I., Desrosiers, J., Dumas, Y. and Solomon, M. M., “A request clustering algorithm for door-to-door handicapped transportation,” Transportation Science, Vol. 29, pp. 63-78, 1995.
29.Jaw, J., Odoni, A. R., Psaraftis, H. N., and Wilson, N. H. M., ”A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows,” Transportation Research Part B, Vol. 20, pp. 243-257, 1986.
30.Kalantari, B., Hill, A. V. and Arora, S. R., “An algorithm for the traveling salesman problem with pickup and delivery customers,” European Journal of Operational Research, Vol. 22, pp. 377-386, 1985.
31.Madsen, O. B. G., Ravn, H. F. and Rygaard, J. M., “A heuristic algorithm for the a dial-a-ride problem with time windows, multiple capacities, and multiple objectives,” Annals of Operations Research, Vol. 60, pp. 193-208, 1995.
32.Mosheiov, G., “The traveling salesman problem with pick-up and delivery,” European Journal of Operational Research, Vol. 79, pp. 299-310, 1994.
33.Psaraftis, H. N., “A dynamic programming approach to the single-vehicle, many-to-many immediate request dial-a-ride problem,” Transportation Science, Vol. 14, pp. 130-154, 1980.
34.Psaraftis, H. N., “An exact algorithm for the single-vehicle many-to-many dial-a-ride problem with time windows,” Transportation Science, Vol. 17, pp. 351-357, 1983.
35.Psaraftis, H. N., “Dynamic vehicle routing problems,” in Vehicle Routing: Methods and Studies, eds. Golden, B. L. and Assad, A. A., North Holland: Amsterdam, 1988.
36.Psaraftis, H. N., “Dynamic vehicle routing: Status and Prospects,” Annals of Operations Research, Vol. 61, pp. 143-164, 1995.
37.Regan, A. C., Mahmassani, H. S. and Jailiet, P., “Improving efficiency of commercial vehicle operations using real-time information: potential uses and assignment strategies,” Transportation Research Record, Vol. 1493, pp. 188-198, 1994.
38.Renaud, J., Boctor, F. F. and Ouenniche, J., “A heuristic for the pickup and delivery traveling salesman problem,” Computers and Operations Research, Vol. 27, pp. 905-916, 2000.
39.Samuel, W. L., Autonomous dial-a-ride transit Benefit-Cost Evaluation, Volpe National Transportation Systems Center, August 1998.
40.Sexton, T. and Bodin, L. D., “Optimizing single vehicle many-to-many operations with desired delivery times: I. Scheduling,” Transportation Science, Vol. 19, pp. 378-410, 1985a.
41.Sexton, T. and Bodin, L. D., “Optimizing single vehicle many-to-many operations with desired delivery times: II. Routing,” Transportation Science, Vol. 19, pp. 411-435, 1985b.
42.Shieh, H. M., & May, M. D., “On-Line vehicle routing with time windows: Optimization based heuristics approach for freight demands requested in Real-Time,” Transportation Research Record, No. 1617, pp.171-178, 1998.
43.Solomon, M. M., “Algorithms for the vehicle routing and scheduling problems with time window constraints,” Operations Research, Vol. 35, No. 2, pp. 254-265., 1987.
44.Thangiah, S. R., Potvin, J. Y. and Sun, T., “Heuristic approaches to vehicle routing with backhauls and time windows,” Computers and Operations Research, Vol. 23, No. 11, pp. 1043-1057, 1996.
45.Toth, P. and Vigo, D., Fast local search algorithms for the handicapped persons transportation problem, In: Osman IH, Kelly JP (eds) Meta-heuristics: Theory and applications. Kluwer, Boston, pp. 677-690, 1996.
46.Toth, P. and Vigo, D., “Heuristic algorithms for the handicapped persons transportation problem,” Transportation Science, Vol. 31, pp. 60-71, 1997a.
47.Toth, P. and Vigo, D., “An exact algorithm for the vehicle routing problem with backhauls,” Transportation Science, Vol. 31, No. 4, pp. 372-385, 1997b.
48.Toth, P. and Vigo, D., “A heuristic algorithm for the symmetric and asymmetric vehicle routing problem with backhauls,” European Journal of Operational Research, Vol. 113, pp. 528-543, 1999.
49.Wade, A. C. and Salhi, S., “An investigation into a new class of vehicle routing problem with backhauls,” Omega, Vol. 30, pp. 479-487, 2002.
50.Wang, Y. N., Russell, G. and Thompson, I. B., “A GIS based Information Framework for dynamic vehicle routing and scheduling,” Vehicle Electronics Conference, Proceeding of IEEE International, Vol. 1, pp. 474-479, 1999.
51.Weigel, D. and Cao, B., “Applying GIS and OR techniques to solve Sears technician-dispatching and home-delivery problems,” Interfaces, Vol. 29, pp. 112-130, 1999.
52.Wolfler, C. R. and Colorni, A., “An approximation algorithm for the dial-a-ride problem,” (submitted for publication), 2002.
53.Yano, C., Chan, T., Richter, L., Cutler, T., Murty, K. and McGettigan, D., “Vehicle routing at quality stores,” Interfaces, Vol. 17, pp. 52-63, 1987.