摘要
集装箱码头资源(包括泊位、桥吊、堆场等)的高效利用已经被深入研究很多年了,然而对于泊位分配中桥吊分配的研究大多停留在静态分配最大数量桥吊上。为了弥补静态分配桥吊的不足,第一次研究了基于两船之间桥吊迁移的泊位分配问题,通过桥吊迁移的决策方法,最终设计出了一个新的泊位分配算法。实验证实设计的算法能更好地提高码头作业效率,表明了桥吊迁移在港口作业中的有效性。
The berth allocation problem has been studied extensively and much research progresses have been made. Howe- ver, the existing algorithms are mainly developed to figure out the vessel's best quay crane ( Qc ) allocation. To remedy the situation, this paper first studied quay cranes transfer between two vessels. Based on the strategy of deciding whether to trans- fer QCs or not in different conditions, it designed an algorithm for continuous berth allocation. The compare of the new algo- rithm and another existing algorithm shows that the new improves quay' s work efficiency.
出处
《计算机应用研究》
CSCD
北大核心
2013年第10期2972-2976,共5页
Application Research of Computers
基金
上海海事大学校基金资助项目(2009445654)
关键词
集装箱码头
桥吊迁移
连续泊位
不满意度
泊位分配算法
container terminal
quay cranes transfer
continuous berth
dissatisfaction
berth allocation algorithm