Please use this identifier to cite or link to this item:
|Keywords: ||橋式起重機、極小極大化、非線性整數規劃模式、啟發式演算法、Quay crane、 Min-max、Nonlinear integer programming model、Heuristic algorithm|
|Issue Date: ||2016-04-08T02:43:44Z
Abstract: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.
|Relation: ||34(3),P325 - 353|
|Appears in Collections:||[航運管理學系] 期刊論文|
Files in This Item:
All items in NTOUR are protected by copyright, with all rights reserved.