Loading sequencing with consideration of container rehandling
暂无分享,去创建一个
During the loading operations in container terminals, the handling time of yard cranes for retrieving a container depends on the stacking relationship between containers, which changes once rehandling occurs. Since rehandling is hard to be prevented in practice, the handling time (especially the setup time) of yard cranes for each container is dynamically changing. This research takes this dynamic property into consideration whereas previous work generally considered the handling time is deterministic. A mathematical model is constructed for this problem. An algorithm based on Greedy Randomized Adaptive Search Procedure (GRASP) is developed. The numerical experiments show the effectiveness and efficiency of the proposed algorithm. In addition, the cases with and without consideration of rehandling have been compared through numerical experiments.
[1] Lifeng Xi,et al. A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal , 2007, Eur. J. Oper. Res..
[2] Qingcheng Zeng,et al. Integrating simulation and optimization to schedule loading operations in container terminals , 2009, Comput. Oper. Res..
[3] Lixin Miao,et al. A Decision Support System for the Allocation of Yard Cranes and Blocks in Container Terminals , 2011, Asia Pac. J. Oper. Res..