Models for the Discrete Berth Allocation Problem: A Computational Comparison

Katja Buhrkal, Sara Zuglian, Stefan Røpke, Jesper Larsen, Richard Martin Lusby

    Research output: Book/ReportReportResearch

    542 Downloads (Pure)


    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.
    Original languageEnglish
    Place of PublicationKgs. Lyngby
    PublisherDTU Management
    Number of pages25
    ISBN (Print)978-87-90855-60-4
    Publication statusPublished - 2009
    SeriesDTU Management 2009


    Dive into the research topics of 'Models for the Discrete Berth Allocation Problem: A Computational Comparison'. Together they form a unique fingerprint.

    Cite this