基于约束规划建模求解岸桥调度问题

摘要

To solve the Quay Crane Scheduling Problem (QCSP) of large container, a quay crane scheduling constraint programming model by considering the factors such as constraint programming, crane interferences, safety requirements, ready times and precedence relations was proposed. The benchmark data was used to test and the result was compared with the current heuristic algorithm. It showed that constraint programming method could solve QCSP with high quality and fast speed, especially for the solving efficiency of large scale cases.%为求解大规模集装箱码头岸桥调度问题,提出一个基于约束规划并考虑岸桥冲突、安全间距、就绪时间以及任务优先关系等因素的岸桥调度约束规划模型.利用基准测试数据进行实验测试,与现有启发式算法的求解结果进行比较,结果显示约束规划求解结果具有求解质量好、求解速度快的特性,特别是针对大规模实例的求解效率优势较明显.