In this paper we consider the problem of allocating arriving ships to discrete berth locations at container terminals. This problem is recognized as one of the most important processes for any container terminal. We review and describe the three main models of the discrete dynamic berth allocation problem, improve the performance of one model, and, through extensive numerical tests, compare all models from a computational perspective. The results indicate that a generalized setpartitioning model outperforms all other existing models.
|Place of Publication||Kgs. Lyngby|
|Number of pages||25|
|Publication status||Published - 2009|
|Series||DTU Management 2009|