We consider a variant of the berth allocation problem—that is, multiport problem—aimed at assigning berthing times and positions to vessels in container terminals. This involves optimizing vessel travel speeds between multiple ports, thereby exploiting potentials collaboration carriers (shipping lines) terminal operators. Using graph representation problem, we reformulate an existing mixed-inte...

In this work, we focus on the integrated planning of the following problems faced within the context of seaside operations at container terminals: berth allocation, quay crane assignment, and quay crane scheduling. First, we formulate a new binary integer linear program for the integrated solution of the berth allocation and quay crane assignment problems called BACAP. Then we extend it by inco...

• The BAP and the Quay Cranes Assignment Problem is studied. A mixed integer linear programming model developed. An efficient construction heuristics are proposed. metaheuristic approach designed. Experimental results demonstrate effectiveness of proposal. Berth Allocation two decisive seaside operations planning problems in maritime terminals. Therefore, integrating these critical improving an...

We focus on the integrated seaside operations in container terminals, namely the integration of berth allocation, quay crane assignment and quay crane scheduling problems. We first develope a mixed-integer linear programming formulation. Then, we propose an efficient cutting plane algorithm based on a decomposition scheme. Our approach deals with berthing positions of the vessels and their assi...

This paper elaborates the different operations research methods used to solve container terminal operational decisions including terminal design, berth allocation, quay crane assignment, quay crane scheduling, container storage space allocation, container location assignment, retrieval, and premarshalling, as well as resource scheduling and terminal logistics in general. Solution methods includ...