BERTH ALLOCATION IN A CONTAINER PORT: USING A CONTINUOUS LOCATION SPACE APPROACH
BERTH ALLOCATION IN A CONTAINER PORT: USING A CONTINUOUS LOCATION SPACE APPROACH
复制标题
DOI：
10.1016/j.trb.2004.04.004
复制
发表时间：
2005-03
影响因子：
6.8
通讯作者：
A. Imai;Xinyu Sun;E. Nishimura;Stratos Papadimitriou
中科院分区：
文献类型：
--
作者：
A. Imai;Xinyu Sun;E. Nishimura;Stratos Papadimitriou
研究多用户集装箱码头泊位分配问题。泊位分配有两种典型的方案：一种是离散位置，另一种是连续位置。前者具有易于调度的优点，但是其缺点在于终端使用不是完全有效的。后者表现出完全相反的特征。在以前的论文中，作者已经开发并提出了离散位置版本的泊位分配问题。鉴于集装箱船舶尺寸不断增大的趋势，更灵活的泊位分配规划是强制性的，特别是在各种尺寸的船舶停靠的忙碌枢纽港。本文提出了一种求解连续位置泊位分配问题的启发式算法。进行了各种各样的实验，结果表明，启发式工程以及从实用的角度来看。
This paper addresses the berth allocation problem in a multi-user container terminal. There are two typical schemes for berth allocation: one in discrete locations and the other in continuous locations. The former has the advantage of easiness in scheduling but it has a weakness in that terminal usage is not fully efficient. The latter exhibits the complete opposite characteristics. In previous papers, the authors have developed and presented the discrete location version of the berth allocation problem. In view of the steadily growing trend in increasing the container ship size, more flexible berth allocation planning is mandatory, especially in busy hub ports where ships of various sizes are calling. In this paper, a heuristic for the berth allocation problem in continuous locations is presented. A wide variety of experiments were conducted and the results showed that the heuristic works well from a practical point of view.