支持双向调度的集装箱码头岸桥调度问题约束规划模型

A Constyranit Programming Model for the Quay Crane Scheduling Problem of Supporting Bidirectional Schedules

集装箱码头岸桥调度问题研究如何调度一组岸桥在满足实际约束的情况下尽早完成集装箱船的装卸操作。岸桥调度模型要考虑岸桥冲突、安全间距、就绪时间以及任务优先关系等实际约束才具有实用价值。现有文献求解集装箱码头岸桥调度问题多采用专门设计的启发式算法,目前效率最高的算法仅能求得岸桥单向调度解。本文建立了基于约束规划的支持岸桥双向调度的岸桥调度问题模型,并利用基准测试数据进行测试,与现有启发式算法求解结果进行比较,结果显示约束规划模型具有求解质量好、求解速度快的特性,具备良好的实际应用前景。

The quay crane scheduling problem （QCSP） consists of scheduling discharge and load operations of containers of a containership on a set of deployed quay cranes in such a way that the schedule satisfies some constraints and minimizes the overall completion time. A model for the QCSP should cover important issues of practical relevance like crane interferences, safety requirements, ready times and precedence relations among container groups. Currently, most literature design specific heuristic algorithms to solve the QCSP. The most efficient algorithm available in the literature, to our knowledge, can only solve unidirectional schedules. This paper builds a constraint programming model for the QCSP supporting bidirectional Schedules. Numerical experiments are carried out on sets of benchmark instances taken from the literature. The performance of constraint programming model is assessed by comparing it to all algorithms in the existing literature. The results show that constraint programming model can solve the QCSP with high quality and speed.