Skip to main content

A Service-Oriented Model for the Yard Management Problem in Container Terminals

  • Conference paper
Computational Logistics (ICCL 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6971))

Included in the following conference series:

  • 3139 Accesses

Abstract

This study proposes a novel service-oriented model for the yard management problem in container terminals. Two decisions of the yard management problem are integrated instead of being solved hierarchically: storage allocation for containers that arrive in near future and yard crane (YC) deployment for assigning yard cranes over the entire storage yard. A concept of YC assignment profile is proposed in order to take into account the requirement of YC work patterns. The problem is formulated as a mixed integer linear program with the objective of minimizing total delayed workload and YC movement penalty as well as the total container moving distance. A rolling horizon approach (RHA) is developed to obtain good solutions in an efficient manner.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Cheung, R.K., Li, C.L., Lin, W.Q.: Interblock crane deployment in container terminals. Transportation Science 36(1), 79–93 (2002)

    Article  MATH  Google Scholar 

  2. Giallombardo, G., Moccia, L., Salani, M., Vacca, I.: Modeling and solving the tactical berth allocation problem. Transportation Research Part B: Methodological 44(2), 232–245 (2010)

    Article  Google Scholar 

  3. Kim, K.H., Kim, H.B.: The optimal sizing of the storage space and handling facilities for import containers. Transportation Research Part B: Methodological 36(9), 821–835 (2002)

    Article  Google Scholar 

  4. Lee, L.H., Chew, E.P., Tan, K.C., Han, Y.B.: An optimization model for storage yard management in transshipment hubs. OR Spectrum 28(4), 539–561 (2006)

    Article  MATH  Google Scholar 

  5. Moccia, L., Astorino, A.: The group allocation problem in a transshipment container terminal. In: Proceedings of World Conference on Transport Research. University of California, Berkeley (2007)

    Google Scholar 

  6. Petering, M.E.H., Murty, K.G.: Effect of block length and yard crane deployment systems on overall performance at a seaport container transshipment terminal. Computers & Operations Research 36(5), 1711–1725 (2009)

    Article  MATH  Google Scholar 

  7. Zhang, C., Liu, J.Y., Wan, Y.W., Murty, K.G., Linn, R.J.: Storage space allocation in container terminals. Transportation Research Part B: Methodological 37(10), 883–903 (2003)

    Article  Google Scholar 

  8. Zhang, C., Wan, Y.W., Liu, J.Y., Linn, R.J.: Dynamic crane deployment in container storage yards. Transportation Research Part B: Methodological 36(6), 537–555 (2002)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jin, J.G., Cao, J.X., Chen, J.H., Lee, DH. (2011). A Service-Oriented Model for the Yard Management Problem in Container Terminals. In: Böse, J.W., Hu, H., Jahn, C., Shi, X., Stahlbock, R., Voß, S. (eds) Computational Logistics. ICCL 2011. Lecture Notes in Computer Science, vol 6971. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24264-9_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24264-9_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24263-2

  • Online ISBN: 978-3-642-24264-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics