Abstract：This study analyzes the location assignments for outbound containers in terminals to reduce the container re-handling during loading operations. Previous studies assumed that the container arrival probability for each weight group remained unchanged during the entire receiving process, which is not true in practice. This study adjusts the probability that the remaining containers have not yet arrived at the terminal. A constrained dynamic programming model is then constructed for this problem. Small-instances can be directly optimized by the dynamic programming model. Large-instances are solved with a two-stage heuristic algorithm. The first stage develops a heuristic to generate the precedence of the stacking patterns for each container weight group. The second stage uses a heuristic algorithm based on the rolling strategy. Numerical calculations show that the dynamic programming method for small-instances and the two-stage heuristic algorithm for large-instances both significantly improve the solution quality and reduce the container re-handling.
[1] Kim K H, Park K T. A note on a dynamic space-allocation method for outbound containers [J]. European Journal of Operational Research, 2003, 148(1): 92-101.
[2] Zhang C, Liu J, Wan Y, et al. Storage space allocation in container terminals [J]. Transportation Research Part B, 2003, 37(10): 883-903.
[3] Lee L, Chew E, Tan K, et al. An optimization model for storage yard management in transshipment hubs [J]. OR Spectrum, 2006, 28(4): 539-561.
[4] Han Y, Lee L, Chew E, et al. A yard storage strategy for minimizing traffic congestion in a marine container transshipment hub [J]. OR Spectrum, 2008, 30(4): 697-720.
[5] Zhang C, Zhang Z, Zheng L, et al. A decision support system for the allocation of yard cranes and blocks in container terminals [J]. Asia-Pacific Journal of Operational Research, 2011, 28(6): 803-829.
[6] Kozan E, Preston P. Mathematical modelling of container transfers and storage locations at seaport terminals [J]. OR Spectrum, 2006, 28(4): 519-537.
[7] Zhu W, Qin H, Lim A, et al. Iterative deepening A* algorithms for the container relocation problem [J]. IEEE Transactions on Automation Science and Engineering, 2012, 9(4): 710-722.
[8] Chen L, Lu Z. The storage location assignment problem for outbound containers in a maritime terminal [J]. International Journal of Production Economics, 2012, 135(1): 73-80.
[9] Dekker R, Voogd P, Eelco V A. Advanced methods for container stacking [J]. OR Spectrum, 2006, 28(4): 563-586.
[10] Kang J, Ryu K, Kim K. Deriving stacking strategies for export containers with uncertain weight information [J]. Journal of Intelligent Manufacturing, 2006, 17(4): 399-410.
[11] Kim K H, Park Y M, Ryu K R. Deriving decision rules to locate export containers in container yards [J]. European Journal of Operational Research, 2000, 124(1): 89-101.
[12] Zhang C, Chen W, Shi L, et al. A note on deriving decision rules to locate export containers in container yards [J]. European Journal of Operational Research, 2010, 205(2): 483-485.
2015, Vol. 55 
