Berth scheduling by simulated annealing
Berth scheduling by simulated annealing
复制标题
DOI：
10.1016/s0191-2615(02)00027-9
复制
发表时间：
2003-07
影响因子：
6.8
通讯作者：
Kap-Hwan Kim;Kyungduk Moon
中科院分区：
文献类型：
--
作者：
Kap-Hwan Kim;Kyungduk Moon
泊位调度问题的目标是确定集装箱船舶在港口集装箱码头的靠泊时间和靠泊位置。每艘船舶都需要在码头上有一定的空间，并在预定的时间内装卸集装箱。在这项研究中，一个混合整数线性规划（MIP）模型制定的泊位调度问题。将模拟退火算法应用于船舶泊位调度问题，以寻找近似最优解。实验结果表明，模拟退火算法得到的解与MIP模型得到的最优解相似。
The objective of the berth-scheduling problem is to determine the berthing times and positions of containerships in port container terminals. Every vessel requires a specific amount of space in a wharf for a predetermined length of time to unload and load containers. In this study, a mixed-integer-linear-programming (MIP) model was formulated for the berth-scheduling problem. The simulated annealing algorithm was applied to the berth-scheduling problem to find near-optimal solutions. Experimental results showed that the simulated annealing algorithm obtains solutions that are similar to the optimal solutions found by the MIP model.