OR Spectrum

, Volume 30, Issue 1, pp 53–75 | Cite as

Optimizing the landside operation of a container terminal

  • Gary Froyland
  • Thorsten Koch
  • Nicole Megow
  • Emily Duane
  • Howard Wren
Regular Article

Abstract

This paper concerns the problem of operating a landside container exchange area that is serviced by multiple semi-automated rail mounted gantry cranes (RMGs) that are moving on a single bi-directional traveling lane. Such a facility is being built by Patrick Corporation at the Port Botany terminal in Sydney. The gantry cranes are a scarce resource and handle the bulk of container movements. Thus, they require a sophisticated analysis to achieve near optimal utilization. We present a three-stage algorithm to manage the container exchange facility, including the scheduling of cranes, the control of associated short-term container stacking, and the allocation of delivery locations for trucks and other container transporters. The key components of our approach are a time scale decomposition, whereby an integer program controls decisions across a long time horizon to produce a balanced plan that is fed to a series of short time scale online subproblems, and a highly efficient space-time divisioning of short-term storage areas. A computational evaluation shows that our heuristic can find effective solutions for the planning problem; on real-world data it yields a solution at most 8% above a lower bound on optimal RMG utilization.

Keywords

Container terminal Yard crane scheduling Storage space allocation Integer programming 

Mathematics Subject Classification (2000)

90C90 90B06 90C06 90C10 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alicke K (2002) Modeling and optimization of the inter-model terminal Mega Hub. OR Spectrum 24:1–17CrossRefGoogle Scholar
  2. Ballas A, Golias J (2002) Comparative evaluation of existing and innovative rail-road freight transport terminals. Transp Res A 36:593–611CrossRefGoogle Scholar
  3. Bramel J, Chen X, Simchi-Levi D (2005) The logic of logistics: theory, algorithms, and applications for logistics and supply chain management, 2nd Edn. Springer, HeidelbergGoogle Scholar
  4. Cheung RK, Li C-L, Lin W (2002) Interblock crane deployment in container terminals. Transp Sci 36(1): 79–93CrossRefGoogle Scholar
  5. Corry P, Kozan E (2006) An assignment model of dynamic load planning of intermodel trains. Comput Oper Res 33:1–17CrossRefGoogle Scholar
  6. Dekker R, Voogd P, van Asperen E (2006) Advanced methods for container stacking. OR Spectrum 28:563–586CrossRefGoogle Scholar
  7. Günther H-O, Kim KH (2005) Container terminals and automated transport systems. Springer, HeidelbergCrossRefGoogle Scholar
  8. Günther H-O, Kim KH (2006) Container terminals and terminal operations. OR Spectrum 28:437–445CrossRefGoogle Scholar
  9. Jaillet P, Wagner MR(2006) Online routing problems: value of advanced information as improved competitive ratios. Transp Sci 40:200–210CrossRefGoogle Scholar
  10. Kim KH (2005) Models and methods for operations in port container terminals. In: Langevin A, Riopel D (eds) Logistics systems: design and optimization, Gerad 25th Anniversary Series, chap. 7. Springer, Heidelberg, pp 213–243CrossRefGoogle Scholar
  11. Kim KH, Park YM, Ryu KR (2000) Deriving decision rules to locate export containers in container yards. Eur J Oper Res 124:89–101CrossRefGoogle Scholar
  12. Koch T (2004) Rapid mathematical programming. PhD Thesis, Technische Universität BerlinGoogle Scholar
  13. Kozan E (2000) Optimising container transfers at multi-modal terminals. Math Comput Modell 31:235–243CrossRefGoogle Scholar
  14. Kozan E, Preston P (2006) Mathematical modelling of container transfers and storage locations at seaport terminals. OR Spectrum 28:519–537CrossRefGoogle Scholar
  15. Lee LH, Chew EP, Tan KC, Han Y (2006) An optimization model for storage yard management in transshipment hubs. OR Spectrum 28:539–561CrossRefGoogle Scholar
  16. Murthy CSR, Manimaran G (2001) Resource management in real-time systems and networks. MIT Press, CambridgeGoogle Scholar
  17. Ng WC (2005) Crane scheduling in container yards with inter-crane interference. Eur J Oper Res 164:64–78CrossRefGoogle Scholar
  18. Pruhs KR, Sgall J, Torng E (2004) Online scheduling. In: JY-T, Leung (ed) Handbook of scheduling: algorithms, models, and performance analysis, chap 15. Chapman & Hall/CRCGoogle Scholar
  19. Steenken D, Voß S, Stahlbock R (2004) Container terminal operation and operations research—a classification and literature review. OR Spectrum 26(1):3–49CrossRefGoogle Scholar
  20. Vis IFA, de Koster R (2003) Transshipment of containers at a container terminal: an overview. Eur J Oper Res 147(1):1–16CrossRefGoogle Scholar
  21. Zhang C, Wan YW, Liu J, Linn R (2002) Dynamic crane deployment in the container storage yards. Transp Res B 36(6):537–555CrossRefGoogle Scholar

Copyright information

© Springer-Verlag 2007

Authors and Affiliations

  • Gary Froyland
    • 1
  • Thorsten Koch
    • 2
  • Nicole Megow
    • 3
  • Emily Duane
    • 4
  • Howard Wren
    • 5
  1. 1.School of Mathematics and StatisticsUniversity of New South WalesSydneyAustralia
  2. 2.Zuse Institute BerlinBerlinGermany
  3. 3.Institute of MathematicsTechnische Universität BerlinBerlinGermany
  4. 4.Department of Mathematics and StatisticsUniversity of MelbourneMelbourneAustralia
  5. 5.c/o Andrew RembelPatrick Technology and SystemsBotanyAustralia

Personalised recommendations