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

被引:6
作者
陈雪莲
杨智应
机构
[1] 上海海事大学信息工程学院
关键词
连续泊位; 桥吊动态分配; 动态泊位分配; 规划桥吊; 不交叉桥吊;
D O I
暂无
中图分类号
U691 [港口工作组织];
学科分类号
摘要
研究在允许桥吊动态分配的情况下集装箱码头的连续泊位动态分配问题,并建立以船舶在港时间最小为目标的动态泊位分配模型;然后基于兄弟—儿子方法对船舶的位置进行调整以规划桥吊使桥吊不交叉。在相同算例下,比现有方法得到的船舶在港时间更少,从而验证了模型及算法的有效性。
引用
收藏
页码:1453 / 1456
页数:4
相关论文
共 16 条
[1]   The dynamic berth allocation problem for a container port [J].
Imai, A ;
Nishimura, E ;
Papadimitriou, S .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2001, 35 (04) :401-417
[2]  
A survey of berth allocation and quaycrane scheduling problems in container terminals. CHRISTIAN B,FRANK M. EuropeanJournal of Operational Research . 2010
[3]  
Berth planning and resourcesoptimization at a container terminal via discrete event simulation. Legato Pasquale, Mazza Rina M. Europe Journal of Operational Research . 2001
[4]  
The dynamic berth allocation problem for a container port. Imai A, Nishimura E, Papadimitriou S. Transportation Research . 2001
[5]  
A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning. Chengji Liang,Youfang Huang,Yang Yang. Computers and Industrial Engineering . 2009
[6]  
How useful are queue models in port investment decisions for container berths. Edmond E D,Maggs R P. Journal ofthe Operational Research Society . 1978
[7]  
Efficient planning of berth allocation for container terminals in Asia. Imai A, Ken’Ichiro Nagaiwa, Chan Weng Tat. Journal of Advanced Transportation . 1997
[8]  
Algorithms for the container loading problem. SCHEITHAUER G. Operations Research Proceedings . 1991
[9]  
The simultaneous berth and quay crane allocation problem. Imai A,Chen H C,Nishimura E,et al. Transportation Research . 2008
[10]   集装箱码头泊位与岸桥协调调度优化 [J].
韩骏 ;
孙晓娜 ;
靳志宏 .
大连海事大学学报, 2008, (02) :117-121