Mathematical model and algorithm for the berth and yard resource allocation at seaports

We study a deterministic container transportation problem, jointly optimizing the berth allocation, quay crane assignment and yard storage allocation at container ports. The problem is formulated as an integer program to coordinate the decisions. To solve this large-scale problem, we then transform it into a set partitioning formulation, and provide a framework of branch-and-price algorithm.