.png){kind=icon}
返回
Distributionally robust optimization for the berth allocation problem under uncertainty
.png){kind=icon}
OA
AI
DOI：10.1016/j.trb.2022.07.009.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Berth allocation
Distributionally robust optimization
Uncertain handling times
Decomposition algorithm
Wasserstein distance
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.3
论文数:
3.6K
被引数:
1.9W
机构
引用论文
.png){kind=icon}
Reactive strategy for discrete berth allocation and quay crane assignment problems under uncertainty
PREAI
分享收藏
查看更多内容