隨機旅行時間下快遞運務員作業排程規劃及即時調整之研究

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：37

、訪客IP：18.222.12.73

姓名

賴峻偉(Chun - wei) 查詢紙本館藏

畢業系所

土木工程學系

論文名稱

隨機旅行時間下快遞運務員作業排程規劃及即時調整之研究
(Courier schedule under stochastic travel times and real time Schedule adjustment)

相關論文

★ 橋梁檢測人力機具排班最佳化之研究	★ 勤業務專責分工下消防人員每日勤務排班最佳模式之研究
★ 司機員排班作業最佳化模式之研究	★ 科學園區廢水場實驗室檢驗員任務指派最佳化模式之研究
★ 倉儲地坪粉光工程之最佳化模式研究	★ 生下水道工程工作井佈設作業機組指派最佳化之研究
★ 急診室臨時性短期護理人力指派最佳化之探討	★ 專案監造人力調派最佳化模式研究
★ 地質鑽探工程人機作業管理最佳化研究	★ 職業棒球球隊球員組合最佳化之研究
★ 鑽堡於卵礫石層施作機具調派最佳化模式之研究	★ 職業安全衛生查核人員人力指派最佳化研究
★ 救災機具預置最佳化之探討	★ 水電工程出工數最佳化之研究
★ 石門水庫服務台及票站人員排班最佳化之研究	★ 空調附屬設備機組維護保養排程最佳化之研究

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

[檢視]

[下載]

本電子論文使用權限為同意立即開放。
已達開放權限電子全文僅授權使用者為學術研究之目的，進行個人非營利性質之檢索、閱讀、列印。
請遵守中華民國著作權法之相關規定，切勿任意重製、散佈、改作、轉貼、播送，以免觸法。

摘要(中)

良好的運務員作業排程規劃可幫助國際快遞物流業者確保資源充分應用與維持快遞服務品質。目前實務上運務員作業排程係由國際快遞物流業者成立之指揮中心依人工經驗進行指派且多以平均旅行時間為依據進行規劃。然而，在實際營運中旅行時間往往受隨機因素造成擾動且新的變動服務需求經常發生，使得業者需經常調整運務員作業排程，以處理隨機旅行時間造成之擾動及新的變動服務需求。此作法不具系統性分析並依賴相關作業人員的主觀判斷，可能導致不佳的規劃決策。有鑑於此，本研究考量隨機旅行時間，針對規劃階段與營運階段分別構建二運務員作業排程規劃模式與二運務員作業排程調整模式，以幫助國際快遞物流業者有效地規劃或調整運務員作業的排程，進而提昇整體的營運績效。
本研究利用時空網路流動技巧分別構建隨機旅行時間下之與運務員排程規劃與調整模式，並進一步修正此等隨機模式之旅行時間為平均旅行時間求，建立二確定性模式。最後，本研究以國際之一大型快遞物流業者的營運資料為例，進行實例測試與分析，模式測試結果良好，比較實際營運績效，最後綜合測試結果提出結論與建議。

摘要(英)

A good courier schedule can help international express carriers to effectively allocate resource and maintain service quality. However, not only new demands often occur in actual operations making the carrier frequently adjust its schedule to meet the new demands, but the schedule is often disturbed arising from variations in vehicle travel times. Currently, courier schedules are planned by the decision center staffs with experience. Without a systematic optimization analysis, these decisions highly depend on the staffs’ subjective judgments and could result in inferior feasible solutions. Therefore, in this research, considering stochastic vehicle traveling times we attempt to develop two courier scheduling models and two courier schedule adjustment models, respectively, for the planning and operational stages. These models are expected to help carriers effectively and efficiently plan and adjust their courier schedules, and thus to improve their operational performance.
In this research, we will employ time-space network techniques and mathematical programming methods to construct the courier scheduling models and schedule adjustment models under stochastic traveling times. Then, we will modify the stochastic travel times/demands as an average travel time to develop two deterministic scheduling models. These models are expectedly formulated as special integer multiple commodity network flow problems, which are characterized as NP-hard. Finally, to evaluate the models and the solution algorithms in practice we performed a case study based on the operating data from a major international express carrier. The test results show that the model is good for this kind of problem. Conclusions and suggestions were given finally.

關鍵字(中)

★ 隨機性旅行時間
★ 運務員排程
★ 排程調整
★ 時空網路

關鍵字(英)

