Please use this identifier to cite or link to this item: http://hdl.handle.net/10773/18404
Title: MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem
Author: Agostinho Agra
Oliveira, Maryse
Keywords: Berth allocation
Quay crane scheduling
Mixed integer formulations
Branch and cut
Rolling horizon heuristic
Issue Date: Jan-2018
Publisher: Elsevier
Abstract: In this paper we consider an integrated berth allocation and quay crane assignment and scheduling problem motivated by a real case where 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 and incorporates 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 is able to provide good feasible solutions for large size instances.
Peer review: yes
URI: http://hdl.handle.net/10773/18404
DOI: 10.1016/j.ejor.2017.05.040
ISSN: 0377-2217
Appears in Collections:CIDMA - Artigos

Files in This Item:
File Description SizeFormat 
BACASP_Ria.pdfMain article387.26 kBAdobe PDF    Request a copy


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.