Container storage with block sizing

Abstract

This paper addresses the storage planning problem of transshipment containers which are handled at a megaport, and suggests a solution procedure for optimal handling. The contribution of this paper is that we consider the storage problem at a terminal where a mega-containership calls generating a container flow from one ship to others. We have defined the total service time for an arriving ship during the relevant planning period as the objective function to be minimised. From the results, it is learned that there is no significant difference in berthing positions between a continuous and discrete approach. Furthermore, a larger number of sections /berth leads to a shorter service time. It is expected but also confirmed by the experiments that shorter average inter-arrival times of ships lead to longer service times because more ships arrive during the planning period. These results appear under the condition of su cient capacity for the whole yard space.