Handling vessels within the agreed time limits at a port with an optimal exploitation of its quays plays an important role in the improvement of port effectiveness as it reduces the stay time of vessels and avoids the payment of contractual penalties to shipowners due to the overrun of laytimes. In this paper, we propose a mixed zero-one linear model for a new problem called the integrated Laycan and Berth Allocation Problem with dynamic vessel arrivals in a port with multiple continuous quays. The model aims, first, to achieve an optimal berth plan that reduces the late departures of chartered vessels by maximizing the difference between their despatch money and demurrage charges, considering water depth and maximum waiting time constraints and the productivity that depends on berth positions and, second, to propose laycans for new vessels to charter. Only one binary variable is used to determine the spatiotemporal allocations of vessels and the spatiotemporal constraints of the problem are covered by a disjunctive constraint. An illustrative example and several numerical tests are provided.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Integrated Laycan and Berth Allocation Problem


    Contributors:


    Publication date :

    2019-09-01


    Size :

    230109 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    The stochastic discrete berth allocation problem

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


    Berth Allocation and Crane Assignment Problem in Continuous Berth Containers Vessels Terminals

    Abir Hussein / Amin El-Kharbotly / Tamer Ismail | DOAJ | 2022

    Free access

    Modeling and solving the Tactical Berth Allocation Problem

    Lownes, Nicholas E. | Online Contents | 2010