Combined quay crane assignment and quay crane scheduling with crane inter-vessel movement and non-interference constraints

摘要

Integrated models of the quay crane assignment problem (QCAP) and the quay crane scheduling problem (QCSP) exist. However, they have shortcomings in that some do not allow movement of quay cranes between vessels, others do not take into account precedence relationships between tasks, and yet others do not avoid interference between quay cranes. Here, an integrated and comprehensive optimization model that combines the two distinct QCAP and QCSP problems which deals with the issues raised is put forward.The model is of the mixed-integer programming type with the objective being to minimize the difference between tardiness cost and earliness income based on finishing time and requested departure time for a vessel. Because of the extent of the model and the potential for even small problems to lead to large instances, exact methods can be prohibitive in computational time. For this reason an adapted genetic algorithm (GA) is implemented to cope with this computational burden. Experimental results obtained with branch-and-cut as implemented in CPLEX and GA for small to large-scale problem instances are presented. The paper also includes a review of the relevant literature.