The increasing maritime traffic forces terminal operators to efficiently reduce the container ships’ service time in order to maintain or increase their market share. This situation gives rise to the well-known berth allocation problem. Its goal is to determine the allocation and the berthing time of container ships arriving to the port with the aim of minimizing the total service time. For tackling this problem, we propose a dynamic programming-based matheuristic that allows to derive lower and upper bounds, and therefore, evaluate the optimality of the provided solutions. Its behavior is assessed on realistic problem instances from the related literature as well as on a new set of larger instances with 150 ships and 15 berths. The results indicate that our proposed approach shows a competitive performance.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A dynamic programming-based matheuristic for the dynamic berth allocation problem


    Additional title:

    Ann Oper Res


    Contributors:

    Published in:

    Annals of Operations Research ; 286 , 1-2 ; 391-410


    Publication date :

    2020-03-01


    Size :

    20 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English





    A Rolling Horizon-Based Constraint Programming Method for Continuous Berth Allocation Problem

    Liu, Qiang / Xu, Tongtong / Liu, Huashi et al. | Springer Verlag | 2024


    Bus station berth dynamic allocation method based on simulation optimization

    HU SANGEN / SHEN MINYU / WANG XIAOXIA et al. | European Patent Office | 2024

    Free access

    The stochastic discrete berth allocation problem

    Schepler, Xavier / Absi, Nabil / Feillet, Dominique et al. | Online Contents | 2019


    Integrated Laycan and Berth Allocation Problem

    Bouzekri, Hamza / Alpan, Gulgun / Giard, Vincent | IEEE | 2019