MILP models for the continuous Berth Allocation and Quay Crane Assignment Problem considering crane movement and setup times

In this technical report we present several Mixed Integer Linear Programming (MILP) models for the Berth Allocation and Quay Crane Assignment Problem (BACASP) considering crane movement and setup time (from now on: BACASP-S). First, we propose a MILP for the continuous-quay time-invariant BACASP in which both berthing time and position variables are continuous. Then, we extend this MILP to take into account crane movement and setup times. Finally, we also propose a MILP for the continuous variable-in-time BACASP-S with both continuous time and space variables.

Citation

Technical Report published in optimization.online.org, 20 August 2021.

Article

Download

View PDF