Journal
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL
Volume 164, Issue -, Pages 1-24Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.trb.2022.07.009
Keywords
Berth allocation; Distributionally robust optimization; Uncertain handling times; Decomposition algorithm; Wasserstein distance
Ask authors/readers for more resources
This study addresses the berth allocation problem under uncertain handling times, presenting a distributionally robust two-stage model to minimize the worst-case of the expected sum of delays. Solutions are obtained through an exact decomposition algorithm, with adaptations for cases where complete recourse assumptions fail.
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available