基于遗传算法的泊位连续化动态调度研究  

Research of Dynamic Berth Allocation of Continuous Case Based on GA

作　　者：张煜[1] 王少梅[1] 

机构地区：[1]武汉理工大学物流工程学院,湖北武汉430063

出　　处：《系统仿真学报》2007年第10期2161-2164,共4页Journal of System Simulation

基　　金：湖北省重点实验室开放基金资助项目(2005A17)

摘　　要：针对泊位调度问题,将岸线连续化,建立了泊位的动态调度模型。考虑到岸边起重机的分配对泊位调度中船舶的集装箱装卸作业时间的影响,根据规则建立了分配岸边起重机和确定船舶集装箱装卸作业时间的算法。基于泊位连续化动态调度模型建立了分段的染色体编码,分别反映船舶靠泊服务顺序和靠泊位置信息。基于实例,通过仿真计算,与泊位离散化动态调度进行了比较和分析。A berth dynamic scheduling model for berth continuous case was proposed. According to the effect that quay cranes allocation has on ship container handling time, an algorithm of assigning quay cranes and ship containers handling time based on rules was developed, The chromosomes with two blocks based on the berth continuous dynamic scheduling model were coded. The chromosomes represented ship service sequence and location information respectively. The simulation results based on real case were analyzed and compared with the berth discrete dynamic scheduling,

关 键 词：集装箱码头 岸桥规划 泊位连续化 泊位动态调度 遗传算法 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]