★ Schedule adjustment
★ Time-space network
★ Courier scheduling
★ Stochastic travel times

論文目次

摘要............................................................................................................................... I
Abstract ......................................................................................................................... II
誌謝..............................................................................................................................III
目錄..............................................................................................................................IV
圖目錄..........................................................................................................................VI
表目錄........................................................................................................................ VII
第一章緒論................................................................................................................1
1.1 研究背景與動機.............................................................................................1
1.2 研究目的與範圍.............................................................................................2
1.3 研究方法與流程.............................................................................................3
第二章文獻回顧........................................................................................................5
2.1 國際快遞物流業概述.....................................................................................5
2.2 運務員車隊排程與路線規劃.........................................................................7
2.3 時窗限制之車輛派遣問題.............................................................................9
2.4 時空網路之相關文獻...................................................................................10
2.5 隨機擾動之相關理論與文獻........................................................................15
2.6 文獻評析.......................................................................................................22
第三章模式構建......................................................................................................24
3.1 規劃階段.......................................................................................................24
3.1.1 模式假設或給定條件........................................................................24
3.1.2 隨機性運務員作業排程時空網路....................................................25
3.1.2.1 非預期性懲罰成本( s )
ij b 設計.........................................................30
3.1.3 模式符號說明....................................................................................33
3.1.4 數學模式............................................................................................34
3.1.5 流量分解............................................................................................35
3.2 確定性運務員作業排程模式........................................................................35
3.3 營運階段(隨機性運務員作業排程調整模式).............................................37
3.3.1 動態規劃程序....................................................................................37
3.3.2 即時性運務員作業排程模式............................................................38
3.4 確定性運務員作業排程調整模式...............................................................45
3.5 求解方法.......................................................................................................45
3.6 模擬評估方法...............................................................................................46
3.7 小結...............................................................................................................47
第四章範例測試......................................................................................................48
4.1 資料輸入.......................................................................................................48
4.1.1 運務員作業排程規劃資料................................................................48
4.1.2 服務需求資料....................................................................................50
4.2 模式發展.......................................................................................................52
4.2.1 問題規模............................................................................................52
4.2.2 模式輸入資料....................................................................................54
4.3 電腦演算環境與設定...................................................................................54
4.3.1 電腦演算環境....................................................................................54
4.3.2 相關程式(參數)設定.........................................................................54
4.3.3 模式輸出資料....................................................................................55
4.4 測試結果與分析...........................................................................................56
4.5 敏感度分析...................................................................................................62
4.5.1 成本增加係數敏感度分析................................................................63
4.5.2 需求變動比例敏感度分析................................................................65
4.5.3 挑選車輛數敏感度分析....................................................................67
4.6 情境分析.......................................................................................................70
4.6.1 擾動設計............................................................................................70
4.6.2 非預期懲罰成本設計情境分析-延後..............................................72
4.6.3 非預期懲罰成設計本情境分析-提早..............................................74
4.6.4 即時調整間隔情境分析....................................................................75
4.6.5 需求產生分佈情境分析....................................................................76
4.7 小結...............................................................................................................77
第五章結論與建議..................................................................................................79
5.1 結論...............................................................................................................79
5.2 建議...............................................................................................................80
5.3 貢獻...............................................................................................................81
參考文獻......................................................................................................................82
附錄..........................................................................................................................90

參考文獻

