Peng, J.; Zhou, Z., and Li, R., 2015. A collaborative berth allocation problem with multiple ports based on Genetic Algorithm.

As a part of scheduling, Berth Allocation Problem can be considered as a problem of minimizing the total service time of vessels which berth at the port. The purpose is to optimize the efficiency of the port and the passing rate of vessels. The balanced deployment issues of yards can be transformed into considered as an equilibrium assignment of yard storage. The purpose is to give the loading vessels more choices to choose their best lanes and enhance the efficiency of the yard, as well as reduce the transportation costs. This paper combines berth allocation and yard assignment problems to build a collaborative berth allocation model with multiple ports under the background of bulk ports. The objective of this model consists of two parts: The minimization of total service time of vessels and the equilibrium assignment of yard storage. This paper uses two approaches to solve the above-mentioned mixed integer nonlinear programming problems: IBM ILOG CPLEX and Genetic Algorithm. According to the actual data of Majishan Port and Ore Transfer Terminal of Lake Shulang, many numerical experiments are conducted. This paper analyzes and compares these two approaches and proves the validity and accuracy of Genetic Algorithm and CPLEX. The model and the analysis procedure of numerical experiments are of certain reference value and practical significance on the management of berth allocation and yard assignment with multiple ports.