A MATHEMATICAL MODEL AND SOLUTION METHOD FOR THE BERTH ALLOCATION PROBLEM WITH VARIABLE HANDLING TIME AND CONTINUOUS TIME HORIZON

. In this paper, we present the integration of two problems related to the operations in a port terminal: the Berth Allocation Problem (BAP) integrated with the Machine Assignment Problem. We present a mixed-integer linear programming (MILP) formulation, capable of assigning and scheduling incoming vessels to berthing positions and the assignment of machines for handling the vessels. The machines can be quay cranes, mobile cranes, straddle carriers, forklifts, trucks, and any other machine. The problem aims to minimize the waiting time plus the handling time of the vessels. To solve the problem, we developed a heuristic algorithm, capable of solving a problem instance in seconds. To compare the results, we generate several instance problems based on real data and solve them with our MILP formulation implemented in a solver, our heuristic, and a First In First Out (FIFO) algorithm. The solver was able to find solutions only in small-scale instances, and the heuristic was able to find good solutions for all instances.