Integrated Laycan and Berth Allocation Problem - Archive ouverte HAL Access content directly
Conference Papers Year : 2020

Integrated Laycan and Berth Allocation Problem


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 avoid 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.
Fichier principal
Vignette du fichier
Paper IESM 2019.pdf (575.33 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02342441 , version 1 (11-01-2020)



Hamza Bouzekri, Gülgün Alpan, Vincent Giard. Integrated Laycan and Berth Allocation Problem. International Conference on Industrial Engineering and Systems Management, Sep 2019, Shanghai, China. pp.1-6, ⟨10.1109/IESM45758.2019.8948110⟩. ⟨hal-02342441⟩
190 View
214 Download



Gmail Facebook X LinkedIn More