MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem

摘要

In this paper we consider an integrated berth allocation and quay crane assignment and scheduling problem motivated by a real casewhere a heterogeneous set of cranes is considered.A first mathematical model based on the {it relative position formulation} (RPF) for the berth allocation aspects is presented. Then, a new model is introduced to avoid the big-M constraints included in the RPF. This model results from a discretization of the time and space variables.For the new discretized model several enhancements, such as valid inequalities, are introduced.In order to derive good feasible solutions, a rolling horizon heuristic (RHH) is presented.A branch and cut approach that uses the enhanced discretized model andincorporates the upper bounds provided by the RHH solution is proposed.Computational tests are reported to show (i) the quality of the linear relaxation of the enhanced models; (ii)the effectiveness of the exact approach to solve to optimality a set of real instances;and (iii) the scalability of the RHH based on the enhanced mathematical model which isable to provide good feasible solutions for large size instances.