貨櫃碼頭岸肩拖車派遣規劃之研究

DISPATCHING OF TRUCK TRAILERS IN CONTAINER TERMINAL

本研究以專用貨櫃碼頭之營運型態為對象，探討碼頭岸肩與貨櫃堆積場間，載運貨櫃車輛之派遣規劃。在各櫃次之橋式起重機與貨櫃堆積場作業時間已知的前提下，建構一極小極大化之非線性整數規劃模式，並發展符合實務作業之啟發式演算法，解析多部拖車支援單部起重機之規劃作業。其中建議「由近至遠」、「由遠至近」、「一遠一近」、「隨機選取」四種距離原則作為儲區指派策略，除對實例之原始裝卸順序進行解算外，另配合「全卸全裝」、「依艙位序裝卸」與「同時裝卸」的貨櫃船裝卸作業型態，進行不同拖車數之派遣分析。其結果顯示儲區指派原則因案例不同而裝卸效率互異，宜做事先規劃；而作業型態若能在充分配合下，「同時裝卸」方式較能達到縮短作業時間之成效。本研究之成果不僅可預先規劃拖車之指派與完工時間的估算，就長期規劃課題而言，亦能作為機具數量與部署決策之參考。

In this study we analyzed the dispatching problem of truck trailers tosupport transferring tasks of containers between quay cranes and yard areas ofprivate container terminals. Given the waiting time of crane and yard handlingfor each task, we formulated a min-max nonlinear integer programming modelfor multiple track trailers working with one crane. Based on certain operationalconcepts, a heuristic algorithm is also designed to solve this problem. Theyinclude four assignment principles of container storage/pick-up location:shortest-route assignment, furthest-route assignment, shortest and furthest-routemixed assignment, and random assignment, as well as three loading anddischarging patterns ( i.e., whole discharging plus loading, bay-to-bay, anddouble cycle operation). We exploited the algorithm to analyze some real-worldcases. The results showed that none of the operations worked better in fourlocation assignment principles for different cases, but the double cycleoperation was able to obtain a fair performance, if the real environment ofcontainer terminal could match the requirement of handling. Our study canprovide companies not only the dispatching program of truck trailers and theestimated period of tasks finished but also the required number of deployedtruck trailers for a long-term planning.