Research on Continuous Berth Allocation Problem based on Genetic-Harmony Search Algorithm

Abstract

In order to solve the berth allocation problem and improve the efficiency of the dock, a mixed integer nonlinear programming model is built with the length of port stay. The genetic-harmony search algorithm is used to solve it for the first time. Finally, the algorithm and Lingo are used to solve the large-scale berth allocation problem at the same time. Under the same data of arrival ships, several groups of experiments are designed to verify the algorithm. The results show that the genetic-harmony search algorithm can be used to solve the berth allocation problem. On the basis of the consistency between the genetic-harmony search algorithm and Lingo, the genetic-harmony search algorithm is faster and more efficient.