臺灣博碩士論文加值系統

海洋運輸在貨運中扮演的角色隨著全球運籌的趨勢更形重要，其中又以貨櫃運輸為海運之主流。在貨櫃碼頭的堆積場中，為了加快船隻裝卸貨櫃的作業速度，降低船舶停靠時間，貨櫃通常會先儲存於堆積場中。堆積場中提取貨櫃的（堆場）起重機相當昂貴，因此，提高起重機使用率是重要的議題。至目前為止，尚未有研究提出，當貨櫃提離堆場的次序以群組形式出現時——同組貨櫃提離堆場的次序先後不拘，而不同組別的貨櫃則次序分明——如何建構多部起重機排程規劃之模型及求取其最佳解。
本研究正是探討上述問題：在堆積場一堆塊同時使用兩部起重機，目標以最短時間提取堆塊中所有的出口貨櫃。多部起重機同時操作，必須隨時保持安全距離，更加不可交錯而過，而貨櫃的提取次序則是群組式的。
本研究從簡至繁雜，將起重機的排程規劃分為四個程序，每一程序都建構整數規劃模型，並且利用軟體CPLEX 10.0求解。當處理貨櫃數量龐大時，求解時間冗長，因此，本研究提出一階段式演算法。演算法分為兩部份，首先，決定貨櫃之起重機指派，然後決定起重機之工作時程。演算法與最佳解相比，在大部分的模擬方案中，演算法求解時間明顯較短而目標值在合理範圍內。

The trend of global logistics makes sea freight play an ever more important role in freight transportation, amongst which container transport being the core. In a container terminal, to speed up the loading process and to reduce the berthing time of vessels, export containers are temporarily stored in the storage yard before loading on a container vessel. As yard cranes are very expensive, their high utilization is crucial. Up till now, there is no study such that the retrieval order of containers is in group, i.e., containers in the same group can be retrieved in any order, and containers in different groups must be retrieved according to the order as specified for the groups. It is not clear how to construct the model and subsequently find the optimal schedule for a block with multiple yard cranes under such situation.
This study is precisely for the above problem: For a block such that the export containers are retrieved in group, to find the optimal schedule of two yard cranes to minimize the time to retrieve all export containers. Naturally, at any time the two yard cranes must keep a safety distance and cannot cross each other.
This study tackles the scheduling problem of yard cranes in fours steps with increasing complexity. The mixed integer program constructed in each step is solved with CPLEX 10.0. As it takes long computational time to solve a problem with large number of containers, a heuristic is developed for the problem. The heuristic consists of two parts. One is to assign containers to yard cranes and the other is to determine the schedule of the yard cranes under the given assignment. When compared to the optimal solution, in most of the numerical runs, the heuristic takes much less computation time to get results reasonably close to the optimum.

圖目錄 VII
表目錄 VIII
第一章、緒論 1
1.1海運的簡介 1
1.2貨櫃分類與特性 1
1.3 貨櫃場作業情況 2
1.4 研究目標 5
第二章、文獻探討 9
2.1貨櫃場相關議題 9
2.1.1介紹貨櫃場與貨櫃場目前討論議題 9
2.1.2儲位指派與翻櫃問題 10
2.1.3起重機部署問題 11
2.2 起重機相關議題 12
2.2.1貨櫃場中單部起重機的操作情況 12
2.2.2貨櫃場中多部起重機的操作情況 12
2.2.3電路版製程中起重機的操作情況 14
2.3結論 15
第三章、問題描述與數學模型建構 17
3.1問題描述 17
3.2問題假設與限制 20
3.3數學模型 21
3.4模型說明解釋 26
3.5總結 33
第四章、演算法 35
4.1階段式演算法之研究流程與限制 35
4.2第一階段（貨櫃之起重機指派）之概念假設與流程說明 36
4.3第二階段（起重機之工作時程安排） 49
第五章、模擬數據與模式求解 51
5.1模擬數據 51
5.2結果比較 53
第六章、結論與建議 57
參考文獻 59
附錄A 63
附錄B 69
B.1程序一：使用單部起重機，依嚴格順序將所有貨櫃取出。 69
B.1.1問題描述 69
B.1.2問題假設 69
B.1.3程序一之數學模型 69
B.1.4程序一之模型解釋說明 70
B.2程序二：使用兩部起重機，依嚴格順序將所有貨櫃取出。 71
B.2.1問題描述 71
B.2.2問題假設 71
B.2.3程序二之線性模型 71
B.2.4程序二之模型解釋說明 74
B.3程序三：使用兩部起重機，依寬鬆順序將所有貨櫃取出。 77
B.3.1問題描述 77
B.3.2問題假設 77
B.3.3程序三之數學模型 77
B.3.4程序三之模型解釋說明 81
B.4 模型二與三之模擬數據與模式求解 83
B.4.1 模型二與三之模擬數據 83
B.4.2 模型二與三之結果比較 83

