Berth and Quay Crane Scheduling Optimization Based on Improved Genetic Algorithm

Berth and quay crane resources are the key resources of container ports, which are expensive and limited. Reasonable allocation of these two resources can effectively reduce the operation cost and give full play to the productivity of the port. In this paper, an optimal mathematical model considering the specific allocation of quay cranes is established in order to realize the joint scheduling of continuous berth and quay cranes. The decision variables include the berthing priority, berthing position, number of quay cranes and minimum quay crane number assigned to container ships. An improved genetic algorithm is used to solve this problem. In the algorithm, solutions generated according to specific rules are put into the initial population. The population is divided into two parts for independent evolution, and the information exchange is carried out every fixed generations. Through numerical experiments, it is verified that the improved genetic algorithm has better optimization effect.