Motivated by the operation of bulk terminal in the Pearl River Delta, we study a berth allocation problem (BAP) with 2 berths and overall quay length constraint. The quay length occupied by a vessel depends on its berthing directions. The feasible berthing direction changes in a tide cycle. The objective is to minimize the total service of all vessels. We develop a mixed integer programming (MIP) model for the problem. We also propose an efficient genetic algorithm to tackle the problem. Our computational experiments show that the mixed integral programming model can only be solved by CPLEX for small-size instances, the genetic algorithm obtains good approximation solutions for large-size instances.

中文翻译：

---

码头总长度约束的散货码头泊位分配

受珠江三角洲散货码头运营的启发，我们研究了一个有2个泊位和总码头长度约束的泊位分配问题（BAP）。船舶占用的码头长度取决于其靠泊方向。可行的靠泊方向在潮汐周期中发生变化。目标是尽量减少所有船只的总服务。我们为该问题开发了一个混合整数规划 (MIP) 模型。我们还提出了一种有效的遗传算法来解决这个问题。我们的计算实验表明，混合积分规划模型只能通过CPLEX解决小规模的实例，遗传算法获得了大规模的实例很好的逼近解。