Please use this identifier to cite or link to this item:
Title: Distributionally robust optimization for the berth allocation problem under uncertainty
Author: Agra, Agostinho
Rodrigues, Filipe
Keywords: Berth allocation
Distributionally robust optimization
Uncertain handling times
Decomposition algorithm
Wasserstein distance
Issue Date: Oct-2022
Publisher: Elsevier
Abstract: Berth allocation problems are amongst the most important problems occurring in port terminals, and they are greatly affected by several unpredictable events. As a result, the study of these problems under uncertainty has been a target of more and more researchers. Following this research line, we consider the berth allocation problem under uncertain handling times. A distributionally robust two-stage model is presented to minimize the worst-case of the expected sum of delays with respect to a set of possible probability distributions of the handling times. The solutions of the proposed model are obtained by an exact decomposition algorithm for which several improvements are discussed. An adaptation of the proposed algorithm for the case where the assumption of relatively complete recourse fails is also presented. Extensive computational tests are reported to evaluate the effectiveness of the proposed approach and to compare the solutions obtained with those resulting from the stochastic and robust approaches.
Peer review: yes
DOI: 10.1016/j.trb.2022.07.009
ISSN: 0191-2615
Appears in Collections:CIDMA - Artigos
OGTCG - Artigos

Files in This Item:
File Description SizeFormat 
DRO_ria.pdfManuscript752.71 kBAdobe PDFView/Open

Formato BibTex MendeleyEndnote Degois 

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