隨機旅行時間下跨校選授課專車排程規劃之研究

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：35

、訪客IP：3.145.93.210

姓名

陳怡君(Yi-chun Chen) 查詢紙本館藏

畢業系所

土木工程學系

論文名稱

隨機旅行時間下跨校選授課專車排程規劃之研究
(A scheduling and planning of choosing and teaching inter-school bus under stochastic travel time)

相關論文

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

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

[檢視]

[下載]

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

摘要(中)

近年來台灣地區大專院校林立，為加強學校之競爭力，各校間教學合作日益頻繁，校際間之選授課行為及跨校選授課專車亦因應而生。以台灣聯合大學系統為例，現行之跨校選授課專車，目的在於服務台灣聯合大學系統四校之教職員與學生，但跨校選授課專車之班表為人工經驗排班，且未考量實際旅行時間的隨機性，費時且缺乏系統性分析，故無法完善地服務搭乘需求。緣此，本研究針對跨校選授課專車之特性，考量學校立場，構建一隨機性跨校選授課專車排程模式，以期能提供學校方面作為有效規劃之輔助工具，並協助決策者有效地進行規劃。
本研究利用時空網路流動技巧與數學規劃方法，建立一多對多起迄需求之跨校選授課專車排程隨機模式，以最小總加權營運時間為目標，並於網路設計上加上時窗限制以滿足實務之營運條件。本研究並進一步修改隨機模式之履行時間為平均旅行時間，建立一確定性模式。此模式可定式為含額外限制之整數網路流動問題，屬NP-hard問題。為考量實務之大型問題，本研究亦配合CPLEX數學規劃套裝軟體，發展一啟發式演算法，以有效求解問題。最後評估本研究模式與啟發式解法之實用績效，以台灣聯合大學系統為範例進行測試，並針對不同參數進行敏感度分析與方案分析，結果顯示本模式與演算法在實務上可有效的運用，最後提出結論與建議。

摘要(英)

With the increasing of universities in Taiwan in recent years, but few of these universities can claim to be a comprehensive research university due to limitation in size and lack of full coverage in disciplines. With this situation, the behavior of having inter-school classes appears. The University System of Taiwan is the best example. Nowadays, the inter-school bus is set up to service the teachers and students of The University System of Taiwan, but the schedule is manually performed by planning personnel with experience in current practice, without a systematic analysis. Such a manual approach is considered to be inefficient and ineffective. In other words, stochastic disturbances arising from variations in car travel times in actual operations are neglected. Therefore, consider the properties of the inter-school bus problem and based on the perspective of school planner, we develop a system-optimized model in this research. The model is expected to be an effective tool for the schools and helps planners to solve problems.
In this research, we employed network flow techniques and mathematical programming method, and build a stochastic inter-school bus scheduling model with many-to-many OD demand. The minimum total weighted operating time is our target. In the network design, adds time window limit to meet the practical operating. Model is formulated as an integer multiple commodity network flow problem, which is characterized as NP-hard. Since the problem sizes are expected to be huge in real practice, the models are difficult to be solved in a reasonable time. In addition, to evaluate the performance of stochastic inter-school bus model and solution algorithm practice, we take the University System of Taiwan as an example. Performing sensitive and scenario analysis for different parameters, and the test results show the model to be good and that the solution method could be useful in practice. At last, conclusions and suggestions are given.

關鍵字(中)

★ 跨校選授課專車
★ 啟發解法
★ 時空網路
★ 隨機性旅行時間
★ 含額外限制網路流動問題

關鍵字(英)

★ Heuristic
★ Time-space network
★ Stochastic travel times
★ Inter-school bus
★ Multiple commodity network flow problem

論文目次

