貨櫃運輸系統為現今世界上最重要之貨運系統之一。貨櫃運輸系統係由多數環節所構成，其中最重要之運具為船舶，而最重要之後勤系統則為貨櫃儲存場。兩者營運效率之良窳對整個運輸系統之效率具有決定性之影響。
在貨櫃場的營運中，影響最大之無生產力動作為翻櫃動作，亦即將壓於上方之貨櫃移去，得以自堆疊中取得所欲吊取之目標貨櫃。在出口櫃進行裝船作業時，翻櫃動作會造成裝船作業之遲滯。而在裝船作業展開之前先進行整櫃工作以調整各貨櫃在櫃場中之位置，則可減少裝船時之翻櫃動作。本研究即針對使用門式起重機之貨櫃場，發展一套數學方法以求解優良之整櫃計畫。
本研究所發展之求解方法係以鄰近搜尋法為其基本精神。該方法在求解開始時先產生一起始可行整櫃計畫，之後在每回合之演算中逐步改善之，終而尋得優良之整櫃計畫。演算法之每一外部回合分為兩階段。第一階段利用門檻接受法進行數千內部回合，以解得整櫃後末終狀態優良之整櫃計畫。第二階段使用一個雙元整數規畫模式，以在維持末終狀態不變之條件下縮短第一階段所解得之整櫃計畫。兩個階段交替進行，可快速解得優良之可行整櫃計畫。
論文並設計了不同性質的數個測試例，並探討參數不同對模式之影響。而由這些測試例，可驗證模式之有效性及求解效率。

The container shipping system is one of the most important freight transportation systems in the world. This system is composed of a number of components. Among them the most important carrier is the vessel, and the most important logistic system is the container yard. The efficiency of both largely determines the efficiency of the entire container shipping system.
Regarding the operation of a container yard, the major non-productive operation is container shuffling, which is the operation to remove the containers stacked on top of a target container. Without careful planning, these operations can delay the process to load export containers on to a vessel. One way to avoid contianer shuffling-related delay is to pre-marshall the containers in the yard before vessel loading starts. By doing so the containers can be re-positioned in a more favorable order, thus smoothing the vessel loading work that follows. In this research we develop a mathematical method that solves for a good pre-marshalling plan for the export containers in a yard that uses Gantry Crane as its lifting device.
The method developed in this research follows the basic concept of the neighborhood search approach. Starting from an initial feasible pre-marshalling plan, the method attempts to improve the plan at each iteration. Each outer-layer iteration is composed of two stages. The first stage searches for a pre-marshalling plan that can lead to a good final layout of the yard. This search is done by performing several thousand inner-iterations using the Threshold Accepting heuristic. In the second stage the method generates a binary integer program to shorten the plan developed in the first stage while keeping the final layout unchanged. By performing the two stages alternatively, a good pre-marshalling plan can be determined efficiently.
Several computational examples are also presented and discussed in this thesis.

參考文獻
1.Kap Hwan Kim and Hong Bae Kim, “The optimal determination of the space requirement and the number of transfer cranes for import containers,” Computers and Industrial Engineering, Vol.35, Nos 3-4, pp.427-430, 1998.
2.Ki Young Kim and Kap Hwan Kim, “A routing algorithm for a single straddle carrier to load export containers onto a containership, “ International Journal of Production Economics, Vol.59, pp.425-433, 1999.
3.Kap Hwan Kim and Ki Young Kim, “Routing straddle carriers for the loading operation of containers using a beam search algorithm,” Computers and Industrial Engineering, Vol.36, pp.109-136, 1999.
4.Ki Young Kim and Kap Hwan Kim, “A routing algorithm for a single transfer crane to load export containers onto a containership,” Computers and Industrial Engineering, Vol.33, Nos 3-4, pp.673-676, 1997.
5.Kap Hwan Kim and Ki Young Kim, “An optimal routing algorithm for a transfer crane in port container terminals,” Transportation Science , Vol.33（1）, pp.17-33, 1999.
6.Kap Hwan Kim and Jong Wook Bae, “Re-marshalling export containers in port container terminals,” Computers and Industrial Engineering, Vol.35, Nos 3-4, pp.655-658, 1998.
7.Erhan Kozan and Peter Preston, “Genetic algorithm to schedule container transfers at multimodal terminals,” International Transactions in Operational Research, Vol.6, pp.311-329, 1999.
8.Tao Chen, “Yard operations in the container terminal-a study in the ‘unproductive moves’,” Maritime Policy and Management, Vol.26（1）, pp.27-38, 1999.
9.Won Young Yun and Yong Seok Choi, “A simulation model for container-terminal operation analysis using an object-oriented approach,” International Journal of Production Economics, Vol.59, pp.221-230, 1999.
10.Young-Gyo Chung, Sabah U. Randhawa and Edward D. McDowell, “A simulation analysis for a transtainer-based container handling facility,” Computers and Industrial Engineering, Vol.14, No.2, pp.113-125, 1988.
11.Kap Hwan Kim, “Evaluation of the number of rehandles in container yards, Computers and Industrial Engineering,” Vol.32, No.4, pp.701-711, 1997.
12.Kap Hwan Kim and Hong Bae Kim, “Segregating space allocation models for container inventories in port container terminals,” International Journal of Production Economics, Vol.59, pp.415-423, 1999.
13.Kap Hwan Kim, Young Man Park and Kwang-Ryul Ryu, “Deriving decision rules to locate export containers in container yards,” European Journal of Operaional Research, Vol.124, pp.89-101, 2000.
14.Peter Preston and Erhan Kozan, “An approach to determine storage locations of containers at seaport terminals,” Computers and Operation Research, Vol.28, pp.983-995, 2001.
15.Iris F.A. Vis and René de Koster, “Transshipment of containers at a container terminal：An overview,” European Journal of Operation Research, Vol.147, pp.1-16, 2003.
16.http://www.hit.com.hk，香港國際貨櫃碼頭官方網址。
17.林蓁，高速公路交流道平面線形最佳化模式，國立成功大學土木工程研究所碩士論文，1999年六月
18.林光、張志清，航業經營與管理，航貿文化事業有限公司，2002年9月1日。
19.張中議，高雄港專用貨櫃碼頭裝卸機具作業時間之研究，國立成功大學交通管理科學研究所碩士論文，1999年七月。
20.謝玉霜，限制式規劃應用於港區貨櫃場軌道式門型起重機移動路徑之研究，國立成功大學交通管理科學研究所碩士論文，2001年六月。
21.許乃云，貨櫃儲區整櫃之最佳化網路模式，國立成功大學土木工程學研究所碩士論文，2002年七月。
22.趙時樑，出口儲區門型起重機取櫃問題之研究，國立成功大學交通管理科學研究所博士論文，2003年七月。