1. 乃啟育，「策略聯盟環境下城際客運排程規劃模式之研究」，碩士論文，國立中央大學土木工程學系(2006)。
2. 申生元，「多趟次車輛途程與排程問題」，行政院國家科學委員會，NSC90-2218-E155-010 (2002)。
3. 余秀梅，「多元商品模式應用在動態貨櫃調度問題之研究」，碩士論文，國立成功大學交通管理科學研究所(1994)。
4. 呂大衛，「我國民營國際快遞業先驅者優勢與競爭對比之研究」，國立交通大學土木工程研究所(1993)。
5. 呂英志，「即時資訊下車輛路線問題之研究」，碩士論文，逢甲大學交通工程與管理研究所(2002)。
6. 辛孟鑫，「撥召運輸系統路線規劃問題之研究－以台北市復康巴士為例」，碩士論文，國立成功大學交通管理科學研究所(2005)。
7. 周文生、黃台生、黃慧娟、王裕民、詹彥倫、許采蘋，「九十三年度臺北地區計程車營運情形調查」，台北縣市政府交通局委託中華民國運輸學會辦理(2004)。
8. 林士鈞，「定期貨櫃運輸船舶排程暨船期表建立之研究」，碩士論文，國立中央大學土木工程學系(2004)。
9. 林育賢，「企業電子化與經營績效關係之研究-以國際快遞業DHL洋基通運為例」，碩士論文，淡江大學商管學院高階主管管理碩士學程(2002)。
10. 林益生，「隨機環境下多商品、多車種派車問題之研究」，碩士論文，中原大學工業工程研究所(1998)。
11. 邱佩諄，「快遞運務員動態調派之模擬分析」，碩士論文，國立交通大學交通運輸工程研究所 (1991)。
12. 邱佩諄，「快遞運務員動態調派之模擬分析」，碩士論文，國立交通大學交通運輸工程研究所 (1991)。
13. 邱明琦、陳春益、林佐鼎，「海運貨櫃排程模式之研究」，運輸計劃季刊，第三十一卷，第三期，第495-522頁(2002)。
14. 侯育周，「隨機性班機到離延誤下動態機門指派之研究」，碩士論文，國立中央大學土木工程學系(2007)。
15. 紀清耀，「快遞運務員作業排程規劃及即時調整之研究」，碩士論文，國立中央大學土木研究所(2008)。
16. 苑鳳萍，「客運車輛擾動下調度系統之研究」，碩士論文，國立交通大學運輸工程與管理研究所(2001)。
17. 唐存寬，「在顧客需求為隨機之假設下多種貨品儲運分配系統設計」，碩士論文，國防管理學院資源管理研究所(1999)。
18. 張秀雲，「具時窗限制之車輛迴轉率與路線規劃問題之研究」，行政院國家科學委員會，NSC89-2416-H006-074 (2001)。
19. 張振邦，「兼營宅配業務之快遞業車輛路線規劃問題」，碩士論文，南台科技大學行銷與流通管理研究所 (2004)。
20. 曹智翔，「短期需求擾動下動態醫療物資輸配送之研究」，碩士論文，國立中央大學土木工程學系(2007)。
21. 許再豐，「即時資訊下動態車輛途程規劃研究」，碩士論文，朝陽科技大學工業工程與管理所 (2004)。
22. 許晉嘉，「宅配業貨物配送路線規劃問題之研究」，碩士論文，國立成功大學交通管理科學研究所 (2003)。
23. 陳妙珍、顏上堯、張珮璇，「航空公司資產與負債管理模式之建立」，第四屆海峽兩岸會計與管理學術研討會論文集，武漢(2000)。
24. 陳俊豪，「因應臨時事件變動租用數機場共用櫃檯即時指派之研究」中央大學土木工程學系(2005)。
25. 陳俊穎，「快遞貨物專區配送方式之研究」，碩士論文，長榮大學經營管理研究所 (2004)。
26. 陳春益、邱明琦，「貨櫃航線網路設計模式之研究」，運輸計劃季刊，第三十一卷，第二期，第267-298頁(2002)。
27. 郭秋泔，「考慮旅行時間限制下之隨機旅行銷售員問題-以國際快遞業為例」，碩士論文，國立高雄第一科技大學運輸倉儲營運所(2004)。
28. 游俊雄、丁國樑，「需求反應旅次運載模擬模式應用於捷運營運班表之評估」，運輸計劃季刊，第二十七卷，第三期，第489-508頁(1998)。
29. 黃議萬，「國際快遞需求行為之研究」，碩士論文，國立交通大學交通運輸工程研究所(1991)。
30. 楊大輝、李綺容，「需求變動下之航空貨運網路規劃」，運輸學刊，第十九卷，第二期，第169-189頁(2007)。
31. 廖建韋，「醫療物資訂購及配送排程規劃之研究」中央大學土木工程學系(2007)。
32. 顏上堯、何淑萍，「飛航排程暨班次表之建立」，運輸計劃季刊，第二十三卷，第一期，第73-90頁(1994)。
33. 顏上堯、杜宇平、陳怡妃，「因應臨時事件機場共用櫃檯即時指派之研究」，運輸計劃季刊，第三十三卷，第一期，第59- 81頁(2004)。
34. 顏上堯、翁綵穗，「季節轉換間緩衝期飛航排程之研究」，運輸計劃季刊，第三十卷，第四期，第891- 922頁(2001)。
35. 顏上堯、齊志仁、湯慶輝，「隨機需求下多目標長途客運排程模式之研究」，運輸計畫季刊，第 34 卷第 1 期，第93-118頁(2005)。
36. 顏上堯、羅智騰，「因應預期性航具維修之系統性飛航排程」，中國土木水利工程學刊，第八卷，第三期，第447-456頁(1996)。
37. 魏榮樺，「在旅行時間限制下之多隨機旅行銷售員問題-國際快遞業運務員責任分區與路線規劃問題為例」，碩士論文，國立嘉義大學運輸與物流工程研究所 (2006)。
38. 羅敏綺，「隨機需求下捷運系統營運模擬模式之構建-以台北市木柵線為例」，碩士論文，國立成功大學交通管理科學研究所(1998)。
39. 蘇志明，「國際快遞服務業之調派模擬分析與個人責任區劃分」，碩士論文，國立台灣大學工業工程學研究所 (1998)。
40. Abara, J., “Applying integer linear programming to the fleet assignment problem,” Interfaces, Vol. 19, pp. 20-28 (1989).
41. Agin, N. and Cullen, D., “An algorithm for transportation routing and vehicle loading,” Logistics, pp. 1-20, North Holland, Amsterdam (1975).
42. Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. P. and Vance, P. H., “Branch-and-price: column generation for solving huge integer programs,” Operations Research, Vol 46, pp. 316-329 (1998).
43. Barnhart, C., Krishnan, N., Kim, D., and Ware, k., “Network design for express shipment delivery,” Computational Optimization and Applications, Vol. 21, No. 3, pp. 239-262 (2002).
44. Benders, J. F., “Partitioning procedures for solving mixed-variables programming problems,” Numerische Mathematik, Vol. 4, pp. 238-252 (1962).
45. Bent, R. W. and Hentenryck P. V., “Scenario-based planning for partially dynamic vehicle routing with stochastic customers,” Operations Research, Vol.52, pp.977-987 (2003).
46. Borndörfer, R., Klostermeier, F., Grötschel, M., and Küttner, C., “Telebus berlin: vehicle scheduling in a dial-a-ride system,” Technical report SC 97-23, Konrad-Zuse-Zentrum für Informationstechnik, Berlin (1997).
47. Camerini, P.K., Fratta, L. and Maffioli, F., “On improving relaxation methods by modified gradient techniques,” Mathematical Programming Study, Vol. 3, pp. 6-25 (1975).
48. Chen, C. Y. and Kornhauser, A. L., “Decomposition of convex mulitcommodity network flow problem,” Report SOR-90-19, Dept. of Civil Engineering and Operations Research, Princeton University, Princeton, NJ (1990).
49. Chestler, L., “Overnight airexpress: spatial pattern, competition and the future in small package delivery service,” Transportation Quarterly, Vol. 39, pp.59-71, (1985).
50. Chih, K. C. K., “A real time dynamic optimal freight car management simulation model of multiple railroad, mulitcommodity temporal spatial flow problem,” Ph.D. Dissertation, Princeton University, Princeton, NJ (1986).
51. Clarke, L. W., Hane, C. A., Johnson, E. L. and Nemhauser, G. L., “Maintenance and crew considerations in fleet assignment, ” Transportation Science, Vol. 30, pp. 249-260 (1996).
52. Desaulniers, G., Desrosiers, J., Dumas, Y., Solomon, M. M. and Soumis, F., “Daily aircraft routing and scheduling,” Management Science, Vol. 43, pp. 841-855 (1997).
53. Diana, M. and Dessouky, M.M., “A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows,” Transportation Research Part B, Vol. 38, pp.539–557 (2004).
54. Diana, M., Dessouky, M.M., and Xia, N., “A model for the fleet sizing of demand responsive transportation services with time windows,” Transportation Research Part B, Vol. 40, Issue 8, pp.651-666 (2006).
55. Fisher, M. L., “The Lagrangian relaxation method for solving integer programming problem,” Management Science, Vol. 27, pp. 1-18 (1981).
56. Garey, M. R. and Johnson, D.S., “Computers and intractability: a guide to the theory of NP-completeness,” San Francisco, CA: Freeman (1979).
57. Hall, R. W., “Configuration of an overnight package air network,” Transportation Research.-A, Vol. 23, No. 2, pp. 139-149, 1989.
58. Hane, C. A., Barnhart, C., Johnson, E. L., Marsten, R., Nemhauser, G. L., and Sigismondi, G., “The fleet assignment problem: solving a large-scale integer program,” Mathematical Programming Study, Vol. 70, pp. 211-232 (1995).
59. Horn, M. E. T., “Fleet scheduling and dispatching for demand-responsive passenger services,” Transportation Research Part C, Vol. 10, pp. 35-63 (2002).
60. Horn, M.E.T., “Fleet scheduling and dispatching for demand-responsive passenger services,” Transportation Research Part C, Vol. 10, pp. 35-63(2002).
61. Ibaraki, T., Kubo, M., Masuda, T., Uno, T., and Yagiura, M., “Effective local search algorithms for the vehicle routing problem with general time windows,” working paper, Department of Applied Mathematics and Physics, Kyoto University, Japan. (2001).
62. Kennington, J. L. and Shalby, M., “An effective subgradient procedure for minimum cost multicommodity flow problem,” Management Science, Vol. 23, pp.994-1004 (1977).
63. Kenyon, A. S. and Morton, D. P., “Stochastic vehicle routing with random travel times,” Transportation Science, Vol. 37, No. 1, pp. 69-82 (2003).
64. Lai, M. F. and Lo, H. K., “Ferry service network design: Optimal fleet size, routing, and scheduling,” Transportation Research Part A, Vol. 38, pp. 305-328 (2004).
65. Lamatsch, A., “An approach to vehicle scheduling with depot capacity constraints,” in Desrochers, M. and Rousseau, J. M.（eds.）, Computer Aided Transit Scheduling, Lecture Notes in Economics and Mathematical System 386, Springer Verlag, Berlin, Heidelberg, pp. 181-195 (1992).
66. Lee, B. C., “Routing problem with service choices, flight transportation laboratory,” Report R86-4, Massachusetts Institute of Technology, MA (1986).
67. Leung, J. M., Magnanti, T. L., and Singhal, V., “Routing in point-to-point delivery system: formulations and solution heuristic,” Transportation Science, Vol. 24, No. 4, pp. 245-260 (1990).
68. Levin, A., “Scheduling and fleet routing models for transportation systems,” Transportation Science, Vol. 5, pp. 232-255 (1971).
69. Levin, A., “Some fleet routing and scheduling problems for air transportation systems,” Flight Transportation Laboratory Report R68-5, Massachusetts Institute of Technology, MA (1969).
70. Lin, C. C., “The Feeder fleet planning problem of the same-day ground express service in Taiwan,” Asia-Pacific Journal of Operational Research, Vol. 18, No. 2, pp. 165-191 (2001).
71. List, G. F., Wood, B., Nozick, L. K., Turnquist, M. A., Jones, D. A., Kjeldgaard, E. A., and Lawton, C. R., “Robust optimization for fleet planning under uncertainty,” Transportation Research Part E, Vol. 39, pp. 209-227 (2003).
72. Mesquita, M. and Paixao, J., “Multiple depot vehicle scheduling problem: a new heuristic based on quasi-assignment algorithm,” in Desrochers, M. and Rousseau, J. M.(eds.), Computer Aided Transit Scheduling, Lecture Notes in Economics and Mathematical System 386, Springer Verlag, Berlin, Heidelberg, pp. 181-195 (1992).
73. Mulvery, J.M. and Ruszczynski, A. “A new scenario decomposition method for large-scale stochastic optimization,” Operations Research, Vol. 43, No. 3, pp.477–490（1995）.
74. Mulvery, J.M., Vanderbei, R.J., and Zenios, S.A. “Robust optimization of large-scale systems,” Operations Research, Vol. 43, No. 2, pp. 254–281（1995）.
75. Powell, W. B. and Ioannis, A. K., “Shipment routing algorithms with tree constraints,” Transportation Science, Vol. 26, pp. 230-245 (1992).
76. Shan, Y.S., “A dynamic mulitcommodity network flow model for real time optimal real freight car management,” Ph.D. Dissertation, Princeton University, Princeton, NJ (1985).
77. Simpson, R.W., “A review of scheduling and routing model for airline scheduling,” IX AGIFORS Symposium, Broadway, England (1969).
78. Stancu Minasian, I. M., Stochastic Programming with Multiple Objective Functions, Editura Academiei, Bucharest (1984).
79. Subramanian, R., Scheff, R. P., Quillinan, J. D., Wiper, D. S. and Marsten, R. E., “Coldstart: fleet assignment at delta air lines,” Interface, Vol. 24, pp. 104-120 (1994).
80. Teodorovic, D. and Guberinic, S., “Optimal dispatching strategy on an airline network after a schedule perturbation,” European Journal of Operational Research, Vol. 15, pp. 178-182 (1984).
81. Teodorovic, D., Airline Operations Research, Gordon and Breach Science Publishers, New York (1988).
82. Thengvall, B. G., Bard, J. F., and Yu, G., “Balancing user preferences for aircraft schedule recovery during airline irregular operations,” IIE Transactions on Operations Engineering, Vol. 32, pp.181-193 (2000).
83. Thengvall, B. G., Yu, G., and Bard, J. F., “Multiple fleet aircraft schedule recovery following hub closure,” Transportation Research Part A, Vol. 35, pp. 289-308 (2001).
84. Wang, D. Z. W. and Lo, H. K., “Multi-fleet ferry service network design with passenger preferences for differential services,” Transportation Research Part B, Vol. 42, pp. 798-822 (2008).
85. Yan, S. and Chen, C. H., “Coordinated flight scheduling models for allied airlines,” Transportation Research Part C, Vol. 15, pp. 246-264 (2007).
86. Yan, S. and Chen, H. L., “A scheduling model and a solution algorithm for inter-city bus carriers,” Transportation Research Part A, Vol. 36, pp. 805-825 (2002).
87. Yan, S. and Lai, W. S., “An optimal scheduling model for ready mixed concrete supply with overtime considerations,” Automation in Construction, Vol. 16, No. 6, pp. 734-744 (2007).
88. Yan, S. and Lin, C., “Airline scheduling for the temporary closure of airports,” Transportation Science, Vol. 31, pp. 72-82 (1997).
89. Yan, S. and Shih, Y.L., “A time-space network model for work team scheduling after a major disaster”, Journal of the Chinese Institute of Engineers, Vol. 30, No. 1, pp. 63-75 (2007).
90. Yan, S. and Tang, C.H., “A heuristic approach for airport gate assignments for stochastic flight delays,” European Journal of Operational Research, Vol. 180, No. 2, pp. 547-567 (2007).
91. Yan, S. and Tseng, C.H., “A passenger demand based model for airline flight scheduling and fleet routing,” Computers and Operations Research, Vol. 29, pp. 1559-1581 (2002).
92. Yan, S. and Tu, Y., “Multi-fleet routing and multi-stop flight scheduling for schedule perturbation,” European Journal of Operational Research, Vol. 103, pp. 155-169 (1997).
93. Yan, S. and Yang, D. H., “A decision support framework for handling schedule perturbation”, Transportation Research Part B, Vol. 30, pp. 405-419 (1996).
94. Yan, S. and Young, H.F., “A decision support framework for multi-fleet routing and multi-stop flight scheduling,” Transportation Research Part A, Vol. 30, pp. 379-398 (1996).
95. Yan, S., Chen, C. H., and Chen, C. K., “Long-term manpower supply planning for air cargo terminals,” Journal of Transport Management, Vol. 12, Issue 4, pp. 175-181 (2006c).
96. Yan, S., Chen, S. C., and Chen, C. H., “Air cargo fleet routing and timetable setting with multiple on-time demands,” Transportation Research Part E, Vol. 42, Issue 5, pp. 409-430 (2006a).
97. Yan, S., Chi, C. J., and Tang, C. H., “Inter-city bus routing and timetable setting under stochastic demands,” Transportation Research Part A, Vol. 40, pp. 572-586 (2006b).
98. Yan, S., Lai, W., and Chen, M., “Production scheduling and truck dispatching of ready mixed concrete,” Transportation Research, Part E, Vol. 44, Issue 1, pp. 164-179 (2008b).
99. Yan, S., Shieh, C. W., and Chen, M., "A simulation framework for evaluating airport gate assignments," Transportation Research Part A, Vol. 36, No. 10, pp. 885-898 (2002).
100. Yan, S., Tang, C.H., and Fu, T.C., “An airline scheduling model and solution algorithms under stochastic demands,” European Journal of Operational Research, Vol. 190, pp. 22-39 (2008a).
101. Yan, S., Tang, C.H., and Shieh, C.N., “A simulation framework for evaluating airline temporary schedule adjustments following incidents,” Transportation Planning and Technology, Vol. 28, No. 3, pp. 189-211 (2005).

指導教授

顏上堯(Shang-Yao Yan)

審核日期

2009-7-23

推文