BERTH SCHEDULING FOR CONTAINER TERMINAL IN VIETNAM WITH HYBRID SIMULATED ANNEALING ALGORITHM

Abstract

The use of container has become widespread because of their advantages. Moreover, the competition in the container transportation is more and more intense. In this paper, we consider the scheduling problem of vessel in berth with the continuous assumption in order to increase the throughput of container terminals. A mixed integer programming model is built. A hybrid meta-heuristic algorithm is suggested to solve the problem. The results of the algorithm are compared with a common solution first come first served.