Unidirectional quay crane scheduling problems solving by combination of mixed integer programming and constraint programming

摘要

To tackle the unidirectional quay crane scheduling problems in container terminals, a novel constraint programming model was proposed which not only considered the common quay crane constraints such as crane interference, safety margin requirement, ready time and precedence relationship, but also considered the initial blocking often ignored by most of the literature. To improve the solving performance further, a solving procedure combining mixed integer programming and constraint programming was put forward. By using an example test, the advantage of combination method's solving performance than constraint programming method was proved. To further explore the potential of optimization, another combination solving strategy for bi-objective optimization was proposed, which could improve the total completion time on the basis of optimizing the makespan.

关键词