隨機旅行時間下計程車共乘及乘客配對整合模式與求解演算法之研究

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：46

、訪客IP：3.139.83.155

姓名

吳逸祥(Yi-siang Wu) 查詢紙本館藏

畢業系所

土木工程學系

論文名稱

隨機旅行時間下計程車共乘及乘客配對整合模式與求解演算法之研究
(An Integrated Model and Solution Algorithms for Taxipool and Passenger Matching Problems under Stochastic Travel Times)

相關論文

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

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

[檢視]

[下載]

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

摘要(中)

隨著台灣都會區交通量的迅速成長，計程車已成為台灣都會區中一相當普遍之運輸工具，但其乘載率及使用率偏低則成為一極需解決之惱人問題。透過計程車共乘計劃不僅可提高其使用效率，更可改善都市交通擁擠問題。然而，目前實務上計程車的共乘配對，多採用人工經驗的作法，不僅費時且缺乏系統分析，使得共乘的績效降低。過去計程車共乘的研究多以平均旅行時間為依據，進行共乘配對與排程，此作法未考量實際旅行時間的隨機性。在實際營運時若隨機旅行時間造成之擾動過大，將使原規劃的配對與排程結果失去最佳性。因此，本研究針對多起迄對之預約旅次，考量隨機性旅行時間之影響，建構一隨機性計程車共乘配對模式，期能提供一有效的規劃輔助工具，以幫助決策者有效地規劃乘客配對與車輛排程。
本研究利用時空網路流動技巧建立一此隨機模式，模式中包含車流與人流網路，以定式車輛與旅客在時空中的流動與配對。本研究並進一步修改隨機模式之旅行時間為平均旅行時間，建立一確定性模式。此兩模式可定式為特殊之整數多重貨物網路流動問題，屬NP-hard問題。當面臨實務的大型問題時，勢將難以在有限時間內利用數學規劃軟體求得最佳解。緣此，本研究發展一啟發式演算法以有效地求解問題。此外，本研究亦發展一模擬評估方法，以評估兩模式的實際營運績效。最後為評估模式與演算法之實用績效，本研究以實際資料以及合理假設產生測試例，進行範例測試並針對不同參數進行敏感度分析，結果顯示本模式與演算法可在實務上可有效的運用。

摘要(英)

As the Taiwan urban areas’ traffic volume grew significantly, taxi becomes more popular than before in Taiwan. The low loading factor and use rate become an annoying problem, which should be resolved immediately. The taxipool plan can not only improve its operational performance, but can also relieve the traffic congestion problem. However, most taxi carriers currently use a trial-and-error process, in accordance with the projected taxi travel times, for taxipool matching, which is neither effective nor efficient. In other words, stochastic disturbances arising from variations in taxi travel times in actual operations are neglected. In the worst scenario, where taxi travel times fluctuate wildly during operations, the planned schedule could be disturbed enough to lose its optimality. Therefore, focusing on multiple origin-destination (OD) with advanced-order passenger trips, we constructed a stochastic taxipool matching model that considers the influence of stochastic travel times. The matching model is expected to be an effective tool for the planner to solve passenger matching and fleet scheduling.
We employed network flow techniques to construct the stochastic taxipool matching model, including fleet-flow and passenger-flow networks. Then, we modified the stochastic travel times in the stochastic taxipool matching model as an average travel time to develop a deterministic scheduling model. The two models are formulated as special integer multiple commodity network flow problems, which are 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. Therefore, we also developed a heuristic algorithm for efficiently solving passenger matching and fleet scheduling problems. In addition, to evaluate the stochastic and deterministic taxipool matching models, we also developed a simulation-based evaluation method. The performance of the solution method in practice is evaluated by carrying out a case study using real data and suitable assumptions, and then sensitive analysis is performed for different parameters. The test results show the model to be good and that the solution method could be useful in practice.

關鍵字(中)

★ 啟發解法
★ 多重貨物網路流動問題
★ 計程車共乘
★ 隨機性旅行時間
★ 時空網路

關鍵字(英)

★ Taxipool
★ Stochastic travel times
★ Time-space network
★ Multiple commodity network flow problem
★ Heuristic

論文目次

