Berth allocation at indented berths for mega-containerships
Berth allocation at indented berths for mega-containerships
复制标题
DOI：
10.1016/j.ejor.2006.03.034
复制
发表时间：
2007-06-01
影响因子：
6.4
通讯作者：
Papadimitriou, Stratos
中科院分区：
文献类型：
--
作者：
Imai, Akio;Nishimura, Etsuko;Papadimitriou, Stratos
本文解决了多用户集装箱码头的泊位分配问题，该码头具有锯齿状泊位，可快速装卸巨型集装箱船。在作者之前进行的一项研究中，传统形式的多用户终端的泊位分配问题被表述为非线性数学规划，其中如果满足泊位和船舶长度限制，则允许多于一艘的船舶停泊在特定泊位上。在本文中，我们首先构建了一个新的整数线性规划公式以方便计算，然后将该公式扩展为对具有锯齿状泊位的码头的泊位分配问题进行建模，其中巨型集装箱船和支线船舶都将服务于更高的泊位生产率。采用遗传算法解决了缩进泊位的泊位分配问题。进行了各种各样的数值实验并探索了有趣的发现。 (c) 2006 Elsevier B.V. 保留所有权利。
This paper addresses the berth allocation problem at a multi-user container terminal with indented berths for fast handling of mega-containerships. In a previous research conducted by the authors, the berth allocation problem at a conventional form of the multi-user terminal was formulated as a nonlinear mathematical programming, where more than one ship are allowed to be moored at a specific berth if the berth and ship lengths restriction is satisfied. In this paper, we first construct a new integer linear programming formulation for easier calculation and then the formulation is extended to model the berth allocation problem at a terminal with indented berths, where both mega-containerships and feeder ships are to be served for higher berth productivity. The berth allocation problem at the indented berths is solved by genetic algorithms. A wide variety of numerical experiments were conducted and interesting findings were explored. (c) 2006 Elsevier B.V. All rights reserved.