摘要
为求解大规模集装箱码头岸桥调度问题,提出一个基于约束规划并考虑岸桥冲突、安全间距、就绪时间以及任务优先关系等因素的岸桥调度约束规划模型。利用基准测试数据进行实验测试,与现有启发式算法的求解结果进行比较,结果显示约束规划求解结果具有求解质量好、求解速度快的特性,特别是针对大规模实例的求解效率优势较明显。
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.
出处
《计算机集成制造系统》
EI
CSCD
北大核心
2013年第1期181-186,共6页
Computer Integrated Manufacturing Systems
基金
国家自然科学基金资助项目(71172076)
交通部应用基础研究资助项目(2011-329-810-450)
上海市科委地方院校专项资助项目(11510501800)
上海市教委科研创新资助项目(11YZ135)
上海市重点学科建设资助项目(S30601)~~
关键词
岸桥调度
集装箱码头
约束规划
混合整数规划
quay crane scheduling
container terminal
constraint programming
mixed integer programming
