Modeling and solving the tactical berth allocation problem

Abstract

This paper addresses the tactical berth allocation problem (TBAP) at container terminals, which involves assigning vessels to berths over a planning horizon. We propose mixed-integer programming models and solution methods that integrate quay crane assignment and minimize transshipment-related costs.

Container TerminalsOperations ResearchInteger Programming

BibTeX

@article{giallombardo2010modeling,
  title={Modeling and solving the tactical berth allocation problem},
  author={Giallombardo, Giovanni and Moccia, Luigi and Salani, Matteo and Vacca, Ilaria},
  journal={Transportation Research Part B: Methodological},
  volume={44},
  number={2},
  pages={232--245},
  year={2010},
  publisher={Pergamon}
}