Models for the discrete berth allocation problem: A computational comparison

Katja Buhrkal, Sara Zuglian, Stefan Ropke, Jesper Larsen and Richard Lusby

Transportation Research Part E: Logistics and Transportation Review, 2011, vol. 47, issue 4, 461-473

Abstract: 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.

Keywords: Berth; allocation; problem; Container; terminals; Mixed; integer; programming (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations: View citations in EconPapers (43)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S1366554510001201
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:transe:v:47:y:2011:i:4:p:461-473

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic
http://www.elsevier. ... 600244/bibliographic

Access Statistics for this article

Transportation Research Part E: Logistics and Transportation Review is currently edited by W. Talley

More articles in Transportation Research Part E: Logistics and Transportation Review from Elsevier
Bibliographic data for series maintained by Catherine Liu ().