1.Bish, E. K. (2003). A multiple-crane-constrained scheduling problem in a container terminal. European Journal of Operational Research, 144(1), 83-107.
2.Bish, E. K., Leong, T.-Y., Li, C.-L., Hg, J. W. C., & Simchi-Levi, D. (2001). Analysis of a New Vehicle Scheduling and Location Problem. Naval Research Logistics, 48(5), 363-385.
3.Che, A., & Chu, C. (2004). Single-track multi-hoist scheduling problem: a collision-free resolution based on a branch-and-bound approach. International Journal of Production Research, 42(12), 2435-2456.
4.Henesey, L. E. (2004). Enhancing Container Terminal Performance: A Multi Agent Systems Approach. Ph.D. Thesis (2004) Department of Systems and Software Engineering School of Engineering Blekinge Institute of Technology Karlshamn, Sweden.
5.Jung, S. H., & Kim, K. H. (2006). Load scheduling for multiple quay cranes in port container terminals. Journal of Intelligent Manufacturing, 17(4), 479-492.
6.Kim, K. H. (1997). Evaluation of the number of rehandles in container yards. Computers & Industrial Engineering, 32(4), 701.
7.Kim, K. H., & Bae, J. W. (1998). Re-marshaling export containers in port container terminals. Computers & Industrial Engineering, 35(3/4), 655.
8.Kim, K. H., & Kim, H. B. (1999). Segregating space allocation models for container inventories in port container terminals. International Journal of Production Economics, 59(1-3), 415-423.
9.Kim, K. H., & Park, Y.-M. (2004). A crane scheduling method for port container terminals. European Journal of Operational Research, 156(3), 752.
10.Kim, K. H., Park, Y. M., & Ryu, K.-R. (2000). Deriving decision rules to locate export containers in container yards. European Journal of Operational Research, 124(1), 89-101.
11.Kim, K. Y., & Kim, K. H. (1997). A Routing Algorithm for a Single Transfer Crane to Load Export Containers onto a Containership. Computers & Industrial Engineering, 33(3-4), 673-676.
12.Leung, J. M. Y., & Levner, E. (2006). An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times. Operations Research Letters, 34, 465-472.
13.Leung, J. M. Y., Zhang, G., Yang, X., Mak, R., & Lam, K. (2004). Optimal Cyclic Multi-Hoist Scheduling: A Mixed Integer Programming Approach. Operations Research, 52(6), 965-976.
14.Li, C.-L., & Vairaktarakis, G. L. (2004). Loading and Unloading Operations in Container Terminals. IIE Transactions, 36(4), 287-297.
15.Linn, R., Liu, J.-y., Wan, Y.-w., Zhang, C., & Murty, K. G. (2003). Rubber tired gantry crane deployment for container yard operation. Computers & Industrial Engineering, 45(3), 429.
16.Liu, C.-I., Jula, H., Vukadinovic, K., & Ioannou, P. (2004). Automated guided vehicle system for two container yard layouts. Transportation Research: Part C, 12(5), 349-368.
17.Liu, J., & Jiang, Y. (2005). An Efficient Optimal Solution to the Two-Hoist No-Wait Cyclic Scheduling Problem. Operations Research, 53(2), 313-327.
18.Liu, J., Wan, Y.-w., & Wang, L. (2005). Quay crane scheduling at container terminals – reducing the maximum tardiness of vessel departures. Naval Research Logistics, 53(1), 60-74.
19.Mak, R. W. T., Gupta, S. M., & Lam, K. (2002). Modeling of Material Handling Hoist Operations in a PCB Manufacturing Facility. Journal of Electronics Manufacturing, 11(1), 33.
20.Ng, W. C., & Mak, K. L. (2005). Yard crane scheduling in port container terminals. Applied Mathematical Modelling, 29(3), 263-276.
21.Ng, W. C., & Mak, K. L. (2006). Quay crane scheduling in container terminals. Engineering Optimization, 38(6), 723-737.
22.Phillips, L. W., & Unger, P. S. (1976). Mathematical Programming Solution of a Hoist Scheduling Program. IIE Transactions, 8(2), 219 - 225.
23.Preston, P., & Kozan, E. (2001). An approach to determine storage locations of containers at seaport terminals. Computers & Operations Research, 28(10), 983.
24.Steenken, D., Vo, S., & Stahlbock, R. (2004). Container terminal operation and operations research - a classification and literature review. OR Spectrum, 26(1), 3-49.
25.Vis, I. F. A., & de Koster, R. (2003). Transshipment of containers at a container terminal: An overview. European Journal of Operational Research, 147(1), 1.
26.Wan, Y.-w., Liu, J., & Tsai, P.-c. (2006). The Assignment of storage Location of Containers in a Container Stack. Report for NSC project NSC 94－2416－H－259－012; also working paper submitted for publication.
27.Yun, W. Y., & Choi, Y. S. (1999). A simulation model for container-terminal operation analysis using an object-oriented approach. International Journal of Production Economics, 59(1-3), 221-230.
28.Zhang, C., Wan, Y.-w., Liu, J., & Linn, R. J. (2002). Dynamic crane deployment in container storage yards. Transportation Research: Part B, 36(6), 537..
29.林光, & 張志清. (2006). 海運學 (七版), 航貿文化經銷.
30.陳春益, 呂錦山, 吳偉銘, 于惠蓉, 徐文華, 楊鈺池, et al. (2001). 國際海運貨櫃運輸作業合理化及效率化之研究 (初版), 交通部運輸研究所.
31.蔡培均. (2006). 貨櫃堆疊列中儲位之動態指派. 國立東華大學全球運籌管理研究所碩士論文.
32.盧華安, & 鄭景怡. (2005). 貨櫃碼頭岸肩拖車派遣規劃之研究. 運輸計劃季刊, 第三十四卷(第三期), 頁325 ~ 頁354.