摘要 I
ABSTRACT II
致謝 III
目錄 IV
表目錄 VII
圖目錄 VIII
第一章緒論 1
1.1研究背景與動機 1
1.2研究目的與範圍 3
1.3研究方法與程式架構 4
第二章文獻回顧 6
2.1校車排程與路線設計相關文獻 6
2.1.1國外校車規劃與排程 6
2.1.2國內校車規劃與排班 8
2.1.3國內外校車規劃小結 9
2.2交通車、傳統校車與跨校選授課專車之比較 9
2.3時窗限制之車輛派遣與排程問題 10
2.4撥召共乘相關文獻 12
2.5時空網路設計相關文獻 14
2.6隨機擾動之相關理論與文獻 15
2.6.1隨機性問題相關理論 15
2.6.2隨機擾動相關文獻 18
2.7大型含額外限制之整數網路流動問題啟發式演算法 22
2.8文獻評析 25
第三章模式構建 26
3.1跨校選授課專車排程模式 26
3.1.1基本假設與已知資訊 26
3.1.2隨機性模式之時空網路設計 28
3.1.3符號說明 38
3.1.4數學定式 39
3.2確定性跨校選授課專車排程模式 41
3.2.1確定性模式之時空網路 41
3.2.2確定性模式之數學定式 43
3.3模擬評估方法 44
3.4模式應用 45
3.5小結 45
第四章求解演算法設計 46
4.1啟發式解法 46
4.2目標值下限解 50
4.3人車配對 50
4.4小結 51
第五章範例測試 52
5.1資料分析 52
5.1.1跨校選授課專車排程規劃所需之相關參數資料 52
5.1.2搭乘需求之資料 53
5.1.3跨校選授課專車排程規劃之成本資料 55
5.2模式發展 56
5.2.1問題規模 56
5.2.2模式輸入資料 57
5.3電腦演算環境及設定 58
5.3.1電腦演算環境 58
5.3.2相關參數設定 58
5.3.3模式輸出資料 59
5.4測試結果與分析 60
5.4.1隨機性跨校選授課專車排程測試結果 60
5.4.2不同模式間之分析比較 62
5.5敏感度分析 63
5.5.1懲罰成本之敏感度分析 64
5.6情境分析 69
5.6.3現行班表之方案分析 69
5.7小結 71
第六章結論與建議 72
6.1結論 72
6.2建議 73
6.3貢獻 73
參考文獻 75
附錄 85
附錄一 CPLEX CALLABLE LIBRARY CODE 85
附錄二 ODT種類輸入資料 86

參考文獻

