This study proposes a berth-flow network modeling approach to deal with the dynamic berth allocation problem (DBAP) with stochastic vessel arrival times. In this approach, uncertain vessel arrival times are represented using discrete probability distributions and a flexible berth allocation scheme based on the blocking plan concept is incorporated into the model to effectively utilize wharf space. This new model is referred to as the stochastic dynamic (vessel arrival) and flexible (berth space) berth allocation problem (SDFBAP) model. The aim is to minimize the sum of the expected values of unanticipated schedule delay costs and the penalties for being unable to service all vessels within the planning horizon. The proposed model is formulated as an integer multi-commodity network flow problem which can be solved with off-the-shelf solvers. Computational experiments are conducted using a real example to demonstrate the effectiveness and efficiency of the SDFBAP model. A simulation-based approach is adopted to evaluate the SDFBAP model. A number of scenario analyses are also conducted to gain insight into important model parameters.

中文翻译：

---

具有随机船只到达时间的动态灵活泊位分配模型

这项研究提出了一种泊位流网络建模方法来处理具有随机船只到达时间的动态泊位分配问题（DBAP）。在这种方法中，使用离散的概率分布表示不确定的船只到达时间，并将基于阻塞计划概念的灵活泊位分配方案纳入模型中，以有效利用码头空间。此新模型​​称为随机动态（船只到达）和灵活（泊位空间）泊位分配问题（SDFBAP）模型。目的是最大程度地减少计划外延误成本的预期值与无法为计划范围内的所有船舶提供服务的罚款之和。所提出的模型被公式化为整数多商品网络流量问题，可以使用现成的求解器解决。使用一个真实的例子进行了计算实验，以证明SDFBAP模型的有效性和效率。采用基于仿真的方法评估SDFBAP模型。还进行了许多方案分析，以深入了解重要的模型参数。