Online rules for container stacking

Abstract

Container stacking rules are an important factor in container terminal efficiency. In this paper, we investigate two concepts to increase efficiency and compare them to several benchmark algorithms, using a discrete-event simulation tool. The first concept is to use knowledge about container departure times, in order to limit the number of reshuffles. We stack containers leaving shortly before each other on top of each other. The second concept is the trade-off between stacking further away in the terminal versus stacking close to the exit points and accepting more reshuffles. It is concluded that even the use of imperfect or imprecise departure time information leads to significant improvements in efficiency. Minimizing the difference in departure times proved to be important. It was also found that the trade-off between stacking further away in the terminal versus stacking close by the exit points and accepting more reshuffles leads to improvements over the benchmark. © 2010 The Author(s).