港區貨櫃場多部執道式門型起重機移動路徑之研究

利用軌道式門型起重機(Rail Mounted Gantry Crane, RMGC)搭配高度堆疊貨櫃之儲存方式，已成為港區貨櫃場增加儲存容量之主流。由於RMGC主體龐大，必須藉由鋼輪與鋼軌之支撐，始可變換駐停位置以處理不同的貨櫃吊卸工作，故在實際作業之前，必須針對駐停位置、取櫃數量以及RMGC移動方向等決策因素進行規劃，以減少RMGC之往復移動，提升工作效率。為追求更高的作業績效，在執行出口貨櫃裝船作業時，實務上已出現利用多部RMGC搭配一部船邊橋式起重機之工作方式，此舉雖可提升貨櫃裝船效率，但因需額外決定每個取櫃工作應由何部RMGC執行，以及增加「避免碰撞」、「依序移動」等限制條件，使得其移動路徑規劃問題在模式建立與求解上更形複雜。本研究嘗試構建數學模式，探討以兩部RMGC搭配一部橋式起重機執行出口貨櫃裝船之作業方式，並結合限制式規劃與動態規劃發展啟發法，期能協助規劃兩部RMIGC之移動路徑與駐停位置，以提升出口貨櫃裝船效率。

關鍵字

軌道式門型起重機；移動路徑問題；限制式規劃

並列摘要

In most of the busy container port terminals, rail mounted gantry cranes (RMGC) have become the main container handling equipment because they can provide higher capacity on existing yard space. However a routing planning including three key decisions: where to pick containers, how many containers should be picked and how the RMGC moves among yard bays should be made to maintain the efficiency before the RMGC starts to work. In order to enhance operation efficiency, some ports use more RMGCs to serve one gantry crane for loading export containers onto vessels, which makes the routing planning more complicated. In this research, a multi-objective programming model was formulated by time-space network for routing two RMGCs simultaneously when they are serving the same gantry crane. In addition, a heuristic algorithm composed of constraint programming and dynamic programming was developed to solve this problem.

並列關鍵字

Rail mounted gantry crane ； Routing problem ； Constraint programming

參考文獻

謝玉霜(2001)。限制式規劃應用於港區貨櫃場軌道式門型起重機移動路徑之研究。國立成功大學交通管理科學研究所。

Google Scholar

Kim, K. H.Kim, K. Y.(1999).Routing Straddle Carriers for the Loading Operation of Containers Using a Beam Search Algorithm.Computers Industry Engineering.36

Google Scholar

ILOG, Inc.(2001).ILOG OPL Studio 3.5 Reference Manual.

Google Scholar

Kim, K. Y.Kim, K. H.(1999).A Routing Algorithm for a Single Straddle Carrier to Load Export Containers onto Containership.International Journal of Production Economics.59