Design of berth scheduling based on improved particle swarm algorithm

Considering the difference of the ship´s loss of waiting in berth scheduling jobs, it established an optimization model to minimize the ship´s loss of waiting. And two improved PSO are designed: 1. Add perturbation to the iterative process of PSO algorithm. This method to some extent avoids the algorithm falling into the local optimal values; 2.Add the simulated annealing mechanism when it updates the particles´ velocity and position. This method strengthens the global searching capability and increases the diversity of particles. The above two improvements of the algorithm and the PSO is applied to the port berth scheduling problem. Then execute the mathematical simulation and a number of computing. Comparison of algorithms´ results have indicated that the hybrid PSO algorithm which adds the simulated annealing mechanism have the best performance.