Abstract
Recently, a new approach to solve the outbound container location problem motivated by the Shanghai maritime terminals was published. This approach addresses the problem by decomposing it into two stages. The first stage is a mathematical programming model and the second stage is a heuristic algorithm whose objective is to minimize the total reshuffle movements executed during the loading operation. That study reports that the diagonal stacking configuration provides the best performance. Conversely, this paper documents the results of a study to observe the performance of the various staking strategies under different conditions that can occur regularly in real ports. The parameters that are varied are the number of tiers in each stack, the number of container weight levels, and the permitted bay utilization. The results show that although the diagonal stacking strategy does provide the best performance under some conditions, it does not yield the best performance in other parameter combinations. The horizontal strategy is found to perform best for most of the parameter combinations considered in this study.
Similar content being viewed by others
References
Carlo HJ, Vis IFA, Roodbergen KJ (2014) Storage yard operations in container terminals: literature overview, trends, and research directions. Eur J Oper Res 235:412–430
Chen L, Lu Z (2012) The storage location assignment problem for outbound containers in a maritime terminal. Int J Prod Econ 135:73–80
Gharehgozli AH, Yu Y, De Koster R, Udding JT (2014) A decision- tree stacking heuristic minimising the expected number of reshuffles at a container terminal. Int J Prod Res 52:2592–2611
Kim KH, Kim HB (1999a) Segregating space allocation models for container inventories in port container terminals. Int J Prod Econ 59:415–423
Kim KY, Kim KH (1999b) A routing algorithm for a single straddle carrier to load export containers onto a containership. Int J Prod Econ 59:425–433
Kim KH, Lee KM, Jwang H (2003) Sequencing delivery and receiving operations for yard cranes in port container terminals. Int J Prod Econ 84:283–292
Lee DH, Cao Z, Meng Q (2007) Scheduling of two-transtainer systems for loading outbound containers in port container terminals with simulated annealing algorithm. Int J Prod Econ 107:115–124
Ng WC, Mak KL (2005) Yard crane scheduling in port container terminals. Appl Math Model 29:263–276
Park T, Choe R, Kim YH, Ryu KR (2011) Dynamic adjustment of container stacking policy in an automated container terminal. Int J Prod Econ 133:385–392
Rashidi H, Tsang E (2013) Novel constraints satisfaction models for optimization problems in container terminals. Appl Math Model 37:3601–3634
Woo YJ, Kim KH (2011) Estimating the space requirement for outbound container inventories in port container terminals. Int J Prod Econ 133:293–301
Acknowledgements
This research was partially supported by the Tecnológico de Monterrey Research Group in Optimization and Data Science 0822B01006.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Guerra-Olivares, R., Smith, N.R., González-Ramírez, R.G. et al. A study of the sensitivity of sequence stacking strategies for the storage location assignment problem for out-bound containers in a maritime terminal. Int J Syst Assur Eng Manag 9, 1057–1062 (2018). https://doi.org/10.1007/s13198-018-0733-x
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13198-018-0733-x