an integrated quay crane assignment and scheduling problem with several contractors in container terminals

The last decade has seen an important role of container terminals in the global trade centers. by another point of view, the high cost of quay cranes on the other hand is a motivation for a set of real-world problems including of quay crane assignment problem (qcap) and the quay crane scheduling problem (qcsp) in the hotspot of research. the main innovation of this proposal is to integrate both qcap and qcsp to improve quay crane (qc) performance by an optimization goal, i.e., qcasp. a real case study in iran has been applied to validate the proposed problem which has been formulated by a mixed integer linear programming (milp). due to inherent complexity of problem proposed in the real-world cases, the teaching-learning-based-optimization (tlbo) algorithm has been used to find an optimal/global solution in a reasonable time. the applied tlbo has been tuned by taguchi method and validated in small instances in comparison with an exact method. the computational results show that our proposed tlbo algorithm can solve qcasp, especially in large size instances, successfully. finally, a set of managerial implications has been recommended to consider the benefits of proposed methodology and algorithm regarding the real case study presented