Advertisement

Space reservation and remarshalling operations for outbound containers in marine terminals

  • Kap Hwan KimEmail author
  • Youn Ju Woo
  • Jae Gwan Kim
Original Article

Abstract

Outbound containers begin to arrive 7–15 days before the corresponding vessel. To reduce the use of yard space, they are stacked in a temporary storage area in the early stages of arrival, and a permanent storage area is subsequently allocated to all containers to be loaded on a certain vessel. Containers arriving before the allocation are moved to the allocated permanent storage area, which is called “remarshalling”. This paper proposes a method to determine the right time to remarshal outbound containers, as well as the amount of space reservation required, considering the handling effort for remarshalling and the efficiency of the loading operation. Mathematical formulations and solution algorithms are developed both for a single vessel and for multiple vessels. A simple procedure is proposed for the problem involving only a single vessel, and a genetic algorithm is developed for the multiple vessel problem. Through numerical experiments, it is found that as the remarshalling cost per container increases, ship operating and total costs tend to increase, too, while remarshalling costs do not show any conclusive trend. We also find that an increase in the available space, relative to space requirements, has a higher impact on the reduction of remarshalling costs than on the reduction of ship operating costs. Our results can support yard managers in container terminals to manage efficiently space reservations and remarshalling operations.

Keywords

Remarshalling Container terminals Storage systems Outbound containers Genetic algorithm 

Notes

Acknowledgements

Authors would like to thank the anonymous referees for their valuable comments. This work was supported under the framework of the International Cooperation Program managed by the National Research Foundation of Korea (NRF) (Project number: NRF-2016K1A3A1A48954044). Kap Hwan Kim developed the basic ideas, designed the research, wrote the paper, and led the entire process of the research. Youn Ju Woo contributed to formulating mathematical models and to analyzing the properties of the optimal solutions. Jae Kwan Kim developed computer programs for testing various algorithms and for performing numerical experiments.

References

  1. Beyer, W.H. 1984. CRC Standard Mathematical Tables, 27th ed. Boca Raton: CRC Press.Google Scholar
  2. Carlo, H.J., I.F.A. Vis, and K.J. Roodbergen. 2014. Storage Yard Operations in Container Terminals: Literature Overview, Trends, and Research Directions. European Journal of Operational Research 235: 412–430.CrossRefGoogle Scholar
  3. Castilho, B.D., and C.F. Daganzo. 1991. Optimal Pricing Policies for Temporary Storage at Ports. Transportation Research Record 1313: 66–74.Google Scholar
  4. Holguin-Veras, J., and S. Jara-Diaz. 1999. Optimal Pricing for Priority Service and Space Allocation in Container Ports. Transportation Research Part B 33 (2): 81–106.CrossRefGoogle Scholar
  5. Holguin-Veras, J., and S. Jara-Diaz. 2006. Preliminary Insights into Optimal Pricing and Space Allocation at Intermodal Terminals with Elastic Arrivals and Capacity Constraint. Networks and Spatial Economics 6: 25–38.CrossRefGoogle Scholar
  6. Holguin-Veras, J., and S. Jara-Diaz. 2010. Optimal Two-Part Pricing and Capacity Allocation with Multiple User Classes and Elastic Arrivals at Constrained Transportation Facilities. Networks and Spatial Economics 10 (4): 427–454.CrossRefGoogle Scholar
  7. Kim, K.H., and K.Y. Kim. 2007. Optimal Price Schedules for Storage of Inbound Containers. Transportation Research Part B 41: 892–905.CrossRefGoogle Scholar
  8. Kim, K.Y., and K.H. Kim. 2010. Pricing the Storage of Inbound Containers with a Discrete Probability Distribution of Retrieval Times. International Engineering and Management Sciences 9 (2): 165–177.Google Scholar
  9. Lee, C.Y., and M. Yu. 2012. Inbound Container Storage Price Competition Between the Container Terminal and a Remote Container Yard. Flexible Service and Manufacturing Journal 24: 320–348.CrossRefGoogle Scholar
  10. Martin, E., K.H. Kim, and S. Saurí. 2015. Optimal Space for Storage Yard Considering Yard Inventory Forecasts and Terminal Performance. Transportation Research Part E: Logistics and Transportation Review 82: 101–128.CrossRefGoogle Scholar
  11. Rodriguez, G. 2010. Parametric Survival Model. http://data.princeton.edu/pop509/ParametricSurvival.pdf.
  12. Saurí, S., J. Serra, and E. Martín. 2011. Evaluating Pricing Strategies for Storage in Import Container Terminals. Transportation Research Record 2238: 1–7.CrossRefGoogle Scholar
  13. Taleb-Ibrahimi, M., B.D. Castilho, and C.F. Daganzo. 1993. Storage Space vs Handling Work in Container Terminals. Transportation Research Part B 12 (1): 13–32.CrossRefGoogle Scholar
  14. Watanabe, I. 2001. Container Terminal Planning—A Theoretical Approach. Great Britain: WCN Publishing.Google Scholar
  15. Woo, Y.J., and K.H. Kim. 2011. Estimating the Space Requirement for Outbound Container Inventories in Port Container Terminals. International Journal of Production Economics 133: 293–301.CrossRefGoogle Scholar
  16. Woo, Y.J., J.-H. Song, and K.H. Kim. 2016. Pricing Storage of Outbound Containers in Container Terminals. Flexible Services and Manufacturing 28 (4): 644–668.CrossRefGoogle Scholar
  17. Yu, M., K.H. Kim, and C.-Y. Lee. 2015. Inbound Container Storage Pricing Schemes. IIE Transactions 47: 1–19.CrossRefGoogle Scholar
  18. Zhen, L., X. Jiang, L.H. Lee, and E.P. Chew. 2013. A Review on Yard Management in Container Terminals. Industrial Engineering & Management Systems 12 (4): 289–305.CrossRefGoogle Scholar

Copyright information

© Springer Nature Limited 2019

Authors and Affiliations

  1. 1.Department of Industrial EngineeringPusan National UniversityBusanSouth Korea
  2. 2.Department of Computer EngineeringPusan National UniversityBusanSouth Korea

Personalised recommendations