论文标题
速度优化的多端口泊位分配问题：确切的方法和合作游戏分析
The multi-port berth allocation problem with speed optimization: Exact methods and a cooperative game analysis
论文作者
论文摘要
我们考虑了泊位分配问题的一种变体，即，多端口泊位分配问题是在将泊位时间和位置分配给容器终端中的船只时。该变体涉及优化多个端口之间的船只旅行速度，从而利用运营商（运输线）和终端操作员之间的协作潜力。使用该问题的图表，我们将现有的混合企业问题重新定义为广义的设定分区问题，其中每个变量都指船只访问的端口中的一系列可行泊位。通过在分支和定价过程中集成列的生成和切割分离，我们提出的方法能够在一组基准实例中胜过商业求解器，并更好地适应更大的实例。此外，我们还采用合作游戏理论方法来有效分发潜在协作所产生的节省，并表明运营商和终端运营商都将从合作中受益。
We consider a variant of the berth allocation problem-i.e., the multi-port berth allocation problem-aimed at assigning berthing times and positions to vessels in container terminals. This variant involves optimizing vessel travel speeds between multiple ports, thereby exploiting the potentials of a collaboration between carriers (shipping lines) and terminal operators. Using a graph representation of the problem, we reformulate an existing mixed-integer problem into a generalized set partitioning problem, in which each variable refers to a sequence of feasible berths in the ports that the vessel visits. By integrating column generation and cut separation in a branch-and-cut-and-price procedure, our proposed method is able to outperform commercial solvers in a set of benchmark instances and adapt better to larger instances. In addition, we apply cooperative game theory methods to efficiently distribute the savings resulting from a potential collaboration and show that both carriers and terminal operators would benefit from collaborating.
