Particle Swarm Optimization and Simulated Annealing-Based Algorithms for Berth Allocation Problem

摘要

This paper considers the berth allocation problem with the objective of minimizing total service time, including vessels waiting time. A new hybrid algorithm is developed in this paper to solve the problem. In the hybrid algorithm, discrete particle swarm optimization combines global search and local search to search for the optimal results and simulated annealing uses certain probability to avoid being trapped in local optimum. The computational result showed that the proposed algorithm is a feasible and effective approach for berth allocation problem.