參考文獻 |
1. 申生元,「多趟次車輛途程與排程問題」,行政院國家科學委員會,NSC90-2218-E155-010 (2002)。
2. 江朋南,「蟻群系統在零工式排程問題之應用」,碩士論文,台灣科技大學工業管理研究所(2003)。
3. 余秀梅,「多元商品模式應用在動態貨櫃調度問題之研究」,碩士論文,國立成功大學交通管理科學研究所(1994)。
4. 吳宗憲,「結合模擬技術與專家系統應用於公車之排班作業」,碩士論文,國立台灣大學土木工程學系(1994)。
5. 林恩仕,「以派遣中心為基礎之預拌混凝土廠派車模式」,碩士論文,成功大學土木工程研究所(2003)。
6. 侯育周,「隨機性班機到離延誤下動態機門指派之研究」,碩士論文,國立中央大學土木工程學系(2007)。
7. 江孝頤,「隨機旅行時間下混凝土生產作業及拌合車的調派決策之研究」,碩士論文,國立中央大學土木工程學系(2008)。
8. 曹智翔,「短期需求擾動下動態醫療物資輸配送之研究」,碩士論文,國立中央大學土木工程學系(2007)。
9. 陳俊豪,「因應臨時事件變動租用數機場共用櫃檯即時指派之研究」,碩士論文,國立中央大學土木工程學系(2005)。
10. 陳毓卿,「因應臨時事件航機停機修護排程調整最佳化之研究」,碩士論文,國立中央大學土木工程學系(2007)。
11. 游俊雄、丁國樑,「需求反應旅次運載模擬模式應用於捷運營運班表之評估」,運輸計劃季刊,第二十七卷,第三期,頁489-508(1998)。
12. 楊大輝、李綺容,「需求變動下之航空貨運網路規劃」,運輸學刊,第十九卷,第二期,頁169-189 (2007)。
13. 廖建韋,「醫療物資訂購及配送排程規劃之研究」,碩士論文,國立中央大學土木工程學系(2007)。
14. 趙宏逵,「市區預拌混凝土廠商生產排程車輛調派與路線問題之研究」,碩士論文,國立交通大學交通運輸研究所(1986)。
15. 劉方旗,「市區公車排班與即時機動調度之研究--以新竹客運為例」,碩士論文,國立交通大學運輸科技與管理學系(1998)。
16. 顏上堯、何淑萍,「飛航排程暨班次表之建立」,運輸計劃季刊,第二十三卷,第一期,73-90頁(1994)。
17. 顏上堯、杜宇平、陳怡妃,「因應臨時事件機場共用櫃檯即時指派之研究」,運輸計劃季刊,第三十三卷,第一期,頁59- 81(2004)。
18. 顏上堯、齊志仁、湯慶輝,「隨機需求下多目標長途客運排程模式之研究」,運輸計畫季刊,第三十四卷,第一期,頁93-118(2005)。
19. 顏上堯、羅智騰,「因應預期性航具維修之系統性飛航排程」,中國土木水利工程學刊,第八卷,第三期,頁447-456(1996)。
20. 羅敏綺,「隨機需求下捷運系統營運模擬模式之構建-以台北市木柵線為例」,碩士論文,國立成功大學交通管理科學系(1998)。
21. Abara, J., “Applying integer linear programming to the fleet assignment problem,” Interfaces, 19, pp.20-28(1989).
22. Agin, N. and Cullen, D., “An algorithm for transportation routing and vehicle loading,” in Geisler, M. (Ed.), Logistics, pp.1-20, North Holland, Amsterdam (1975).
23. Akkan, C. and Karabat, S., “The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm,” European Journal of Operational Research, 159, pp.420-429(2004).
24. Arroyo, J.E.C. and Armentano, V.A., “Genetic local search for multi-objective flowshop scheduling problems,” European Journal of Operational Research, 167(3), pp.717-738(2005).
25. Azia, N., Gendreaua, M. and Potvin, J.Y., “An exact algorithm for a single-vehicle routing problem with time windows and multiple routes,”European Journal of Operational Research, 178(3), pp.755-766(2007).
26. 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, 46, pp. 316-329(1998).
27. Benders, J.F., “Partitioning procedures for solving mixed-variables programming problems,” Numerische Mathematik, 4, pp. 238-252(1962).
28. Bent, R. W. and Hentenryck, P. V., “Scenario-based planning for partially dynamic vehicle routing with stochastic customers,” Operations Research, pp.52, 977-987(2003).
29. Camerini, P.K., Fratta, L. and Maffioli, F., “On improving relaxation methods by modified gradient techniques,” Mathematical Programming Study, 3, pp. 6-25(1975).
30. Chang, Y.L., “Time window capacity analysis for synchronous production,” Proceedings of the Second International Conference on Automation Technology, 1, Taipei, pp.17-26(1992).
31. 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).
32. Chen, C. H., S. Yan and C. H. Tseng (2009), “Inter-city Bus Scheduling for Allied Carriers,” Transportmetrica. (accepted)
33. Cheng, T.M. and Feng, C.W., “An effective simulation mechanism for construction operations,” Automation in Construction, 12, pp.227-244(2003).
34. Clarke, L. W., Hane, C. A., Johnson, E. L. and Nemhauser, G. L., “Maintenance and crew considerations in fleet assignment,” Transportation Science, 30, pp.249-260(1996).
35. Desaulniers, G., Desrosiers, J., Dumas, Y., Solomon, M.M. and Soumis, F., “Daily aircraft routing and scheduling,” Management Science, 43, pp.841-855(1997).
36. 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, 38, pp.539–557(2004).
37. Equi, L., Gallo, G., Marziale, S. and Weintraub, A., “A combined transportation and scheduling problem,” European Journal of Operational Research, 97(1), pp.94-104(1997).
38. Feng, C.W. and Wu, H.T., “Integrating fmGA and CYCLONE to optimize the schedule of dispatching RMC trucks,” Automation in Construction, 15 (2) pp.186-199(2006).
39. Feng, C.W. and Wu, H.T., “Using genetic algorithms to optimize the dispatching schedule of RMC cars,” Proceedings of the 17th International Symposium on Automation and Robotics in Construction, Taipei, pp.927-932(2000).
40. Feng, C.W., Cheng, T.M. and Wu, H.T., “Optimizing the schedule of dispatching RMC trucks through genetic algorithms,” Automation in Construction, 13, pp.327-340(2004).
41. Fisher, M. L., “The Lagrangian relaxation method for solving integer programming problem,” Management Science, 27, pp. 1-18(1981).
42. Glover, F. and M. Laguna, Tabu search, Kluwer Academic Publishers, Norwell, MA (1997).
43. 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, 70, pp.211-232(1995).
44. Healy, P., “A tool for adjusting the flight schedule during high volume iregular operations,” Proceedings of the AGIFORS 32nd Annul Symposium, pp.53-64(1992).
45. Hsu, C.I., Hung, S.F. and Li, H.C., “Vehicle routing problem with time-windows for perishable food delivery,” Journal of Food Engineering 80, pp.465–475(2007).
46. Hurink, J. and Knust, S., “Flow-shop problems with transportation times and a single robot,” Osnabrucker Schriften zur Mathematik, Reihe P, Nr. 201(1998).
47. Husbands, P., “Genetic algorithms for scheduling,” AISB Quarterly, 89(1994).
48. Ibaraki, T., Kubo, M., Masuda, T., Uno, T. and Yagiura, M., “Effective local search algorithms for the vehicle routing problem with general time windows constraint,” Transportaion Science, 39, pp.106-232(2005).
49. Jarrah, A.I., Yu, G., Krishnamurthy, N. and Rakshit, A.,”A decision support framework for airline flight cancellations and delays,” Transportation Science, 27(3), pp.266-280(1993).
50. Kennington, J. L. and Shalby, M., “An effective subgradient procedure for minimum cost multicommodity flow problem,” Management Science, 23, pp.994-1004(1977).
51. Kenyon, A.S. and Morton, D.P., “Stochastic vehicle routing with random travel times,” Transportation Science, 37 (1), pp.69-82(2003).
52. 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).
53. Lee, B.C., “Routing problem with service choices, flight transportation laboratory,” Report R86-4, Massachusetts Institute of Technology, MA (1986).
54. Lee, C.Y. and Chen, Z.L., “Machine scheduling with transportation considerations,” Working Paper, #98-08, Department of Systems Engineering, University of Pennsylvania (1998).
55. Levin, A., “Scheduling and fleet routing models for transportation systems,” Transportation Science, 5, pp. 232-255(1971).
56. Levin, A., “Some fleet routing and scheduling problems for air transportation systems,” Flight Transportation Laboratory Report R68-5, Massachusetts Institute of Technology, MA (1969).
57. 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, 39, pp.209-227(2003).
58. Lu, M., Anson, M., Tang, S.L. and Ying, Y.C., “HKCONSIM: A practical simulation solution to planning concrete plant operations in Hong Kong,” Journal of Construction Engineering and Management, 129(5), pp.547-554(2003).
59. Luh, P. B., Zhao, X., Wang, Y. and Thakur, L.S., “Lagrangian relaxation neural network for job shop scheduling,” Proc. of International Conference on Robotics and Automation, Leuven, Belgium, pp.1799-1804(1998).
60. Matsatsinis, N.F., “Towards a decision support system for the ready concrete distribution system: A case of a Greek company,” European Journal of Operational Research, 152 (2), pp. 487-499(2004).
61. 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).
62. Mulvery, J.M. and Ruszczynski, A., “A New scenario decomposition method for large-scale stochastic optimization,” Operations Research, 43(3), pp.477-490(1995).
63. Mulvery, J.M., Vanderbei, R.J. and Zenios, S.A., “Robust optimization of large-scale systems,” Operations Research, 43(2), pp.254-281(1995).
64. Naso, D., Surico, M., Turchiano, B. and Kaymak, U., “Genetic algorithms in supply chain scheduling of ready mixed concrete,” ERIM report series research in management, ERS-2004-096-LIS, Erasmus Research Institute of Management (2004).
65. Powell, W.B. and Ioannis, A.K., “Shipment routing algorithms with tree constraints,” Transportation Science, 26, pp. 230-245(1992).
66. Rego, C. and Roucairol, C., “Using tabu search for solving a dynamic multi-terminal truck dispatching problem,”European Journal of Operational Research, 83(2), pp.411- 429(1995).
67. Shmoys, D.B., Stein, C. and Wein, J., “Improved approximation algorithms for shop scheduling problems,” SIAM Journal on Computing, 23(3), pp.617-632(1994).
68. Simpson, R. W., “A review of scheduling and routing model for airline scheduling,” IX AGIFORS Symposium, Broadway, England(1969).
69. Solomon, M. M., Vehicle routing and scheduling with time windows constraints: models and algorithms. Ph.D. dissertation, Department of Decision Science, University of Pennsylvania, USA (1983).
70. Stancu-Minasian, I.M., “Stochastic programming with multiple objective functions,” Editura Academiei, Bucharest(1984).
71. Subramanian, R., Scheff, R. P., Quillinan, J. D., Wiper, D. S. and Marsten, R. E., “Coldstart: fleet assignment at Delta Air Lines,” Interface, 24(1), pp.104-120(1994).
72. Teodorovic, D. and Guberinic, S., “Optimal dispatching strategy on an airline network after a schedule perturbation,” European Journal of Operational Research, 15, pp. 178-182(1984).
73. Teodorovic, D., Airline operations research, Gordon and Breach Science Publishers, New York (1988).
74. 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, 32(3), pp.181-193(2000).
75. Thengvall, B.G., Yu, G. and Bard, J. F., “Multiple fleet aircraft schedule recovery following hub closure,” Transportation Research, Part A, 35(4), pp.289-308(2001).
76. Varadharajan, T. K. and Rajendran, C., “A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs,” European Journal of Operational Research, 167, pp.772-795(2005).
77. Wang, D. Z. W. and Lo, H. K., “Multi-fleet ferry service network design with passenger preferences for differential services,” Transportation Research Part B, 42, pp.798-822(2008).
78. Wang, L. and Zheng, D. Z., “An effective optimization strategy for job shop scheduling problems,” Computers and Operations Research, 28, pp.585-596(2001).
79. Wang, L. and Zheng, D.Z., “A modified genetic algorithm for job shop scheduling,” International Journal of Advanced Manufacturing Technology, 20, pp.72-76(2002).
80. Yamada, T. and Nakano, R., “Job shop scheduling by simulated annealing combined with deterministic local search,” Metaheuristics International Conference, Hilton, Breckenridge, Colorado, USA, pp.344-349(1995).
81. Yan, S. and Chen, C.H., “Coordinated flight scheduling models for allied airlines,” Transportation Research, Part C, 15(4), pp.246-264(2007).
82. Yan, S., Chen, C.H. and Chen, C.K., “Long-term manpower supply planning for air cargo terminals,” Journal of Air Transport Management, 12 (4), pp.175-181(2006a).
83. Yan, S. and Lai, W.S., “An optimal scheduling model for ready mixed concrete supply with overtime considerations,” Automation in Construction, 16, pp.734-744(2007).
84. Yan, S., Lai, W.S. and Chen, M.N., “Production scheduling and truck dispatching of ready mixed concrete,” Transportation Research, Part E, 44, pp.164-179(2008a).
85. Yan, S. and Lin, C.G., “Airline scheduling for the temporary closure of airports,” Transportation Science, 31(1), pp.72-82(1997).
86. Yan, S., Shieh, C. W. and Chen, M., "A simulation framework for evaluating airport gate assignments,” Transportation Research, part A, 36(10), pp.885-898(2002).
87. 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, 30 (1), pp.63-55(2007).
88. Yan, S. and Tang, C.H., “A heuristic approach for airport gate assignments for stochastic flight delays,” European Journal of Operational Research, 180 (2), pp. 547-567(2007).
89. 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(2008b).
90. Yan, S., Tang, C.H. and Shieh, C.N., “A simulation framework for evaluating airline temporary schedule adjustments following incidents,” Transportation Planning and Technology, 28(3), pp.189-211(2005).
91. Yan, S. and Yang, D.H., “A decision support framework for handling schedule perturbation,” Transportation Research, Part B, 30(6), pp.405-419(1996).
92. Yan, S. and Young, H.F., “A decision support framework for multi-fleet routing and multi-stop flight scheduling,” Transportation Research, Part A, 30(5), pp.379-398(1996).
93. Yan, S., Chen C. Y. and Lin S. C., “Ship Scheduling and Container Transshipment Planning for Liners in Short Term Operations,” submitted to Journal of Marine Science and Technology, Springer. (accepted)
94. Zayed, T. M. and Halpin, D.W., “Simulation of concrete batch plant production,” Journal of Construction Engineering and Management, 127(2), pp.132-141(2001).
95. Zayed, T. M. and Minkarah, I., “Resource allocation for concrete batch plant operation: Case study,” Journal of Construction Engineering and Management, 130 (4), pp.560-569(2004).
96. Zhu, K., Tan, K.C. and Lee, L.H., “Heuristic methods for vehicle routing problem with time windows,” Artificial Intelligence in Engineering,15(3), pp. 281-295(2000).
|