The Algorithm For Berth Scheduling Problem By The Hybrid Optimization Strategy GASA

In the operations of the container terminals, berth scheduling problem is one of the main bottlenecks that restrict the container terminals to reduce the turnaround time of the ships and the operation costs. In this paper we described a nonlinear model for the berth scheduling problem and solved this model by the genetic algorithm GA and the hybrid optimization strategy GASA (namely the combination of genetic algorithm and simulated annealing) respectively. The results indicated that compared with GA, the GASA algorithm increased the diversity of the individuals, accelerated the evolution process and avoided sinking into the local optimal solution early