第五章 實例測試與分析
6.2 建議
1. 本研究在模式與演算法之實例測試中，僅針對一家客運公司進行分析，建議未 來能針對其他客運公司的實際營運資料，進行實例測試與敏感度分析，持續驗 證模式的實用性。
2. 本研究僅針對多場站車輛排程問題進行研究，建議後續研究可針對司機員於值 勤時之指派問題繼續探討，使得模式更加完備、更具實用價值。
3. 本研究所提出之 MDVSP 模式是在所有車種均一之假設前提下進行研究，建議 後續可考量不同車輛折舊年限之特性，或加入多車種之規劃考量進行研究，使 模式更能符合實際業者需求。
4. 由於本研究所提出變數固定演算法之選擇程序，是以各場站所須執行之班次數 目做為選擇指標(selection index)，而經由本研究實例測試發現，其測試結果與 傳統貪婪式演算法中要求先將班次較多的場站先行處理之觀念相左，建議後續 可針對本演算法之選擇指標(selection index)進行深入研究，使得本研究所提出 變數固定演算法能更具求解效率。
5. 雖然本研究所提出之變數固定演算法，於本次測試結果顯示具有良好之精確性 與效率性，但考量臺灣地區汽車客運(包含市區公車與公路客運)業者於實務營 運上之複雜性，建議後續可於演算法求解流程中，加入改善起始解之機制，使 得本研究所提出之演算法更具求解品質與實用性。
參考文獻
[1] Baita, F., Pesenti, R., Ukovich, W. and Favaretto, D., “A comparison of different solution approaches to the vehicle scheduling problem in a practical case”, Computer
& Operations Research, Vol. 27, 2000, pp. 1249-1269.
[2] Ball, M., “A Comparison of Relaxations and Heuristic for Certain Crew and Vehicle Scheduling Problems”, Presented at National ORSA/TIMS Meeting, Washington, D.
C., 1980.
[3] Ball, M. O., Magnanti, T. L., Monma, C. L. and Nemhauser, G. L., “Time Constrained Routing and Scheduling”, Handbooks in Operation Research and Management Sciences Volume 8 : Network Routing, 1995.
[4] Beasley, J. E. and Cao, B., “A Tree Search Algorithm for the Crew Scheduling Problem”, European Journal of Operational Research, Vol. 94, No. 3, 1996, pp.
517-526.
[5] Bertossi, A. A., Carraresi, P. and Gallo, G., “On Some Matching Problems Arising in Vehicle Scheduling Models”, Networks, Vol. 17, 1987, pp. 271-281.
[6] Bodin, L. and Golden, B. L., “Classification in Vehicle Routing and Scheduling”, Networks, Vol. 11, 1981, pp. 97-108.
[7] Bodin, L., Golden B., Assad A. and Gall, M., “Routing and Scheduling of Vehicles and Crews – the State of the Art”, Computers & Operations Research, Vol. 10, 1983, pp. 63-211.
[8] Carpaneto, G., Dell’Amico, M., Fischetti, M. and Toth, P., “A branch and bound algorithm for the multiple depot vehicle scheduling problem”, Network, Vol. 19, 1989, pp. 531-548.
[9] Carraresi, P. and Gallo, G., “Network Models for Vehicle and Crew Scheduling”, European Journal of Operational Research, Vol. 16, No. 3, 1983, pp. 139-151.
[10] Daduna, J. R. and Paixão, J., “Vehicle scheduling for public mass transit – an overview”, Computer-aided transit scheduling, Springer, Berlin Heidelberg New York, 1995, pp.76-90.
[11] Dantzig, G. B. and Fulkerson, D. R., “Minimizing the Number of Tankers to Meet a Fixed Schedule”, Naval Res. Log. Quart., Vol. 1, 1954, pp. 217-222.
[12] Forbes, M. A., Holt, J. N. and Watts, A. M., “An exact algorithm for multiple depot bus scheduling”, European Journal of Operational Research, Vol. 72, 1994, pp.
115-124.
[13] Ford, L. R. and Fulkerson, D. R., Flows in Networks, Princeton University Press, N.
J., 1962.
[14] Freling, R., Huisman, D. and Wagelmans, A. P. M., “Models and algorithms for integration of vehicle and crew scheduling”, Journal of Scheduling 6, 2003, pp.
63-85.
[15] Gerard, S., Linear and Integer Programming - Theory and Practice, Second Edition, Marcel Dekker, Inc., 2002.
[16] Gintner, V., Kliewer, N. and Suhl, L., “Solving large multiple-depot
pp.507-523.
[17] Haghani, A. and Banihashemi, M., “Heuristic approaches for solving large-scale bus transit vehicle scheduling problem with route time constraints”, Transportation Research Part A 36, 2002, pp. 309-333.
[18] Haghani, A., Banihashemi, M. and Chiang, K. H., “A comparative analysis of bus transit vehicle scheduling models”, Transportation Research Part B 37, 2003, pp.301-322.
[19] Heurgon, H., “Preparing duty roster for bus routes by computer”, in Preprint Workshop on Automated Technique for Scheduling of Vehicle Operations for Urban Public Transportation Service, 1975.
[20] Hillier, F. S. and Lieberman, G. J., Introduction to Operation Research 8e, McGraw-Hill, New York, 2005.
[21] Hoffman, K. L. and Padberg, M., “Solving airline crew scheduling problem by branch-and-cut”, Management Science, Vol. 39, No. 6, 1993, pp. 657-682.
[22] Katta, G. M., Linear and Combinatorial Programming, Wiley, New York, 1976.
[23] Kliewer, N., Mellouli, T. and Suhl, L., “A time-space network based exact optimization model for multi-depot bus scheduling”, European Journal of Operational Research, Vol. 175, 2006, pp. 1616-1627.
[24] Lamatsch, A., “An approach to vehicle scheduling with depot capacity constraint”, In:
Proceedings of the Fifth International Workshop on Computer-aided Scheduling of Public Transit, Montreal, Canada, 1990.
[25] Lenstra, J. K. and Rinnooy Kan, A.H.G., “Complexity of Vehicle Routing and Scheduling Problem”, Networks, Vol. 11, 1981, pp. 221-228.
[26] Mesquita, M. and Paixão, J., “Multiple depot vehicle scheduling problem: a new heuristic based on quasi-assignment algorithm”, In: Proceedings of the Fifth International Workshop on Computer-aided Scheduling of Public Transit, Montreal, Canada, 1990.
[27] Neapolitan, R., and Naimipour, K., 2004, Foundations of Algorithms-Using C++
Pseudocode, 3rd ed, Jones and Bartlett Publishers, Massachusetts, USA.
[28] Pepin, A., Desaulniers, G., Hertz, A., and Huisman, D., 2006, “Comparison of Heuristic Approaches for the Multiple Depot Vehicle Scheduling Problem”, Odysseus 2006, Altea, Spain (23-26 mai).
[29] Rayward-Smith, V. J., Osman, I. H., Reeves, C. R. and Smith, G. D., Modern Heuristic Search Methods, John Wiley and Sons, New York, 1996.
[30] Ribeiro, C. and Soumis, F., “A Column Generation Approach to the Multiple Depot Vehicle Scheduling Problem”, Operations Research, Vol. 42, 1994, pp. 41-52.
[31] Shepardson, F. and Marsten, R. E., “A lagrangean relaxation algorithm for the two duty period scheduling problem”, Management Science 26, 1980, pp. 274-281.
[32] Wang, J. Y. and Lin, C. K., “A Network Model for the Multiple Depot Vehicle Scheduling Problems of Public Transit”, In: Proceedings of 86th Transportation Research Board Annual Meeting, 2007.
[33] Yan, S., and Tu, Y.P., “A Network Model for Airline Cabin Crew Scheduling”,
European Journal of Operational Research, Vol. 140, No. 3, 2002, pp. 531-540.
[34] 王晉元、林至康，「固定時刻表下之一般性車輛排程模式研究」，運輸計畫季刊，
第三十五卷，第一期，頁107-130，民國 95 年。
[35] 王晉元、林至康等，大眾運輸車隊管理系統核心模組之規劃與建置，交通部運 輸研究所，民國90 年 7 月。
[36] 杜宇平，「空服員排班網路模式之研究」，國立中央大學土木工程學系博士論文，
民國89 年。
[37] 交通部運輸研究所，運輸經濟資料彙編第20 期，民國 95 年。
[38] 交通部運輸研究所，運輸營運手冊，民國75 年。
[39] 卓訓榮、王晉元、蘇昭銘、林至康，大眾運輸車隊管理系統核心模組之推廣應 用，交通部科技顧問室，民國91 年 1 月。
[40] 夏萬春，「禁制搜尋法於車輛排班之探討」，國立高雄第一科技大學機械與自動 化工程學系碩士論文，民國90 年。
[41] 游文松，「公路客運人員與車輛排班之研究」，中華大學科系管理研究所碩士論 文，民國93 年。
[42] 黃俐嘉，「公車路網績效評估模式之研究」，國立台灣大學土木工程學系碩士論 文，民國86 年。
[43] 蔡文昉，「大眾運輸排班系統之研究」，國立交通大學運輸工程與管理學系碩士 論文，民國90 年。
[44] 廖椿煜，「公路客運車輛排班調度制度之研究—以臺灣汽車客運公司為例」，國 立交通大學交通運輸研究所碩士論文，民國74 年。
[45] 盧宗成，「捷運司機員排班問題之研究—以台北捷運公司為例」， 國立交通大學 運輸工程與管理學系碩士論文，民國88 年。
附錄 金門縣公共車船管理處之場站勤務表
班表七 A→A
班表 A→C
班表二 C→A
班表二 C→C