Optimized Routing Problem for Multiple Rail Mounted Gantry Cranes

• Main Authors: Guo-Bin Ji, 紀國斌
• Other Authors: Hua-An Lu
• Format: Others
• Language: zh-TW
• Published: 2004
• Online Access: http://ndltd.ncl.edu.tw/handle/23998063181310341860

碩士 === 國立臺灣海洋大學 === 航運管理學系 === 92 === The trend of globalization and ship enlargement causes not only the larger volume of container traffic, but also the workload of per voyage substantially increasing. Storage areas, play the buffer roles for inbound and outbound containers at a terminal, are the first to be affected. Facing this situation, more and more terminals adopt Rail Mounted Gantry Crane (RMGC) to enhance capacity on exiting yard space. For the limitation of the rails, RMGCs should move by some rules. When a number of RMGCs simultaneously work in a yard block, the whole operation becomes more complex. This research focuses on routing multiple RMGCs among yard bays to minimize the working time of loading operation in container terminal. A min-max model followed the characteristics of RMGC operation is formulated and solved by a heuristic algorithm. This algorithm includes the container sequencing problem and the crane assignment. According to the initial working sequence, tabu search is applied to adjust the loading sequence of containers. Then, cranes are assigned to serve each loading job. Furthermore, the performances of the algorithm are evaluated by the results of different numerical experimentations, and the related analyses are discussed.