具有岸桥碰撞和甲板约束的岸桥混合装卸作业调度优化  

Modeling and Optimizing Quay Crane Scheduling Problem with Deck and Crane Constraints in the Mixed Loading and Discharging Operations

作　　者：李晨[1] 陆志强[1] 陈璐[1] 

机构地区：[1]上海交通大学机械与动力工程学院

出　　处：《上海交通大学学报》2010年第8期1159-1164,共6页Journal of Shanghai Jiaotong University

基　　金：国家自然科学基金资助项目(70771065,70802040);国家高技术研究发展计划(863)重点项目(2009AA043000,2009AA043001)

摘　　要：针对具有岸桥间不可相互穿越及安全距离约束、甲板开闭约束的集装箱码头岸桥混合装卸作业的调度优化问题,分析了岸桥装卸与移动过程中的相关性质,并提出一种基于减小岸桥移动距离和均匀化岸桥负荷的启发式算法.在该算法基础上设计了一种遗传算法,进一步搜索最优解,并推导了问题的一个低界.数据实验表明,所提出算法的解具有良好的质量和较高的时间效率.The quay crane scheduling problem studied in this paper is to determine an assignment and a（handling） sequence of bays for quay cranes,considering the interference between quay cranes and the deck（constraints.） A mixed integer programming is proposed and some properties of the problem are deduced.A genetic algorithm is designed to obtain the near optimal solutions.A lowerbound is given to evaluate the effectiveness of the proposed algorithm.Computational experiments are conducted and it is shown that the proposed algorithm is effective and efficient in solving the problem.

关 键 词：集装箱码头 调度 混合装卸 遗传算法 

分 类 号：U691[交通运输工程—港口、海岸及近海工程]