Integrated Laycan and Berth Allocation Problem with ship stability and conveyor routing constraints in bulk ports

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

Working Papers from HAL

Abstract: In this paper, we study the integrated Laycan and Berth Allocation Problem (LBAP) in the context of bulk ports, which considers two problems in an integrated way: the tactical Laycan Allocation Problem and the dynamic hybrid case of the operational Berth Allocation Problem. To make the LBAP closer to reality, we consider tidal bulk ports with conveyor routing constraints between storage hangars and berthing positions, preventive maintenance activities, multiple quays with different water depths and fixed heterogeneous bulk-handling cranes, navigation channel restrictions, vessels with multiple cargo types, charter party clauses and non-working periods. The aim of the proposed integer programming model is to define an efficient schedule for berthing chartered vessels and optimal laycans to new vessels to charter. The model is formulated with predicates that guarantee maximum flexibility in the implementation and greatly improve the computational performance. Finally, the model is tested and validated through a relevant case study inspired by the operations of OCP Group at the bulk port of Jorf Lasfar in Morocco. The results show that the model can be used to solve to optimality instances with up to 60 vessels for a 4-week planning horizon in very reasonable computational time using commercial software.

Keywords: Laycan allocation; Berth allocation; Tidal bulk ports; Ship stability; Conveyors; Preventive maintenance; Integer programming (search for similar items in EconPapers)
Date: 2022-06-30
Note: View the original document on HAL open archive server: https://hal.science/hal-03431793v2
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://hal.science/hal-03431793v2/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:wpaper:hal-03431793

Access Statistics for this paper

More papers in Working Papers from HAL
Bibliographic data for series maintained by CCSD ().