Journal article
Models for the discrete berth allocation problem: A computational comparison
Logistics & ITS, Department of Transport, Technical University of Denmark1
Department of Transport, Technical University of Denmark2
Technical University of Denmark3
Operations Research, Department of Management Engineering, Technical University of Denmark4
Department of Management Engineering, Technical University of Denmark5
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 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 set-partitioning model outperforms all other existing models.
Language: | English |
---|---|
Year: | 2011 |
Pages: | 461-473 |
ISSN: | 18785794 and 13665545 |
Types: | Journal article |
DOI: | 10.1016/j.tre.2010.11.016 |
ORCIDs: | Røpke, Stefan , Larsen, Jesper and Lusby, Richard Martin |