Article ID: | iaor2017720 |
Volume: | 51 |
Issue: | 1 |
Start Page Number: | 305 |
End Page Number: | 324 |
Publication Date: | Feb 2017 |
Journal: | Transportation Science |
Authors: | Fischer Kathrin, Speer Ulf |
Keywords: | vehicle routing & scheduling, combinatorial optimization, simulation |
In this work, different variants of a branch‐and‐bound procedure for yard crane scheduling at seaport container terminals and their effect on the terminal’s performance are studied. In particular, this work investigates the level of detail needed to take the exact crane characteristics, e.g., movements and crane interference, into account in the scheduling algorithm. This is examined for four different automated yard crane systems with one or more cranes that operate on rectangular yard blocks with transfer positions at both ends of the block and with the yard blocks arranged orthogonally to the quay. Using a simulation model with realistic scenario data and an automated guided vehicles system for horizontal transport, the results are compared with respect to different key performance indicators, e.g., yard crane productivity and average lateness of jobs. It turns out that especially the consideration of crane interference leads to significant improvements in yard crane productivity. As a result of the long computation times for some crane systems that render the practical application of the algorithm difficult, an approximation procedure is also developed that generates good results in reasonable time and hence allows for real‐time application at a container terminal.