摘要 i
ABSTRACT ii
誌謝 iii
目錄 iv
圖目錄 vi
表目錄 vii
第一章緒論 1
1.1研究背景與動機 1
1.2研究目的與範圍 2
1.3研究方法與流程 2
第二章現況概述與文獻回顧 3
2.1國內外計程車共乘現況 3
2.2撥召與共乘相關文獻 5
2.3時空網路的相關文獻 10
2.4隨機擾動之相關理論與文獻 11
2.4.1 隨機性問題相關理論 11
2.4.2 隨機擾動相關文獻 13
2.5大型含額外限制之整數網路流動問題啟發式演算法 16
2.6文獻評析 19
第三章模式構建 20
3.1隨機性計程車共乘配對模式 20
3.1.1模式基本假設或給定資訊 20
3.1.2隨機性模式之時空網路 22
3.1.2.1 車流時空網路 22
3.1.2.2人流時空網路 25
3.1.2.3非預期懲罰成本說明 27
3.1.3模式符號說明 31
3.1.4數學定式 33
3.2確定性計程車共乘配對模式 34
3.2.1 確定性模式之時空網路 35
3.2.2 確定性模式之數學定式 36
3.3模擬評估方法 36
3.4模式應用 37
3.5小結 38
第四章求解演算法設計 39
4.1演算法初始解 39
4.2演算法改善解 43
4.3目標值下限解 47
4.4 小結 49
第五章範例測試 50
5.1輸入資料 50
5.1.1車隊規劃資料 50
5.1.2乘客旅次資料 52
5.2模式發展 52
5.2.1問題規模 52
5.2.2模式輸入資料 53
5.3電腦演算環境及設定 54
5.3.1電腦演算環境 54
5.3.2相關參數設定 54
5.3.3模式輸出資料 55
5.4測試結果與分析 56
5.4.1 隨機狀況數目 56
5.4.2 隨機性計程車共乘配對測試結果 57
5.4.3 不同模式間之分析比較 59
5.5敏感度分析 60
5.5.1時間價值成本之敏感度分析 61
5.5.2懲罰成本之敏感度分析 64
5.5.2.1 非預期懲罰成本 64
5.5.2.2 乘客超出時窗懲罰成本 68
5.5.2.3 乘客未服務懲罰成本 70
5.6情境分析 72
5.6.1配對規劃目標分析 72
5.6.2系統服務人數及派車數分析 75
5.6.3非預期懲罰成本之折減率情境分析 76
5.7小結 78
第六章結論與建議 79
6.1結論 79
6.2建議 80
6.3貢獻 80
參考文獻 82
附錄 89
附錄一 CPLEX Callable Library Code 89
附錄二隨機狀況模擬數目測試結果 90
附錄三非預期懲罰成本敏感度分析 91

參考文獻

