具有速度optimization的多港口泊位分配问题：精确方法和合作对策分析
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
