堆区混贝的堆场场吊调度模型与算法  

Model and algorithm for yard crane scheduling problem in a mixed stacking block

作　　者：王展[1] 陆志强[1] 潘尔顺[1] 

机构地区：[1]上海交通大学机械与动力工程学院机械系统与振动国家重点实验室,上海200240

出　　处：《系统工程理论与实践》2012年第1期182-188,共7页Systems Engineering-Theory & Practice

基　　金：国家自然科学基金(70771065;70802040)

摘　　要：为提高集装箱码头堆场场吊作业效率,研究了堆场单堆区混贝条件下的场吊调度问题.在单堆区内集装箱混贝堆放的前提下,提出了堆场场吊装卸作业时间窗约束、作业次序依赖的设备调整时间及堆场空间约束等,并在此基础上建立了整数规划模型.针对这一模型设计了改进禁忌搜索算法对问题进行求解.最后通过数值实验表明改进后的算法在对大规模问题求解时具有良好的效果,且算法效率较高.To improve the operation efficiency of container terminals, the yard crane scheduling problem in one mixed stacking block is studied in this paper. In one mixed stacking block, the container operation time windows constraint, sequence-depended setup time for yard crane and storage space constraint for containers are defined and an integer programming model is proposed for the yard crane scheduling problem. A improved tabu search heuristic algorithm is developed and the numerical experiments show the algorithm effective and efficient, particularly when large-scale problems.

关 键 词：堆场场吊调度 堆位分配 整数规划 改进禁忌搜索算法 

分 类 号：TP29[自动化与计算机技术—检测技术与自动化装置] U691[自动化与计算机技术—控制科学与工程]