The strategic berth template problem

Akio Imai*, Yukiko Yamakawa, Kuan-cheng Huang

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

27 Scopus citations

Abstract

A marine container terminal operator may have a situation with excessive calling requests to be served especially when some new service contracts are under consideration. For this situation, we propose a strategic berth template problem (BTPS) that selects the ships among the requesting ones to be served and arrange their berth-windows within a limited planning horizon. The BTPS employs the subgradient optimization procedure, which is an improved version of the procedure that the authors developed for the operational berth allocation problem. A wide variety of numerical experiments indicate the improved subgradient procedure works well for the BTPS.

Original languageEnglish
Pages (from-to)77-100
Number of pages24
JournalTransportation Research Part E: Logistics and Transportation Review
Volume72
DOIs
StatePublished - 1 Dec 2014

Keywords

  • Berth allocation problem
  • Berth template problem
  • Container terminal
  • Heuristics
  • Lagrangian relaxation
  • Subgradient optimization

Fingerprint Dive into the research topics of 'The strategic berth template problem'. Together they form a unique fingerprint.

Cite this