1. 乃啟育 (2006)，「策略聯盟環境下城際客運排程規劃模式之研究」，碩士論文，國立中央大學土木工程學系。
2. 江孝頤 (2008) ，「隨機旅行時間下混凝土生產作業及拌合車調派決策之研究」，碩士論文，國立中央大學土木工程學系。
3. 何依栖 (1989)，「都會區計程車共乘制度實施及管理之探討」，運輸計劃季刊，第十八卷，第四期，第507-518頁。
4. 辛孟鑫 (2005)，「撥召運輸系統路線規劃問題之研究－以台北市復康巴士為例」，碩士論文，國立成功大學交通管理科學研究所。
5. 余秀梅 (1994)，「多元商品模式應用在動態貨櫃調度問題之研究」，碩士論文，國立成功大學交通管理科學研究所。
6. 吳沛儒 (2004)，「任務型共乘接駁計程車之規劃與設計」，碩士論文，私立逢甲大學交通工程與管理學研究所。
7. 吳權哲 (2007)，「都會區計程車共乘配對模式暨求解演算法之研究」，碩士論文，國立中央大學土木工程學系。
8. 呂英志 (2002)，「即時資訊下車輛路線問題之研究」，碩士論文，逢甲大學交通工程與管理研究所。
9. 林士鈞 (2004)，「定期貨櫃運輸船舶排程暨船期表建立之研究」，碩士論文，國立中央大學土木工程學系。
10. 林益生 (1998)，「隨機環境下多商品、多車種派車問題之研究」，碩士論文，中原大學工業工程研究所。
11. 周文生、黃台生、黃慧娟、王裕民、詹彥倫、許采蘋 (2004)，「九十三年度臺北地區計程車營運情形調查」，台北縣與台北市政府交通局委託中華民國運輸學會辦理。
12. 邱明琦、陳春益、林佐鼎 (2002)，「海運貨櫃排程模式之研究」，運輸計劃季刊，第三十一卷，第三期，第495-522頁。
13. 苑鳳萍 (2001)，「客運車輛擾動下調度系統之研究」，碩士論文，國立交通大學運輸工程與管理研究所。
14. 侯育周 (2007)，「隨機性班機到離延誤下動態機門指派之研究」，碩士論文，國立中央大學土木工程學系。
15. 唐存寬 (1999)，「在顧客需求為隨機之假設下多種貨品儲運分配系統設計」，碩士論文，國防管理學院資源管理研究所。
16. 許采蘋 (2005)，「計程車共乘與撥召計程車可行條件之研究」，碩士論文，國立交通大學交通運輸研究所。
17. 曹智翔 (2007)，「短期需求擾動下動態醫療物資輸配送之研究」，碩士論文，國立中央大學土木工程學系。
18. 陳妙珍、顏上堯、張珮璇 (2000)，「航空公司資產與負債管理模式之建立」，第四屆海峽兩岸會計與管理學術研討會論文集，武漢。
19. 陳春益、邱明琦 (2002)，「貨櫃航線網路設計模式之研究」，運輸計劃季刊，第三十一卷，第二期，第267-298頁。
20. 陳俊豪 (2005)，「因應臨時事件變動租用數機場共用櫃檯即時指派之研究」，碩士論文，中央大學土木工程學系。
21. 陳昱彰 (2006)，「區位分析應用於任務型共乘接駁計程車之派遣規劃」，碩士論文，私立逢甲大學交通工程與管理學研究所。
22. 陳信諺 (2008)，「計程車共乘及旅客配對整合模式暨求解演算法之研究」，碩士論文，國立中央大學土木工程學系。
23. 陶治中 (2006)，「智慧型運輸系統應用於高乘載計畫之示範與建置-都會區共乘系統之示範與建置(2/2)」，交通部科技顧問室。
24. 郭瑜堅 (2003)，「都市旅次成本之研究」，碩士論文，國立臺灣大學土木工程學研究所。
25. 游俊雄、丁國樑 (1998)，「需求反應旅次運載模擬模式應用於捷運營運班表之評估」，運輸計劃季刊，第二十七卷，第三期，第489-508頁。
26. 黃漢瑄 (2006)，「撥召服務最佳化指派作業之研究」，碩士論文，私立淡江大學運輸管理學系運輸科學研究所。
27. 楊大輝、李綺容 (2007)，「需求變動下之航空貨運網路規劃」，運輸學刊，第十九卷，第二期，第169-189頁。
28. 楊淑芳 (2006)，「以巨集啟發式演算法求解即時資訊下之中型車共乘問題」，碩士論文，私立淡江大學運輸管理學系運輸科學研究所。
29. 廖建韋 (2007)，「醫療物資訂購及配送排程規劃之研究」，碩士論文，中央大學土木工程學系。
30. 鄭榮和、林松慶、馮瑞裕、林晨宇、楊泰紳、振芫舜 (2008)，「車輛怠速測試計劃結果報告」， FORMOSUN先進動力研究中心，台北。
31. 顏上堯、杜宇平、陳怡妃 (2004)，「因應臨時事件機場共用櫃檯即時指派之研究」，運輸計劃季刊，第三十三卷，第一期，第59- 81頁。
32. 顏上堯、翁綵穗 (2001)，「季節轉換間緩衝期飛航排程之研究」，運輸計劃季刊，第三十卷，第四期，第891- 922頁。
33. 顏上堯、羅智騰 (1996)，「因應預期性航具維修之系統性飛航排程」，中國土木水利工程學刊，第八卷，第三期，第447-456頁。
34. 顏上堯、齊志仁、湯慶輝 (2005)，「隨機需求下多目標長途客運排程模式之研究」，運輸計畫季刊，第 34 卷第 1 期，第93-118頁。
35. 羅敏綺 (1998)，「隨機需求下捷運系統營運模擬模式之構建-以台北市木柵線為例」，碩士論文，國立成功大學交通管理科學研究所。
36. Agin, N. and Cullen, D. (1975). “An algorithm for transportation routing and vehicle loading,” In Geisler, M. (Ed.), Logistics, pp. 1-20, North Holland, Amsterdam.
37. Aldaihani, M. and Dessouky, M. M. (2003). “Hybrid scheduling methods for paratransit operations,” Computers and Industrial Engineering, Vol. 45, pp. 75-96.
38. Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. P. and Vance, P. H. (1998). “Branch-and-price: column generation for solving huge integer programs,” Operations Research, Vol. 46, pp. 316-329.
39. Benders, J. F. (1962). “Partitioning procedures for solving mixed-variables programming problems,” Numerische Mathematik, Vol. 4, pp. 238-252.
40. 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.
41. Borndörfer, R., Klostermeier, F., Grötschel, M., and Küttner, C. (1997). “Telebus Berlin: vehicle scheduling in a dial-a-ride system,” Technical report SC 97-23, Konrad-Zuse-Zentrum für Informationstechnik, Berlin.
42. Camerini, P. K., Fratta, L., and Maffioli, F. (1975). “On improving relaxation methods by modified gradient techniques,” Mathematical Programming Study, Vol. 3, pp. 6-25.
43. Chen, C. Y. and Kornhauser, A. L. (1990). “Decomposition of convex mulitcommodity network flow problem,” Report SOR-90-19, Dept. of Civil Engineering and Operations Research, Princeton University, Princeton, NJ.
44. Chih, K. C. K. (1986). “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.
45. Cordeau, J. F. and Laporte, G. (2007). “The dial-a-ride problem: models and algorithms,” Annals of Operations Research, Vol. 153, pp. 29-46.
46. Cordeau, J. F. (2006). “A Branch-and-cut algorithm for the dial-a-ride problem,” Operations Research, Vol. 54, pp. 573-586.
47. Cordeau, J. F. and Laporte, G. (2003a). “A tabu search heuristic for the static multi-vehicle dial-a-ride problem,” Transportation Research Part B, Vol. 37, pp. 579-594.
48. Cordeau, J. F. and Laporte, G. (2003b). “The dial-a-ride problem (DARP): variants, modeling issues and algorithms,” 4OR: A Quarterly Journal of Operations Research, Vol. 1, pp. 89-101.
49. Coslovich, L., Pesenti, R., and Ukovich, W. (2006). “A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem,” European Journal of Operational Research, Vol. 175, pp. 1605-1615.
50. Desaulniers, G., Desrosiers, J., Dumas, Y., Solomon, M. M. and Soumis, F. (1997). “Daily aircraft routing and scheduling,” Management Science, Vol. 43, pp. 841-855.
51. 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.
52. Dial, R. B. (1995). “Autonomous dial-a-ride transit introductory overview,” Transportation Research Part C, Vol. 3, pp. 261-275.
53. 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, Vol. 38, pp. 539-557.
54. Fisher, M. L. (1981). “The Lagrangian relaxation method for solving integer programming problem,” Management Science, Vol. 27, pp. 1-18.
55. Fu, L. (2002a). “A simulation model for evaluating advanced dial-a-ride paratransit systems,” Transportation Research Part A, Vol. 36, pp. 291-307.
56. Fu, L. (2002b). “Scheduling dial-a-ride paratransit under time-varying, stochastic congestion,” Transportation Research Part B, Vol. 36, pp. 485-506.
57. Garey, M. R. and Johnson, D.S. (1979). “Computers and intractability: a guide to the theory of NP-completeness,” San Francisco, CA: Freeman.
58. Hart, S. M. (1996). “The modeling and solution of a class of dial-a-ride problems using sumulated annealing,” Control and Cybernetics, Vol. 25, pp. 1-27.
59. Horn, M. E. T. (2002). “Fleet scheduling and dispatching for demand-responsive passenger services,” Transportation Research Part C, Vol. 10, pp. 35-63.
60. Hunsaker, B. and Savelsbergh, M. (2002). “Efficient feasibility testing for dial-a-ride problems,” Operations Research Letters, Vol. 30, pp. 169-173.
61. Jaw, 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.
62. Jørgensen, 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.
63. Kennington, J. L. and Shalby, M. (1977). “An effective subgradient procedure for minimum cost multicommodity flow problem,” Management Science, Vol. 23, pp.994-1004.
64. Kenyon, A. S. and Morton, D. P. (2003). “Stochastic vehicle routing with random travel times,” Transportation Science, Vol. 37, pp. 69-82.
65. 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.
66. Lamatsch, A. (1992). “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.
67. Lau, S. W. (1998). “Autonomous dial-a-ride transit benefit-Cost evaluation,” Volpe National Transportation Systems Center.
68. Lee, K. T., Wu, P. J., and Wang, S. H. (2004). “The planning and design of taxipooling on feeder system,” Networking, Sensing and Control, 2004 IEEE International Conference, Taipei, Taiwan.
69. Lee, B. C. (1986). “Routing problem with service choices, flight transportation laboratory,” Report R86-4, Massachusetts Institute of Technology, MA.
70. Levin, A. (1971). “Scheduling and fleet routing models for transportation systems,” Transportation Science, Vol. 5, pp. 232-255.
71. Levin, A. (1969). “Some fleet routing and scheduling problems for air transportation systems,” Flight Transportation Laboratory Report R68-5, Massachusetts Institute of Technology, MA.
72. 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.
73. Madsen, O. B. G., Ravn, H. F., and Rygaard, J. M. (1995). “A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives,” Annals of Operations Research, Vol. 60, pp. 193-208.
74. Melachrinoudis, E., Ilhan, A. B., and Min, H. (2007). “A dial-a-ride problem for client transportation in a healthcare organization,” Computers and Operations Research, Vol. 34, pp. 742-759.
75. 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.
76. Mulvery, J. M. and Ruszczynski, A. (1995). “A new scenario decomposition method for large-scale stochastic optimization,” Operations Research, Vol. 43, pp. 477-490.
77. Mulvery, J. M., Vanderbei, R. J., Zenios, S. A. (1995). “Robust optimization of large-scale systems,” Operations Research, Vol. 43, pp. 254-281.
78. Powell, W. B. and Ioannis, A. K. (1992). “Shipment routing algorithms with tree constraints,” Transportation Science, Vol. 26, pp. 230-245.
79. 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.
80. 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.
81. 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.
82. 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.
83. Sexton, T. (1979), “The single vehicle many-to-many routing and scheduling problem,” Ph.D. dissertation, SUNY at Stony Brook.
84. Sexton, T. and Bodin, L. D. (1985a). “Optimizing single vehicle many-to-many operations with desired delivery times: I. Scheduling,” Transportation Science, Vol. 19, pp. 378-410.
85. Sexton, T. and Bodin, L. D. (1985b). “Optimizing single vehicle many-to-many operations with desired delivery times: II. Routing,” Transportation Science, Vol. 19, pp. 411-435.
86. Shan, Y.S. (1985). “A dynamic mulitcommodity network flow model for real time optimal real freight car management,” Ph.D. Dissertation, Princeton University, Princeton, NJ.
87. Simpson, R.W. (1969). “A review of scheduling and routing model for airline scheduling,” IX AGIFORS Symposium, Broadway, England.
88. Stancu Minasian, I. M. (1984). Stochastic Programming with Multiple Objective Functions, Editura Academiei, Bucharest.
89. Teodorovic, D. (1988). Airline Operations Research, Gordon and Breach Science Publishers, New York.
90. 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.
91. 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.
92. 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.
93. 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, Boston: Kluwer., pp. 677-690.
94. Toth, P. and Vigo, D. (1997). “Heuristic algorithms for the handicapped persons transportation problem,” Transportation Science, Vol. 31, pp. 60-71.
95. 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.
96. 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.
97. 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.
98. 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.
99. Yan, S. and Chen, C. H. (2007). “Coordinated flight scheduling models for allied airlines,” Transportation Research Part C, Vol. 15, pp. 246-264.
100. 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.
101. 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.
102. Yan, S., Lai, W., and Chen, M. (2008b). “Production scheduling and truck dispatching of ready mixed concrete,” Transportation Research, Part E, Vol. 44, Issue 1, pp. 164-179.
103. Yan, S. and Lai, W. S. (2007). “An optimal scheduling model for ready mixed concrete supply with overtime considerations,” Automation in Construction, Vol. 16, pp. 734-744.
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., Shieh, C. W., and Chen, M. (2002). “A simulation framework for evaluating airport gate assignments, ” Transportation Research Part A, Vol. 36, pp. 885-898.
106. Yan, S. and Shih, Y. L. (2007). “A time-space network model for work team scheduling after a major disaster”, Journal of the Chinese Institute of Engineers, Vol. 30, pp. 63-75.
107. 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.
108. 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, pp. 547-567.
109. Yan, S., Tang, C. H., and Fu, T.C. (2008a). “An airline scheduling model and solution algorithms under stochastic demands,” European Journal of Operational Research, Vol. 190, pp. 22-39.
110. Yan, S. and Tseng, C. H. (2002). “A passenger demand based model for airline flight scheduling and fleet routing,” Computers and Operations Research, Vol. 29, pp. 1559-1581.
111. 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.
112. Yan, S. and Yang, D. H. (1996). “A decision support framework for handling schedule perturbation”, Transportation Research Part B, Vol. 30, pp. 405-419.
113. 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.

指導教授

顏上堯(Shang-Yao Yan)

審核日期

2009-7-15

推文