Models for the discrete berth allocation problem: A computational comparison

Publication: Research - peer-reviewJournal article – Annual report year: 2011

View graph of relations

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.
Original languageEnglish
JournalTransportation Research. Part E: Logistics and Transportation Review
Publication date2011
Volume47
Issue4
Pages461-473
ISSN1366-5545
DOIs
StatePublished
CitationsWeb of Science® Times Cited: 17

Keywords

  • Mixed integer programming, Container terminals, Berth allocation problem
Download as:
Download as PDF
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
Word

ID: 5500676