计算机集成制造系统

• 产品创新开发技术 • 上一篇    下一篇

组合MIP与CP求解单向岸桥调度问题

秦天保,沙梅   

  1. 上海海事大学交通运输学院
  • 出版日期:2013-07-18 发布日期:2013-07-18

Solving the unidirectional quay crane scheduling problems based on the combination of mixed integer programming and constraint programming

  • Online:2013-07-18 Published:2013-07-18

摘要: 针对解集装箱码头单向岸桥调度问题,提出了一个新的约束规划模型,该模型不仅考虑了常见的岸桥跨越冲突、安全间距、就绪时间以及任务优先关系等约束,还考虑了以往多数文献忽视的岸桥初始阻塞现象。为进一步提升求解性能,设计了一个组合混合整数规划与约束规划求解的流程,利用一组通用算例进行的测试实验显示组合方法的求解性能超过单独使用约束规划的求解性能。为进一步挖掘优化潜力,还设计了另一个组合混合整数规划与约束规划进行双目标优化的流程,在优化第一目标完工时间的基础上,进一步优化第二目标总完工时间,实验结果显示双目标优化方案能够对第二目标做出一定程度的改进。

关键词: 岸桥调度, 集装箱码头, 约束规划, 混合整数规划

Abstract: To tackle the unidirectional quay crane scheduling problems in container terminals,a novel constraint programming model is proposed which considers initial blocking of quay cranes which is often ignored by most of the literature.In addition,other practical constraints such as crane interference,safety margin requirement,ready time and precedence relationship,etc.,are all considered in the model.To improve the solving performance further,a solving procedurecombining mixed integer programming and constraint programming is put forward.The test results of a commonly accepted benchmark suite indicate that the combination solving strategy outperforms the constraint programming method.To further explore the potential of optimization,another combination solving strategy for bi-objective optimization is proposed,which can improve the total completion time on the basis of optimizing the makespan.

Key words: quay cranescheduling, container terminal, constraint programming, mixed integer programming

中图分类号: