Exact and heuristic methods to solve the berth allocation problem in bulk ports
Exact and heuristic methods to solve the berth allocation problem in bulk ports
复制标题
DOI：
10.1016/j.tre.2013.03.003
复制
发表时间：
2013-08
影响因子：
10.6
通讯作者：
Nitish Umang;M. Bierlaire;Ilaria Vacca
中科院分区：
文献类型：
--
作者：
Nitish Umang;M. Bierlaire;Ilaria Vacca
本文研究了散货港口中以最小化船舶总服务时间为目标的动态混合泊位分配问题。我们提出了两个精确的方法，基于混合整数规划和广义集划分，和一个启发式方法的基础上吱吱轮优化，明确考虑货物类型的船只。通过大量的数值实验的基础上启发从真实的散装港口数据的情况下，公式进行了比较。结果表明，集合划分方法和启发式方法可以用来获得更大的问题规模的近优解。
In this paper, we study the dynamic hybrid berth allocation problem in bulk ports with the objective to minimize the total service times of the vessels. We propose two exact methods based on mixed integer programming and generalized set partitioning, and a heuristic method based on squeaky wheel optimization, explicitly considering the cargo type on the vessel. The formulations are compared through extensive numerical experiments based on instances inspired from real bulk port data. The results indicate that the set partitioning method and the heuristic method can be used to obtain near-optimal solutions for even larger problem size.