Modelling and optimisation of online container stacking with operational constraints

Abstract

Container transportation plays a critical role in the global shipping network and container terminals need to improve their operations to increase efficiency. Storage yard of a container terminal is a temporary area where the containers stay until they are shipped to their next destination. We concentrate on increasing the efficiency of the storage yard by developing online stacking policies for each incoming container. An unproductive move of a container performed to reach another container stored underneath is called reshuffling. The objective in container stacking problem is to minimise the number of reshuffles thereby increasing the efficiency of terminal operations. Additional weight-related operational constraints bring additional complexity to the online stacking decisions. We propose a mathematical model for the optimal online assignment of an incoming export transit import or empty container. We also propose an optimal online stacking policy and compare it with a random policy through simulation. Additionally lower bounds for the performance measures are obtained through simulation by relaxing the operational constraints of the problem in a third stacking policy. We present and discuss the computational results in terms of four main performance measures.