zbMATH — the first resource for mathematics

Scheduling automated triple cross-over stacking cranes in a container yard. (English) Zbl 1200.90072
Summary: We describe an approach for scheduling triple cross-over stacking cranes in an automated container storage block with asynchronous hand over at the transfer areas at both block front ends. The problem is characterised by frequent long crane moves that make job assignment and crane routing particularly challenging, as an intricate synchronisation between the cranes is required. The main objective is to maximise the productivity of the crane system under peak load while preventing delays in the transport of import and export containers from and to the transfer areas. Our method solves an online optimisation problem by constructing a new crane schedule for a certain planning horizon whenever a new job arrives or a job is completed. We report on extensive simulation studies for evaluating the scheduling strategy. The results show that the method performs significantly better than commonly used heuristics, leading to a productivity gain of more than 20%.

90B35 Deterministic scheduling theory in operations research
90B06 Transportation, logistics and supply chain management
Full Text: DOI
[1] Bohrer P (2005) Crane scheduling in container terminals. Diploma thesis, Department of Mathematics, University of Kaiserslautern
[2] Choe R, Park T, Min Ok S, Ryel Ryu K (2007) Real-time scheduling for non-crossing stacking cranes in an automated container terminal. In: AI 2007: advances in artificial intelligence, lecture notes in computer science. Springer, Berlin/Heidelberg, pp 625–631
[3] Daganzo CF (1989) The crane scheduling problem. Transp Res 23B(3): 159–175 · doi:10.1016/0191-2615(89)90001-5
[4] Froyland G, Koch T, Megow N, Duane E, Wren H (2008) Optimizing the landside operation of a container terminal. OR Spectr 30(1): 53–75 · Zbl 1133.90308 · doi:10.1007/s00291-007-0082-7
[5] Kim KH, Kim KY (1999) An optimal routing algorithm for a transfer crane in port container terminals. Transp Sci 33(1): 17–33 · Zbl 1002.90508 · doi:10.1287/trsc.33.1.17
[6] Koch T (2004) Rapid mathematical programming. PhD thesis, TU Berlin. Available as ZIB-Report 04-58
[7] Narasimhan A, Palekar US (2002) Analysis and algorithms for the transtainer routing problem in container port operations. Transp Sci 36(1): 63–78 · Zbl 1065.90511 · doi:10.1287/trsc.
[8] Ng WC (2005) Crane scheduling in container yards with inter-crane interference. Eur J Oper Res 164(1): 64–78 · Zbl 1132.90331 · doi:10.1016/j.ejor.2003.11.025
[9] Ng WC, Mak KL (2005) Yard crane scheduling in port container terminals. Appl Math Model 29(3): 263–276 · Zbl 1077.90029 · doi:10.1016/j.apm.2004.09.009
[10] Saanen Y (2004) An approach for designing robotized marine container terminals. PhD thesis, Delft University of Technology
[11] Saanen Y, van Valkengoed M (2006) Comparison of three automated stacking alternatives by means of simulation. In: Proceedings of the winter simulation conference 2005, pp 1567–1576
[12] Saanen Y, Rijsenbrij J (2007) Which system fits your hub? In: Cargo Systems, June 2007, pp 47–51
[13] Stahlbock R, Voß S (2008) Operations research at container terminals: a literature update. OR Spectr 30(1): 1–52 · Zbl 1133.90313 · doi:10.1007/s00291-007-0100-9
[14] Stahlbock R, Voß S, Eisenberg R (2008) Increasing the efficiency of container terminals by automated double rail mounted gantry cranes. In: Presented at the 3rd German–Korean workshop on container terminal management: IT-based planning and control of seaport container terminals and transportation systems, August 27–31, Bremen, Germany
[15] van Valkengoed M (2004) How passing cranes influence stack operations in a container terminal: a simulation study. TBA Nederland, Delft, and Master’s thesis, University of Amsterdam
[16] Zyngiridis I (2005) Optimizing container movements using one and two automated stacking cranes. Master’s thesis, Naval Postgraduate School, Monterey
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.