Abstract
The loading and unloading of container and their temporary storage in the container terminal are the most important and complex operation in seaport terminals. It is highly inter-related with the routing of yard crane and truck and their costs increased significantly especially without an efficient terminal management. This paper focuses on optimizing the way of allocating inbound and outbound containers in storage locations, known as the Container Storage Problem (CSP). It consists on finding the most suitable storage location for incoming containers that minimises rehandling operations of containers during their transfer to the ship, truck or train. We propose a genetic algorithm to solve the CSP for a single and various container types (refrigerated, open side, empty, dry, open top and tank). The main objective of this approach is to find an optimal container arrangement which minimize the re-handle operations of containers at their departure dates (unloading time). In fact, the wait time of customer trucks, the transfer time of yard crane and the Ship turnaround time are advantageously reduced. The performances of our proposed approaches are verified comparing to the results generated by the Last In First Out algorithm. Genetic approaches generated good results and experimental study confirms these and shows their effectiveness.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ayachi I., Kammarti R., Ksouri M., and Borne P., 2010, Harmony search algorithm for the container storage problem, 8th International Conference of Modeling and Simulation - MOSIM’10, Tunisia
Bazzazi M., Safaei N., and Javadian N., A genetic algorithm to solve the storage space allocation problem in a container terminal, Computers & Industrial Engineering, 2009
Chen P., Fu Z., Lim A., and Rodrigues B., 2004, Port yard storage optimization, IEEE Transactions on Automation Science and Engineering, 1, p. 26–37
Dubrovsky O., Levitin G., and Penn M., A genetic algorithm with compact solution encoding for the container ship stowage problem, Journal of Heuristics, 8, 585–599, 2002
Kammarti R., Ayachi I., Ksouri M., and Borne P., 2009, Evolutionary Approach for the Containers Bin-Packing Problem, Studies in Informatics and Control, 18 (4)
Kim Kap Hwan and Günther Hans-Otto, Container Terminals and Cargo Systems, Design, Operations Management and Logistics Control Issues, Springer-Verlag Berlin Heidelberg, 2007, pp. 3–14
Kim K.-H. and Park K.-T., 2003, A note on a dynamic space-allocation method for outbound containers, European Journal of Operational Research, p. 92–101
Kim K.-H., 1997, Evaluation of the number of rehandles in container yards, Computers & Industrial Engineering, 32 (4)
Kim K.-H. and Kim, H.-B., 1998, The optimal determination of the space requirement and the number of transfer cranes for import containers, Computers ind. Engng., 35, p. 427–430
Lee D.-H., Cao J.-X., Shi Q., and Chen, J.-H., 2009, A heuristic algorithm for yard truck scheduling and storage allocation problems, Transportation Research Part E, 45, p. 810–820
Murty K.G., Liu J.,Wan Y.W., Zhang C., Tsang M.C.L., and Linn R., 2005, A decision support system for operations in a container terminal, Journal Decision Support Systems, 39 (3)
Preston P. and Kozan E., 2001, An approach to determine storage locations of containers at seaport terminals, Computers & Operations Research, p. 983–995
Wilson I.D. and Roach P.A., 2000. Container stowage planning: a methodology for generating computerised solutions. Journal of the Operational Research Society, 51, 1248–1255
Zhang C., Liu J., Wan Y.-W., Murty K.-G., and Linn R.-J., 2003, Storage space allocation in container terminals, Transportation Research Part B, 37, p. 883–903
Moussi R., Fatma Ndiaye N., and Yassine A., Hybrid Genetic Simulated Annealing Algorithm (HGSAA) to Solve Storage Container Problem in Port, Intelligent Information and Database Systems, Lecture Notes in Computer Science, Vol. 7197, 2012, pp 301–31
Liu F., Low M.Y.H., Hsu W.J., Huang S.Y., Zeng M., and Win C.A., Randomized algorithm with tabu search for multi-objective optimization of large containership stowage plans, in: Proc. 2nd Intl. Conference on Computational Intelligence, Lecture Notes in Computer Science, Vol. 6971, pp. 256–272, 2011
Park T., Sohn M., and Rya K.R., Optimizing stacking policies using a MOEA for an automated container terminal, 40th Intl. Conference on Computers and Industrial Engineering, 2010
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Atlantis Press
About this chapter
Cite this chapter
Ayachi, I., Kammarti, R., Borne, P. (2012). Genetic Algorithm to Solve Container Storage Problem for a Single and Various Types. In: Kahraman, C. (eds) Computational Intelligence Systems in Industrial Engineering. Atlantis Computational Intelligence Systems, vol 6. Atlantis Press, Paris. https://doi.org/10.2991/978-94-91216-77-0_19
Download citation
DOI: https://doi.org/10.2991/978-94-91216-77-0_19
Publisher Name: Atlantis Press, Paris
Print ISBN: 978-94-91216-76-3
Online ISBN: 978-94-91216-77-0
eBook Packages: Computer ScienceComputer Science (R0)