Research on optimized modelling and algorithm of integrated allocation of irregular berth and quay crane

Abstract:

As the limited resources of the port, the optimal allocation of berths and quay cranes is conducive to improve the operation efficiency of the port and speed up the departure time of ships. Due to the limitation of geographical conditions, the berth lines of some ports are not linear, but show "L" or "F" shape, such as quay cranes can not free to move on these discontinuous berth, this kind of berth allocation problem cannot be optimized based on the continuous berth allocation problem, and the space of the berth line will be wasted based on the discrete berth allocation problem. For the irregular berths and quay crane integrated distribution problem, according to the relative location and time of arrived ships, a mixed linear programming mathematics models is established, three valid inequalities are extracted by analyzing the features and variable relationship, and CPLEX software is used to solve the model. With the increasing of the problem size, the solving time is increasing. Therefore, the improved particle swarm algorithm is proposed, a new velocity updating formula with random search strategy is used to avoid falling into local optimum. The experiment results show that the average solving time is reduced by 83.23% by adding the valid inequalities. The average result obtained by the improved particle swarm algorithm is reduced by 25.21% than that of the standard particle swarm algorithm. It is proved that the improved particle swarm optimization algorithm proposed in this paper is effective in solving the problem of irregular berth and quay crane allocation.