Strategic allocation of cyclically arriving container vessels to inter-related terminals

In this paper we consider a port consisting of a cluster of inter-related terminals, where container vessels arrive cyclically. The problem is to strategically assign a terminal and a time interval of berthing to each of the vessels in the cycle. Restricting properties are terminal quay lengths and quay crane capacity. Conflicting objectives are i) minimizing the number of required quay cranes, ii) minimizing the amount of inter-terminal traffic and iii) minimizing the total weighted deviation from desired berthing intervals. We formulate both a straightforward and an alternative mixed integer linear program to model this system. Results show that the alternative model is much faster solvable and enables to optimize real-life problems within a couple of hours