| 桥吊可动态分配的连续泊位分配问题算法 |
| |
| 引用本文： | 陈雪莲,杨智应.桥吊可动态分配的连续泊位分配问题算法[J].计算机应用,2012,32(5):1453-1456. |
| |
| 作者姓名： | 陈雪莲 杨智应 |
| |
| 作者单位： | 上海海事大学 信息工程学院，上海201306 |
| |
| 基金项目： | 上海市科委创新项目(08170511300);上海海事大学校基金资助项目(2009445654) |
| |
| 摘 要： | 研究在允许桥吊动态分配的情况下集装箱码头的连续泊位动态分配问题，并建立以船舶在港时间最小为目标的动态泊位分配模型；然后基于兄弟-儿子方法对船舶的位置进行调整以规划桥吊使桥吊不交叉。在相同算例下，比现有方法得到的船舶在港时间更少，从而验证了模型及算法的有效性。
|
| 关 键 词： | 连续泊位 桥吊动态分配 动态泊位分配 规划桥吊 不交叉桥吊 |
| 收稿时间： | 2011-10-21 |
| 修稿时间： | 2011-12-09 |
Algorithm for continuous berth allocation based on dynamically allocated quay crane |
| |
| CHEN Xue-lian
,
YANG Zhi-ying.Algorithm for continuous berth allocation based on dynamically allocated quay crane[J].journal of Computer Applications,2012,32(5):1453-1456. |
| |
| Authors: | CHEN Xue-lian YANG Zhi-ying |
| |
| Affiliation: | College of Information Engineering, Shanghai Maritime University, Shanghai 201306, China |
| |
| 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. |
| |
| Keywords: | continuous berth quay crane dynamic allocation berth dynamic allocation planning quay crane uncross quay crane |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用》浏览原始摘要信息 |
|
点击此处可从《计算机应用》下载全文 |
