Browse > Article
http://dx.doi.org/10.9708/jksci.2017.22.09.081

An In-depth Analysis and Performance Improvement of a Container Relocation Algorithm  

Lee, Hyung-Bong (Dept. of Computer Science & Engineering, Gangneung-Wonju National University)
Kwon, Ki-Hyeon (Dept. of Electronics, Information & Communication Engineering, Kangwon National University)
Abstract
The CRP(Container Relocation Problem) algorithms pursuing efficient container relocation of wharf container terminal can not be deterministic because of the large number of layout cases. Therefore, the CRP algorithms should adopt trial and error intuition and experimental heuristic techniques. And because the heuristic can not be best for all individual cases, it is necessary to find metrics which show excellent on average. In this study, we analyze GLAH(Greedy Look-ahead Heuristic) algorithm which is one of the recent researches in detail, and propose a heuristic metrics HOB(sum of the height differences between a badly placed container and the containers prohibited by the badly placed container) to improve the algorithm. The experimental results show that the improved algorithm, GLAH', exerts a stable performance increment of up to 3.8% in our test data, and as the layout size grows, the performance increment gap increases.
Keywords
Allocation; CPMP; CRP; B&B; GLAH; Heuristic;
Citations & Related Records
연도 인용수 순위
  • Reference
1 B. Jin, W. Zhu, and A. Lim, "Solving the container relocation problem by an improved greedy look-ahead heuristic," European Journal of Operational Research, Vol. 240, No. 3, pp. 837-847, February 2015.   DOI
2 W. Zhu, H. Qin, and A. Lim, "Iterative Deepening A* Algorithms for the Container Relocation Problem," IEEE Transactions on Automation Science and Engineering, Vol. 9, No. 4, pp. 710-722, October 2012.   DOI
3 F. Forster, A. Bortfeldt, "A tree search procedure for the container relocation problem", European Journal of Operational Research, Vol. 39, No. 2, pp. 299-309. February 2012.
4 K. H. Kim, "Evaluation of the number of rehandles in container yards," Computers & Industrial Engineering, Vol. 32, No. 4, pp. 701-711, September 1997.   DOI
5 J. Kang, K. R. Ryu, K. H. Kim, "Deriving stacking strategies for export containers with uncertain weight information," Journal of Intelligent Manufacturing, Vol. 17, No. 4, pp. 399-410, August 2006.   DOI
6 Y. Lee. N. Y. Hsu, "An optimization model for the container pre-marshalling problem," Computers & Operations Research, Vol. 34, No. 11, pp. 3295-3313, November 2007.   DOI
7 M.S. Gheith, A. B. Eltawil, N. A. Harraz, and S. Mizuno, "An Integer Programming Formulation and Solution for the Container Pre-marshalling Problem ," Proceedings of CIE44 & IMSS'14, pp. 2047-2056. October 2014.
8 Y. Lee, S. L. Chao, "A neighborhood search heuristic for pre-marshalling export containers," European Journal of Operational Research, Vol. 196, No. 2, pp. 468-487. July 2009.   DOI
9 Wikipedia(ILP: Integer Linear Programming), https://en.wikipedia.org/wiki/Integer_programming
10 K. H. Kim, G. P. Hong, "A heuristic rule for relocating blocks," Computers & Operations Research, Vol. 33, No. 4, pp. 940-954, April 2006.   DOI
11 Wikipedia(A* Algorithm), https://en.wikipedia.org/wiki/A*_search_algorithm
12 D. Ku, T. S. Arthanari, "Container relocation problem with time windows for container departure," European Journal of Operational Research, Vol. 252, No. 3, pp. 1031-1039. August 2016.   DOI
13 K. H. Kim, Y. M. Park, and K. R. Ryu, "Deriving decision rules to locate export containers in container," European Journal of Operational Research, Vol. 124, No. 1, pp. 89-101. July 2000.   DOI