Analysis of the continuous berth allocation problem in container ports using a genetic algorithm

摘要

The optimal usage of berths plays a key role in raising the efficiency of container terminals. The berth allocation problem in a container terminal is defined as the feasible allocation of berths to incoming ships such that the total time that elapses between the arrival of the ships to their exit from their berths is minimized. In the transportation literature, the latter problem is usually formulated as a mixed integer programming model. Optimization methods, like the branch and bound algorithm, are efficient ways to solve this model but become absolutely unusable when the size of the problem increases. An advanced search method such as GA may be suited to such a situation. In this paper, a genetic-based algorithm is proposed for the problem. Computational results for two test problems (a small and a large-sized problem) are also presented. The results from the small test are also compared with the results obtained from the branch and bound algorithm.