摘要
岸吊作业调度对集装箱码头整体运营效率具有重要影响。综合考虑岸吊实际作业中的特有约束,包括预定义顺序约束、依赖于作业次序的设备调整时间、岸吊干涉约束,建立岸吊作业调度问题的混合整数规划模型。针对混合装卸模式,使用启发式算法生成预定义作业顺序,在此基础上采用基于连续贝作业策略的启发式算法对问题进行求解。数据实验结果显示基于SPT规则和连续贝作业的启发式算法能有效利用混合装卸带来的时间节省,减少设备调整时间,对实际岸吊作业调度具有指导意义。
The quay crane operation scheduling is vital to container terminal efficiency. A MIP model for quay crane operation scheduling problem is established, considering the pre-defined precedence among tasks to be processed, the sequence-dependent setup time and non-interference constraints among quay cranes. Under the mode of simultaneous loading and discharging operation,using heuristic to generate the predefined precedence, a heuristic algorithm based on continuous bay processing strategy is proposed to solve the scheduling problem. The numerical experiment shows that the continuous bay processing algorithm adopting SPT rule can effectively utilize the time savings from simultaneous loading and discharging operation and reduce the quay crane setup time. Hence, it is constructive for practical quay crane scheduling.
出处
《工业工程与管理》
北大核心
2009年第5期20-26,共7页
Industrial Engineering and Management
基金
国家自然科学基金资助项目(70771065)
上海市浦江人才计划科研项目资助(07PJ14052)
关键词
集装箱码头
岸吊作业调度
混合装卸
启发式算法
container terminal
quay crane scheduling
simultaneous loading and discharging
heuristic algorithms