1. 申生元(2002)，「多趟次車輛途程與排程問題」，行政院國家科學委員會，NSC90-2218-E155-010。
2. 向美田(1997)，「公車動態資訊與撥召系統之研究與建立-以金門縣為例」，碩士論文，國立交通大學交通運輸研究所。
3. 何依栖(1989)，「都會區計程車共乘制度實施及管理之探討」，運輸計畫季刊，第十八卷，第四期，507-518頁。
4. 余秀梅(1994)，「多元商品模式應用在動態貨櫃調度問題之研究」，碩士論文，國立成功大學交通管理科學研究所。
5. 吳志仁(2003)，「一般化卡車拖車路線問題」，碩士論文，國立交通大學運輸科技與管理學系。
6. 呂英志(2002)，「即時資訊下車輛路線問題之研究」，碩士論文，逢甲大學交通工程與管理研究所。
7. 林士鈞(2004)，「定期貨櫃運輸船舶排程暨船期表建立之研究」，碩士論文，國立中央大學土木工程學系。
8. 林益生(1998)，「隨機環境下多商品、多車種派車問題之研究」，碩士論文，中原大學工業工程研究所。
9. 周義華、林祥生(1985)，「都市公車路網設計方法之研究」，運輸計劃季刊，第十四卷，第四期，495-529頁。
10. 邱明琦、陳春益、林佐鼎(2002)，「海運貨櫃排程模式之研究」，運輸計劃季刊，第三十一卷，第三期，第495-522頁。
11. 卓裕仁(2001)，「以巨集啟發式解法求解多車種與週期性車輛路線問題之研究」，博士論文，國立交通大學運輸工程與管理學系。
12. 侯育周(2007)，「隨機性班機到離延誤下動態機門指派之研究」，碩士論文，國立中央大學土木工程學系。
13. 苑鳳萍(2001)，「客運車輛擾動下調度系統之研究」，碩士論文，國立交通大學運輸工程與管理研究所。
14. 唐存寬(1999)，「在顧客需求為隨機之假設下多種貨品儲運分配系統設計」，碩士論文，國防管理學院資源管理研究所。
15. 夏文慶(1998)，「公車路線設計決策支援系統建立之研究-以新竹客運為例」，碩士論文，國立交通大學運輸科技與管理學系。
16. 曹智翔(2007)，「短期需求擾動下動態醫療物資輸配送之研究」，碩士論文，國立中央大學土木工程學系。
17. 許采蘋(2005)，「計程車共乘與撥召計程車可行條件之研究」，碩士論文，國立交通大學交通運輸研究所。
18. 陳妙珍、顏上堯、張珮璇 (2000)，「航空公司資產與負債管理模式之建立」，第四屆海峽兩岸會計與管理學術研討會論文集，武漢。
19. 陳俊豪(2005)，「因應臨時事件變動租用數機場共用櫃檯即時指派之研究」，碩士論文，國立中央大學土木工程學系。
20. 陳春益、邱明琦(2002)，「貨櫃航線網路設計模式之研究」，運輸計劃季刊，第三十一卷，第二期，第267-298頁。
21. 陳建都(1996)，「校車路線指派問題之研究」，碩士論文，大葉工學院事業經營研究所。
22. 陳建緯(2001)，「大規模旅行推銷員問題之研究：鄰域搜尋法與巨集啟發式解法之應用」，碩士論文，國立交通大學運輸工程與管理學系。
23. 陳文瑞(1989)，「交通車之網路設計」，碩士論文，國立台灣大學土木工程研究所。
24. 游俊雄、丁國樑(1998)，「需求反應旅次運載模擬模式應用於捷運營運班表之評估」，運輸計劃季刊，第二十七卷，第三期，第489-508頁。
25. 張容瑄(2001)，「模擬退火法在校車路線問題上的應用」，碩士論文，國立中正大學數學研究所。
26. 張祐榕(2011)，「動態交通車路線問題之分析與實例研究」，中國工程師學會學生分會100年度全國工程論文競賽。
27. 張靖、卓裕仁、莊子駿、王寶治、許惠淑(2001)，「地理資訊系統在校車路線與班次排程上之應用：以中華大學為例」，中華民國運輸學會第十六屆論文研討會論文集，台北，123-132頁。
28. 黃勵君(2000)，「捷運系統最適營運路線設計之研究」，碩士論文，國立台灣大學土木工程研究所。
29. 楊大輝、李綺容(2007)，「需求變動下之航空貨運網路規劃」，運輸學刊，第十九卷，第二期，第169-189頁。
30. 廖建韋(2007)，「醫療物資訂購及配送排程規劃之研究」，碩士論文，中央大學土木工程學系。
31. 謝潤曉(2010)，「跨校選授課專車排程規劃之研究」，碩士論文，中央大學土木工程學系。
32. 韓復華、朱政威(2010)，「通勤交通車路線問題模式與巨集啟發式解法」，運輸計劃季刊，第三十九卷，第二期，133-164頁。
33. 藍武王、施媺媺(1983)，「公車路線規劃與定線方法之研究」，運輸計劃季刊，第十二卷，第四期，411-432頁。
34. 顏上堯、翁綵穗(2001)，「季節轉換間緩衝期飛航排程之研究」，運輸計劃季刊，第三十卷，第四期，第891- 922頁。
35. 顏上堯、齊志仁、湯慶輝(2005)，「隨機需求下多目標長途客運排程模式之研究」，運輸計畫季刊，第三十四卷，第一期，第93-118頁。
36. 顏上堯、羅智騰(1996)，「因應預期性航具維修之系統性飛航排程」，中國土木水利工程學刊，第八卷，第三期，第447-456頁。
37. 羅敏綺(1998)，「隨機需求下捷運系統營運模擬模式之構建-以台北市木柵線為例」，碩士論文，國立成功大學交通管理科學研究所。
38. Angel, R. D., Caudle, W. L., Noonan, R. and Whinston, A. (1972), “Computer-assisted school bus scheduling,” Management Science, Vol. 18, No. 6, pp. 279-288.
39. Aldaihani, M. and Dessouky, M. M. (2003), “Hybrid scheduling methods for paratransit operations,” Computers & Industrial Engineering, Vol. 45, pp. 75-96.
40. Azia, N., Gendreaua, M. and Potvin, J.Y. (2007), “An exact algorithm for a single-vehicle routing problem with time windows and multiple routes,” European Journal of Operational Research, Vol. 178, pp.755-766.
41. Benders, J. F. (1962), “Partitioning procedures for solving mixed-variables programming problems,” Numerische Mathematik, Vol. 4, pp. 238-252.
42. Bodin, L. D. and Berman, L. (1979), “Routing and scheduling of school buses by computer,” Transportation Science, Vol. 13, No. 2, pp. 113-129.
43. Byren, B. F. and Vuchic, V. R. (1972), “Public transportation line positions and headways for minimum cost,” Traffic Flow and Transportation, pp. 347-360.
44. Byrne, B. F. (1976), “Cost minimizing positions, lengths and headways for parallel public transit lines having different speeds,” Transportation Research, Vol. 10, pp.209-214.
45. Bodin, L., Golden, B. L., Assad, A. and Ball, M. (1983), “Routing and schedule of vehicle and crew: the state of art,” Computers & Operations Research, Vol. 10, pp. 63-211.
46. Bodin, L. D. and Sexton, T. (1986), “The multi-vehicle subscriber dial-a-ride problem,” TIMS Studies in Management Science, Vol. 2, pp. 73-86.
47. Bowerman, R., Hall, B. and Calamai, P. (1995), “A multi-objective optimization approach to urban school bus routing : formulation and solution method,” Transportation Research Part A, Vol. 29, pp. 107-123.
48. Braca, J., Bramel, J., Posner B. and Simchi-Levi, D. (1997), “A computerized approach to the New York city school bus routing problem,” IIE Transactions, Vol. 29, pp.693-702.
49. Bent, R. W. and Hentenryck, P. V. (2003), “Scenario-based planning for partially dynamic vehicle routing with stochastic customers,” Operations Research, pp.52, 977-987.
50. Chakroborty, and P. and Dwivedi, T. (2002), “Optimal route network design for transit system using genetic algorithms,” Engineering Optimization, Vol. 34, pp.83-100.
51. Christofides, N. and Eilon, S. (1969), “An algorithm for vehicle dispatching problem,” Operational Research Quarterly, Vol. 20, pp. 309-318.
52. Chua, T. A., and Silcodk, D. T. (1982), “The practice of British bus operations in planning urban bus service,” Traffic Engineering and Control, Vol. 23, pp. 66-70.
53. Chua, T. A. (1984), “The planning of urban bus routes and frequencies: a survey,” Transportation, Vol. 12, pp. 147-172.
54. Chen, C. Y. and Kornhauser, A. L. (1990), “Decomposition of convex multicommodity network flow problem,” Report SOR-90-19, Dept. of Civil Engineering and Operations Research, Princeton University, Princeton, NJ.
55. Corberan, A., Fernandez, E., Laguna, M. and Marti, R. (2002), “Heuristic solutions to the problem of routing school buses with multiple objectives,” Journal of the Operational Research Society, Vol. 53, pp. 427-435.
56. Cordeau, J. F. and Laporte, G. (2003), “A tabu search heuristic for the static multi-vehicle dial-a-ride problem,” Transportation Research Part B, Vol. 37, pp. 579-594.
57. Desrosiers, J., Dumas, Y., and Soumis, F. (1986), “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.
58. Diana, M. and Dessouky, M.M. (2004), “A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows,” Transportation Research Part B, 38, pp.539–557.
59. Equi, L., Gallo, G., Marziale, S. and Weintraub, A. (1997), “A combined transportation and scheduling problem,” European Journal of Operational Research, Vol. 97, pp.94-104.
60. Fiedrich, F., Gehbauer, F. and Rickers, U. (2000), “Optimized resource allocation for emergency response after earthquake disasters,” Safety Science, Vol. 35, pp. 41-57.
61. Glover, F. and Laguna, M. (1997), Tabu search, Kluwer Academic Publishers, Norwell, MA.
62. Hane, C. A., Barnhart, C., Johnson, E. L., Marsten, R., Nemhauser, G. L. and Sigismondi, G. (1995), “The Fleet Assignment Problem: Solving a Large-Scale Integer Program,” Mathematical Programming Study, Vol. 70, pp. 211-232.
63. Hart, S.M. (1996), “The modeling and solution of a class of dial-a-ride problems using simulated annealing,” Control and Cybernetics, Vol. 25, pp. 1-27.
64. Hsu, C.I., Hung, S.F. and Li, H.C. (2007), “Vehicle routing problem with time-windows for perishable food delivery,” Journal of Food Engineering 80, pp.465–475.
65. Ibaraki, T., Kubo, M., Masuda, T., Uno, T. and Yagiura, M. (2005), “Effective local search algorithms for the vehicle routing problem with general time windows constraint,” Transportation Science, Vol. 39, pp.106-232.
66. Jaw, J. J., Odoni, A. R., Psaraftis, H. N., and Wilson, N. H. M. (1986), “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.
67. Jorgensen, R. M., Larsen, J., and Bergvinsdottir, K. B. (2007), “Solving the dial-a-ride problem using genetic algorithms,” Journal of the Operational Research Society, Vol.58, pp.1321-1331.
68. Kenyon, A. S. and Morton, D. P. (2003). “Stochastic vehicle routing with random travel times,” Transportation Science, Vol. 37, pp. 69-82.
69. Kennington, J. L. and Shalby, M. (1977), “An effective subgradient procedure for minimum cost multicommodity flow problem,” Management Science, Vol. 23, pp.994-1004.
70. Levin, A. (1969), “Some fleet routing and scheduling problems for air transportation systems,” Flight Transportation Laboratory Report R68-5, Massachusetts Institute of Technology, MA.
71. Levin, A. (1971), “Scheduling and fleet routing models for transportation systems,” Transportation Science, Vol. 5, pp. 232-255.
72. Lee, B. C. (1986), “Routing problem with service choices,’ Flight transportation laboratory Report R86-4, Massachusetts Institute of Technology, MA.
73. Lamatsch, A. (1992), “An approach to vehicle scheduling with depot capacity constraints,” in Desrochers, M. and Rousseau, J. M.(eds.), Lecture Notes in Economics and Mathematical System, Vol. 386, pp. 181-195.
74. Li, LYO and Z Fu(2002), “The school bus routing problem：a case study,” Journal of the Operational Research Society, Vol. 53, pp. 552-558.
75. Li, X., Tian, P. and Leung, C. H. (2010). “Vehicle routing problems with time windows and stochastic travel and service times: Models and algorithm,” Int. J. Production Economics, Vol. 125, pp. 137-145.
76. List, G. F., Wood, B., Nozick, L. K., Turnquist, M. A., Jones, D. A., Kjeldgaard, E. A., and Lawton, C. R. (2003). “Robust optimization for fleet planning under uncertainty,” Transportation Research Part E, Vol. 39, pp. 209-227.
77. Lai, M. F. and Lo, H. K. (2004), “Ferry service network design: Optimal fleet size, routing, and scheduling,” Transportation Research Part A, Vol. 38, pp. 305-328.
78. Mesquita, M. and Paixao, J. (1992), “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.
79. Melachrinoudis, E., Ilhan, A. B., and Min, H. (2007), “A dial-a-ride problem for client transportation in a healthcare organization,” Computers & Operations Research, Vol. 34, pp. 742-759.
80. Mulvery, J. M. and Ruszczynski, A. (1995). “A new scenario decomposition method for large-scale stochastic optimization,” Operations Research, Vol. 43, pp. 477-490.
81. Mulvery, J. M., Vanderbei, R. J., Zenios, S. A. (1995). “Robust optimization of large-scale systems,” Operations Research, Vol. 43, pp. 254-281.
82. Psaraftis, H. N. (1980), “A dynamic programming approach to the single-vehicle, many-to-many immediate request dial-a-ride problem,” Transportation Science, Vol. 14, pp. 130-154.
83. Psaraftis, H. N. (1983), “An exact algorithm for the single-vehicle many-to-many dial-a-ride problem with time windows,” Transportation Science, Vol. 17, pp. 351-357.
84. Powell, W. B. and Ioannis, A. K. (1992), “Shipment routing algorithms with tree constraints,” Transportation Science, Vol. 26, pp. 230-245.
85. Rego, C. and Roucairol, C. (1995), “Using tabu search for solving a dynamic multi-terminal truck dispatching problem,” European Journal of Operational Research, Vol. 83, pp.411- 429.
86. Rekiek, B., Delchambre, A., and Saleh, H. A. (2006), “Handicapped person transportation: an application of the grouping genetic algorithm,” Engineering Application of Artificial Intelligence, Vol. 19, pp. 511-520.
87. Ropke, S., Cordeau, J. F., and Laporte, G. (2007), “Models and branch-and-cut algorithms for pickup and delivery problems with time windows,” Networks, Vol. 49, pp. 258-272.
88. Sexton, T. (1979), “The single vehicle many-to-many routing and scheduling problem,” Ph.D. dissertation, SUNY at Stony Brook.
89. Solomon, M. M. (1983), “Vehicle routing and scheduling with time windows constraints: models and algorithms,” Ph.D. dissertation, Department of Decision Science, University of Pennsylvania, USA.
90. Sato, T. and Ichii, K. (1996), “Optimization of post-earthquake restoration of lifeline networks using genetic algorithms,” Japan Society of Civil Engineers, No.537/I-35, pp.245-256.
91. Simpson, R.W. (1969), “A Review of Scheduling and Routing Model for Airline Scheduling,” IX AGIFORS Symposium, Broadway, England.
92. Stancu Minasian, I. M. (1984). Stochastic Programming with Multiple Objective Functions, Editura Academiei, Bucharest.
93. Subramanian, R., Scheff, R. P., Quillinan, J. D., Wiper, D. S. and Marsten, R. E. (1994), “Coldstart: Fleet Assignment at Delta Air Lines,” Interface, Vol. 24, pp.104-120.
94. Teodorovic, D. and Guberinic, S. (1984), “Optimal dispatching strategy on an airline network after a schedule perturbation,” European Journal of Operational Research, Vol. 15, pp. 178-182
95. Teodorovic, D. (1988), Airline Operations Research, Gordon and Breach Science Publishers, New York.
96. Tamura, T., Sugimoto, H. and Kamimae, T. (1994), “Application of Genetic Algorithms to Determining Priority of Urban Road Improvement,” Japan Society of Civil Engineers, No.482/IV-22, pp. 37-46 (in Japanese).
97. Thengvall, B. G., Bard, J. F., and Yu, G. (2000). “Balancing user preferences for aircraft schedule recovery during airline irregular operations,” IIE Transactions on Operations Engineering, Vol. 32, pp.181-193.
98. Thengvall, B. G., Yu, G., and Bard, J. F. (2001). “Multiple fleet aircraft schedule recovery following hub closure,” Transportation Research Part A, Vol. 35, pp. 289-308.
99. Toth, P. and Vigo, D. (1996), “Fast local search algorithms for the handicapped persons transportation problem,” In I. H. Osman and J. P. Kelly (Eds.), Meta-heuristics: Theory and Applications, Kluwer Academic Publishers, Boston, pp. 677-690.
100. Toth, P. and Vigo, D. (1997), “Heuristic algorithms for the handicapped persons transportation problem,” Transportation Science, Vol. 31, pp. 60-71.
101. Wong, K. I. and Bell, M. G. H. (2006), “Solution of the dial-a-ride problem with multi-dimensional capacity constraints,” International Transactions in Operational Research, Vol. 13, pp. 195-208.
102. Wang, D. Z. W. and Lo, H. K. (2008), “Multi-fleet ferry service network design with passenger preferences for differential services,” Transportation Research Part B, Vol. 42, pp. 798-822.
103. Xiang, Z., Chu, C., and Chen, H. (2006), “A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints,” European Journal of Operational Research, Vol. 174, pp. 1117-1139.
104. Yan, S. and Lin, C. (1997). “Airline scheduling for the temporary closure of airports,” Transportation Science, Vol.31, pp. 72-82.
105. Yan, S. and Tu, Y. (1997). “Multi-fleet routing and multi-stop flight scheduling for schedule perturbation,” European Journal of Operational Research, Vol. 103, pp. 155-169.
106. Yan, S. and Yang, D. H. (1996). “A decision support framework for handling schedule perturbation”, Transportation Research Part B, Vol. 30, pp. 405-419.
107. Yan, S. and Young, H. F. (1996), “A decision support framework for multi-fleet routing and multi-stop flight scheduling,” Transportation Research Part A, Vol. 30, pp. 379-398.
108. Yan, S., Chen, C. H., and Chen, C. K. (2006). “Long-term manpower supply planning for air cargo terminals,” Journal of Transport Management, Vol. 12, Issue 4, pp. 175-181.
109. Yan, S. and Chen, H. L. (2002), “A scheduling model and a solution algorithm for inter-city bus carriers,” Transportation Research Part A, Vol. 36, pp. 805-825.
110. Yan, S., Chi, C. J. and Tang, C. H. (2006), “Inter-city bus routing and timetable setting under stochastic demands,” Transportation Research Part A, Vol. 40, pp.572-586.
111. Yan, S., Shieh, C. W., and Chen, M. (2002). “A simulation framework for evaluating airport gate assignments,” Transportation Research Part A, Vol. 36, pp. 885-898.
112. Yan, S. and Shih, Y. L. (2006), “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.
113. Yan, S. and Tang, C. H. (2007), “A heuristic approach for Airport Gate Assignments for Stochastic Flight Delays,” European Journal of Operational Research, Vol. 180, Issue 2, pp. 547-567.
114. Yan, S. and Chen, C. H. (2007), “Coordinated flight scheduling models for allied airlines,” Transportation Research Part C, Vol. 15, pp. 246-264.
115. Yan, S., Tang, C. H., and Fu, T.C. (2008), “An airline scheduling model and solution algorithms under stochastic demands,” European Journal of Operational Research, Vol. 190, pp. 22-39.
116. Yan, S., Tang, C. H., and Shieh, C.N. (2005). “A simulation framework for evaluating airline temporary schedule adjustments following incidents,” Transportation Planning and Technology, Vol. 28, pp. 189-211.
117. Yan, S., Tang, C. H., and Fu, T.C. (2008). “An airline scheduling model and solution algorithms under stochastic demands,” European Journal of Operational Research, Vol. 190, pp. 22-39.
118. Yan, S., Lai, W., and Chen, M. (2008), “Production scheduling and truck dispatching of ready mixed concrete,” Transportation Research Part E, Vol. 44, Issue 1, pp. 164-179.
119. Zhu, K., Tan, K.C. and Lee, L.H. (2000), “Heuristic methods for vehicle routing problem with time windows,” Artificial Intelligence in Engineering, Vol. 15, pp. 281-295.

指導教授

顏上堯(Shang-yao Yan)

審核日期

2011-8-4

推文