桥吊可动态分配的连续泊位分配问题算法

计算机应用 ›› 2012, Vol. 32 ›› Issue (05): 1453-1456.

桥吊可动态分配的连续泊位分配问题算法

陈雪莲,杨智应

上海海事大学信息工程学院，上海201306

收稿日期:2011-10-21 修回日期:2011-12-09 发布日期:2012-05-01 出版日期:2012-05-01
通讯作者: 陈雪莲
作者简介:陈雪莲（1987-），女，江苏盐城人，硕士研究生，主要研究方向：算法设计与分析；杨智应（1964-），男，广西钟山人，教授，博士，CCF会员，主要研究方向：算法设计与分析、在线算法、计算经济学。
基金资助:
上海市科委创新项目(08170511300);上海海事大学校基金资助项目(2009445654)

Algorithm for continuous berth allocation based on dynamically allocated quay crane

CHEN Xue-lian,YANG Zhi-ying

College of Information Engineering, Shanghai Maritime University, Shanghai 201306, China

Received:2011-10-21 Revised:2011-12-09 Online:2012-05-01 Published:2012-05-01
Contact: CHEN Xue-lian

摘要/Abstract

摘要： 研究在允许桥吊动态分配的情况下集装箱码头的连续泊位动态分配问题，并建立以船舶在港时间最小为目标的动态泊位分配模型；然后基于兄弟—儿子方法对船舶的位置进行调整以规划桥吊使桥吊不交叉。在相同算例下，比现有方法得到的船舶在港时间更少，从而验证了模型及算法的有效性。

关键词: 连续泊位, 桥吊动态分配, 动态泊位分配, 规划桥吊, 不交叉桥吊

Abstract: In this paper, the authors studied the continuous berth allocation problem for the container terminals with assumption of quay crane being dynamically allocated and establish a dynamic berth allocation scheme for minimizing vessel's time in port.Based on brother-son method, an algorithm was developed to solve the berth allocation problem with presetting the position of the vessels and quay crane being dynamically allocated in the right position without crossing. In comparison to the existing method，the method can reduce the vessel's time with the same example, which show that the proposed model and algorithm are more efficient.

Key words: continuous berth, quay crane dynamic allocation, berth dynamic allocation, planning quay crane, uncross quay crane

中图分类号:

U651

陈雪莲杨智应. 桥吊可动态分配的连续泊位分配问题算法[J]. 计算机应用, 2012, 32(05): 1453-1456.

CHEN Xue-lian YANG Zhi-ying. Algorithm for continuous berth allocation based on dynamically allocated quay crane[J]. Journal of Computer Applications, 2012, 32(05): 1453-1456.

参考文献

［1］CHRISTIAN B, FRANK M. A survey of berth allocation and quay crane scheduling problems in container terminals ［J］. European Journal of Operational Research, 2010，202(3): 615-627.

［2］EDMOND E D, MAGGS R P. How useful are queue models in port investment decisions for container berths ［J］. Journal of the Operational Research Society, 1978, 19(8):741-750.

［3］LEGATO P, MAZZA R M. Berth planning and resources optimization at a container terminal via discrete event simulation ［J］. European Journal of Operational Research, 2001, 133(3):537-547.

［4］IMAI A, NAGAIWA K, TAT C W. Efficient planning of berth allocation for container terminals in Asia ［J］. Journal of Advanced Transportation, 1997, 31(1):75-94.

［5］IMAI A, NISHIMURA E, PAPADIMITRIOU S. The dynamic berth allocation problem for a container port ［J］. Transportation Research Part B, 2001，34(4）:401-417.

［6］黄晓鸣,徐小义. 排队论在港口规划设计中的应用［J］. 青岛大学学报,1996,11(3)：59-62.

［7］鲁子爱. 港口服务系统仿真与港口规模优化研究［D］. 南京：河海大学,2002.

［8］张煜,王少梅. 基于遗传算法的泊位连续化动态调度研究［J］. 系统仿真学报, 2007, 19(10): 2161-2164.

［9］PARK Y M, KIM K H. A scheduling method for berth and quay cranes ［J］. OR Spectrum, 2003, 25(1):1-23.

［10］IMAI A, CHEN H C, NISHIMURA E, et al. The simultaneous berth and quay crane allocation problem ［J］. Transportation Research Part E, 2008, 44(5):900-920.

［11］LIANG C, HUANG Y, YANG Y. A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning ［J］.Computers and Industrial Engineering, 2009, 56(3):1021-1028.

［12］韩晓龙,丁以中. 集装箱港口泊位配置优化［J］.系统管理学报, 2006, 15(3):275-278.

［13］周鹏飞,康海贵. 面向随机环境的集装箱码头泊位—岸桥分配方法［J］. 系统工程理论与实践, 2008,28(1): 161-168.

［14］韩骏,孙晓娜,靳志宏. 集装箱码头泊位与岸桥协调调度优化［J］. 大连海事大学学报, 2008, 34(2): 117-121.

［15］SCHEITHAUER G. Algorithms for the container loading problem ［C］ // Operations Research Proceedings. Berlin:Springer, 1991:445-452.

[1]	毛敏俐, 梁承姬, 胡筱渊. 基于船时效率的岸桥配置优化[J]. 计算机应用, 2020, 40(4): 1223-1230.
[2]	肖玲胡志华. 基于滚动策略的集装箱码头连续泊位与桥吊集成调度[J]. 计算机应用, 2013, 33(10): 2969-2973.