A Bi-level Programming Model and Its Algorithm for Scheduling at a Container Terminal

Operation in a container terminal is a complex system with many inter-related decisions. In this paper, a bi-level programming model for container terminal scheduling is developed to improve the integration efficiency of container terminals. The model consists of two sub-models, the upper-level model is quay crane scheduling problem, and the lower-level one is dynamic trailer routing problem. The feedback and reciprocity between the two sub-models form the optimal scheme for container terminal scheduling. Meanwhile, a genetic based algorithm is designed to solve the model and numerical tests are provided to illustrate the validity of the model and the algorithm. Results show that the algorithm can reach convergence in a short time. The results indicate that the bi-level programming model can not only greatly decrease the empty driving distance and the needed trailers at the cost of slight increment of the quay crane operation time, but also decrease the road traffic congestion and the probability of operation delay at container terminal. In addition, the integration and reliability of container terminal operation systems are improved because the bi-level model considers the quay crane scheduling and the trailer routing simultaneously