A Genetic Algorithm for Minimizing Relocations at Container Yard in Container Terminal

Abstract:

This paper focuses on storage location assignment and exported container relocation in container yard of container terminal with the objective of minimizing the number of container lifting. On the lifting steps, the truck with yard crane should be chosen in order to deliver a container from container yard to container ship, and this action can reduce container ship's docking time and increase effectiveness in container terminal service. In this paper, a genetic algorithm (GA) in container storage assignment and a heuristic for the container relocation determination are adopted. Also, the current practice including first-in-first-stored (FIFS) and simple relocation (SR) is used to compare the effectiveness of the GA and the proposed heuristic (RH). The experimental result presented that the proposed method is able to construct the effective solutions of storage location assignment of exported containers, and it reduces the number of relocations of exported container effectively.

• Periodical: Advanced Materials Research (Volumes 931-932)
• Pages: 1683-1688
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.931-932.1683
• Online since: May 2014
• Authors: Phatchara Sriphrabu, Kanchana Sethanan*, Somnuk Theerakulpisut
• Keywords: Container Terminal, Container Yard, Genetic Algorithm (GA), Relocation, Stacking

References

[1] M.A. Salido, O. Sapena, M. Rodriguez, F. Barber, A Planning Tool for Minimizing Reshuffles in Container Terminals, 21st IEEE International Conference on Tools with Artificial Intelligence, (2009) pp.567-571.

DOI: 10.1109/ictai.2009.53

[2] K.C. Wu, , C.J. Ting, Heuristic Approaches for Minimizing Reshuffle Operation at Container Yard, Proceedings of the Asia Pacific Industrial Engineering & Management Systems Conference, (2012) 1407-1415.

[3] K.H. Kim, G-P. Hong, A heuristic for relocating blocks, Computer & Operation Research, 33 (2006) 940-954.

[4] M. Caserta, S. Voß, M. Sniedovich, Applying the corridor method to a blocks relocation problem, OR Spectrum, 33 (2011) 915–929.

DOI: 10.1007/s00291-009-0176-5

[5] J. Kang, M-S. Oh, EY. Ahn, KR. Ryu, KH. Kim, Planning for Intra-block Remarshalling in a Container Terminal, Lecture Notes in Computer Science, 4031 (2006) 1211-1220.

DOI: 10.1007/11779568_128

[6] L. Chen, A. Langevin, Determining the storage location for outbound container in a maritime terminal, Industrial Engineering and Engineering Management (IEEM 2009). IEEE International Conference on. 8-11 Dec. 2009, Hong Kong, pp.543-547.

DOI: 10.1109/ieem.2009.5373283

[7] L. Chen, Z. Lu, The storage location assignment problem for outbound containers in a maritime terminal, Internation journal of Produsction Economics, 135 (2012) 73-80.

DOI: 10.1016/j.ijpe.2010.09.019

[8] M. Gen, R. Cheng, L. Lin, Network models and optimization: Multiobjective genetic algorithm approach, London, Springer (2008).

[9] C. Chamnanlor, K. Sethanan, C. Fu-Chien, M. Gen, Reentrant flow-shop scheduling with time windows for hard-disk manufacturing by hybrid genetic algorithms, The Asia Pacific Industrial Engineering & Management Systems Conference (APIEMS 2012), Dec. 2-5 2012, Phuket, Thailand, pp.986-907.

DOI: 10.7232/iems.2013.12.4.306