TY - JOUR

T1 - Models for the discrete berth allocation problem: A computational comparison

A1 - Buhrkal,Katja Frederik

A1 - Zuglian,Sara

A1 - Røpke,Stefan

A1 - Larsen,Jesper

A1 - Lusby,Richard Martin

AU - Buhrkal,Katja Frederik

AU - Zuglian,Sara

AU - Røpke,Stefan

AU - Larsen,Jesper

AU - Lusby,Richard Martin

PB - Pergamon

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - Mixed integer programming

KW - Container terminals

KW - Berth allocation problem

U2 - 10.1016/j.tre.2010.11.016

DO - 10.1016/j.tre.2010.11.016

JO - Transportation Research. Part E: Logistics and Transportation Review

JF - Transportation Research. Part E: Logistics and Transportation Review

SN - 1366-5545

IS - 4

VL - 47

SP - 461

EP - 473

ER -