Integrated Laycan and Berth Allocation Problem

Hamza Bouzekri (), Gülgün Alpan () and Vincent Giard
Additional contact information
Hamza Bouzekri: G-SCOP_GCSP - Gestion et Conduite des Systèmes de Production - G-SCOP - Laboratoire des sciences pour la conception, l'optimisation et la production - CNRS - Centre National de la Recherche Scientifique - UGA - Université Grenoble Alpes - Grenoble INP - Institut polytechnique de Grenoble - Grenoble Institute of Technology - UGA - Université Grenoble Alpes
Gülgün Alpan: G-SCOP_GCSP - Gestion et Conduite des Systèmes de Production - G-SCOP - Laboratoire des sciences pour la conception, l'optimisation et la production - CNRS - Centre National de la Recherche Scientifique - UGA - Université Grenoble Alpes - Grenoble INP - Institut polytechnique de Grenoble - Grenoble Institute of Technology - UGA - Université Grenoble Alpes
Vincent Giard: LAMSADE - Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision - Université Paris Dauphine-PSL - PSL - Université Paris Sciences et Lettres - CNRS - Centre National de la Recherche Scientifique

Post-Print from HAL

Abstract: 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.

Keywords: spatiotemporal disjunctive constraints; laycan allocation; berth allocation; mixed zero-one linear programming (search for similar items in EconPapers)
Date: 2019-09-25
Note: View the original document on HAL open archive server: https://hal.science/hal-02342441v1
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Published in International Conference on Industrial Engineering and Systems Management, Sep 2019, Shanghai, China. pp.1-6, ⟨10.1109/IESM45758.2019.8948110⟩

Downloads: (external link)
https://hal.science/hal-02342441v1/document (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hal:journl:hal-02342441

DOI: 10.1109/IESM45758.2019.8948110

Access Statistics for this paper

More papers in Post-Print from HAL
Bibliographic data for series maintained by CCSD ().