The Dynamic Berth Allocation Problem for a Container Port

By A. Imai, E. Nishimura, S. Papadimitriou. 2001

589 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Models and Tabu Search Heuristics for the Berth-Allocation Problem (2005, methodology): “Imai et al. (2001) have proposed the Dynamic Berth Allocation Problem (DBAP) formulation in which the quay is represented as a finite set of berthing points.”
Container terminal operation and operations research - a classification and literature review (2004, methodology): “[81] study berth allocation and optimization of berth utilization using a heuristic procedure, which is based on a mixed-integer programming (MIP) formulation of static and dynamic versions of the allocation problem and its Lagrangian relaxation.”
A scheduling method for Berth and Quay cranes (2003, background): “Imai et al. [ 5 ] also assumed a Berth to be a collection of discrete Berthing sections.”
The berth allocation problem with stochastic vessel handling times (2013, background): “The majority of the published research considers the discrete case [9, 10, 11].”