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

Dispatching of Truck Trailers in Container Terminal

10.6402/TPJ.200509.0325

盧華安(Hua-An Lu)；鄭景怡(Jing-Yi Jeng)

橋式起重機 ； 極小極大化 ； 非線性整數規劃模式 ； 啟發式演算法 ； Quay crane ； Min-max ； Nonlinear integer programming model ； Heuristic algorithm

運輸計劃季刊

34卷3期（2005 / 09 / 30）

325 - 353

繁體中文

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

In this study we analyzed the dispatching problem of truck trailers to support transferring tasks of containers between quay cranes and yard areas of private container terminals. Given the waiting time of crane and yard handling for each task, we formulated a min-max nonlinear integer programming model for multiple track trailers working with one crane. Based on certain operational concepts, a heuristic algorithm is also designed to solve this problem. They include four assignment principles of container storage/pick-tip location: shortest-route assignment, furthest-route assignment, shortest and furthest-route mixed assignment, and random assignment, as well as three loading and discharging patterns (i.e., whole discharging plus loading, hay-to-hay, and double cycle operation). We exploited the algorithm to analyze some real-world cases. The results showed that none of the operations worked better in four location assignment principles for different cases, but the double cycle operation was able to obtain a fair performance, if the real environment of container terminal could match the requirement of handling. Our study can provide companies not only the dispatching program of truck trailers and the estimated period of tasks finished hut also the required num her of deployed truck trailers for a long-term planning.

1. 陳春益、趙時樑(2003)。港區貨櫃場軌道型門式起重機移動路徑之研究。運輸計劃季刊，32(4)，681-714。
   連結：
2. Ballis, A.,Golias, J.,Abakoumkin, C.(1997).A Comparison Between Conventional and Advanced Handling Systems for Low Volume Container Maritime Terminals.Maritime Policy and Management,1(24),73-92.
3. Bish, E. K.(2003).A Multiple-Crane-Constrained Scheduling Problem in a Container Terminal.European Journal of Operational Research,144,83-107.
4. Bish, E. K.,Leong, T. Y.,Li, C. L.,Ng, J. W. C.,Simchi-Levi, D.(2001).Analysis of a New Vehicle Scheduling and Location Problem.Naval Research Logistics,48,363-385.
5. Bose, J.,Reiners, T.,Steenken, D.,Voβ, S.(2000).the 33rd Hawaii International Conference on System Sciences.
6. Chen, T.(1999).Yard Operations in the Container Terminal – A Study in the Unproductive Moves.Maritime Policy and Management,1(26),22-38.
7. Daganzo, C. F.(1990).The Productivity of Multipurpose Seaport Terminals.Transport Science,3(24),205-216.
8. Daganzo, C. F.(1989).The Crane Scheduling Problem.Transportation Research Part B,3(23),159-175.
9. Das, S. K,Spasovic, L.(2003).Scheduling Material Handling Vehicles in a Container Terminal.Production Planning and Control,7(14),623-633.
10. Easa, S. M.(1987).Approximate Queuing Models for Analyzing Harbor Terminal Operations.Transportation Research Part B,21,269-286.
11. Edmond, E.(1975).Operation Capacity of Container Berths for Scheduled Service by Queuing Theory.Dock Harbor Authority,230-234.
12. Evers, J. J. M.,Koppers, S. A. J.(1996).Automated Guided Vehicle Traffic Control at a Container Terminal.Transportation Research Part A,30,21-34.
13. Garrido, R. A.,Allendes, F. A.(2000).Conference on Traffic and Transportation Studies.ICTTS.
14. Jones, J. H.(1968).Ship Turn-Around Time at the Port of Bangkok.Journal of Waterways Harbors Div.,94,135-148.
15. Working paper
16. Kim, K. H.,Kim, K. Y.(1999).An Optimal Routing Algorithm for a Transfer Crane in Port Container Terminals.Transportation Science,1(35),17-33.
17. Kim, K. H.,Kim, K. Y.(1999).Routing Straddle Carriers for the Loading Operation of Containers Using a Beam Search Algorithm.Computers and Industrial Engineering,1(36),109-136.
18. Kim, K. Y.,Kim, K. H.(2003).Heuristic Algorithms for Routing Yard-Side Equipment for Minimizing Loading Times in Container Terminals.Naval Research Logistics,50,488-514.
19. Kim, K. Y.,Kim, K. H.(1999).A Routing Algorithm for a Single Straddle Carrier to Load Export Containers onto a Containership.International Journal of Production Economics,59,415-423.
20. Kim, K. Y.,Kim, K. H.(1997).Routing Algorithm for a Single Transfer Crane to Load Export Containers onto a Containership.Computers & Industrial Engineering,3/4(33),673-676.
21. Kozan, E.(1996).Comparison of Analytical and Simulation Planning Models of Seaport Container Terminals.Transport Plan Technology,20,235-348.
22. Kozan, E.,Preston, P.(1999).Genetic Algorithms to Schedule Container Transfers at Multimodal Terminals.International Transactions in Operations Research,6,311-329.
23. Liu, C. I.,Jula, H.,Vukadinovic, K.,Ioannou, P. A.(2000).the Conference on Intelligent Transportation Systems, ITSC.
24. Meersmans, P. J. M.,Dekker, R.(2003).Technical Report EI.Rotterdam:Erasmus University, Econometric Institute.
25. Nishimura, E.,Imai, A.(2000).The International Seminar on Global Transportation Network.Kobe, Japan:
26. Peterkofsky, R. I.,Daganzo, C. F.(1990).A Branch and Bound Solution Method for the Crane Scheduling Problem.Transportation Research Part B,3(24),159-172.
27. Steenken, D.,Voβ, S.,Stahlbock, R.(2004).Container Terminal Operation and Operatins Research – A Classification and Literature Review.OR Spectrum,26,3-49.
28. Vis, I. F. A.,Koster, D. R.,Roodbergen, K. J.,Peeters, L. W. P.(2001).Determination of the Number of Automated Guided Vehicles Required at a Semi-Automated Container Terminal.Journal of the Operational Research Society,4(52),409-417.
29. Vis, I. F. A.,Koster, R.(2003).ransshipment of Containers at a Container Terminal: An Overview.European Journal of Operational Research,147,1-16.
30. Yun, W. Y.,Choi, Y. S.(1999).Simulation Model for Container-Terminal Operation Analysis Using an Object-Oriented Approach.International Journal of Production Economics,59,221-230.
31. 李光益(1995)。高雄港貨櫃中心作業流程之模擬研究。國立成功大學交通管理研究所。
32. 高傳凱(2002)。貨櫃儲存場堆積策略模擬與儲位指派模式構建。國立交通大學交通運輸研究所。
33. 許乃云(2002)。貨櫃儲區整櫃之最佳化網路模式。國立成功大學土木工程研究所。
34. 陳壽山(1995)。貨櫃堆積場機具作業時間模式之構建及比較。國立成功大學交通管理研究所。
35. 靳蓉章(2002)。如何提高貨櫃船船邊作業的效率。中華海員，580，1-22。
36. 趙時樑(2003)。出口儲區門型起重機取櫃問題之研究。國立成功大學交通管理研究所。
37. 鄭景怡(2004)。貨櫃裝卸作業與岸肩載運機具指派之研究。國立臺灣海洋大學航運管理研究所。
38. 謝玉霜(2001)。限制式規劃應用於港區貨櫃場軌道式門型起重機移動路徑之研究。國立成功大學交通管理研究所。