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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    The strategic berth template problem


    Contributors:


    Publication date :

    2014-09-30


    Size :

    24 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    The strategic berth template problem

    Imai, Akio | Online Contents | 2014


    Discrete Berth-Scheduling Problem

    Golias, M. M. / Boile, M. / Theofanis, S. | Transportation Research Record | 2010


    The Berth-Scheduling Problem

    Golias, Mihalis / Boile, Maria / Theofanis, Sotiris et al. | Transportation Research Record | 2010


    A continuous berth template design model with multiple wharfs

    Huang, Kuancheng / Suprayogi / Ariantini | Taylor & Francis Verlag | 2016