عنوان مقاله [English]
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 the incoming ships, so that the total elapsed time of the ships' arrival and departure from the berths is minimized. In the literature of transportation, the latter problem is usually formulated as mixed integer programming models. Optimization methods, like the branch & bound algorithm, do not have sufficient efficiency to solve these models and become perfectly unusable when the problem size increases. In this situation, using an advanced search method, like genetic algorithms, may be suitable. In this paper, a genetic-based algorithm is proposed for the problem. Computational results for two test problems, i. e., small size and large size, are also presented. The results of the small test are also compared with the
results obtained via the branch & bound algorithm.