Highlights We study a strategic berth scheduling problem called the strategic berth template problem. We develop heuristic algorithms to find a better approximate solution for the strategic berth template problem. The algorithms perform well for the strategic berth template problem.
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.
The strategic berth template problem
2014-09-30
24 pages
Article (Journal)
Electronic Resource
English
The strategic berth template problem
Online Contents | 2014
|Discrete Berth-Scheduling Problem
Transportation Research Record | 2010
|Transportation Research Record | 2010
|A continuous berth template design model with multiple wharfs
Taylor & Francis Verlag | 2016
|An Integrated Model for Berth Template and Yard Template Planning in Transshipment Hubs
Online Contents | 2011
|