Mathematical programming formulations for the strategic berth template problem

Çağatay Iris (Corresponding Author), Eduardo Lalla-Ruiz, Jasmine Siu Lee Lam*, Stefan Voß

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review

21 Citations (Scopus)
4 Downloads (Pure)


The strategic berth template problem (SBTP) is an important strategic problem arising at the seaside of container terminals. It aims at supporting terminal managers in deciding which calling ships should be accepted, and it covers determining the most appropriate berth template for the accepted incoming traffic. In this work, we propose and evaluate two formulations. One is based on a conceptual but yet unexplored mathematical model and another is based on a generalized set-packing problem (GSP). Both formulations are assessed on a well-defined set of problem instances. The results indicate that the GSP-based optimization model exhibits a relevant performance, providing optimal solutions within reasonable time for most of the instances considered.

Original languageEnglish
Pages (from-to)167-179
Number of pages13
JournalComputers and industrial engineering
Publication statusPublished - 1 Oct 2018


  • Berth allocation problem
  • Maritime transportation
  • Set-packing formulation
  • Strategic planning
  • Heuristics
  • Mathematical Programming
  • Optimization
  • 22/4 OA procedure


Dive into the research topics of 'Mathematical programming formulations for the strategic berth template problem'. Together they form a unique fingerprint.

Cite this