A dynamic hybrid Berth Allocation Problem with 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

Post-Print from HAL

Abstract: The Berth Allocation Problem (BAP) is considered as one of the most important operational problems in the seaside area of ports. It refers to the problem of assigning a set of vessels to a given berth layout within a given time horizon. In this paper, we study the dynamic and hybrid case of the BAP in the context of bulk ports with multiple quays, different water depths, and heterogeneous loading equipment, considering routing constraints (routes between storage hangars and berths). This study is motivated by the operations of OCP Group, a world leader in the phosphate industry, at the bulk port of Jorf Lasfar in Morocco, recognized as the largest ore port in Africa. The objective of the problem is to enhance the coordination between the berthing and yard activities, besides maximizing the difference between the despatch money and the demurrage charges of all berthed vessels. We propose an integer linear programming model formulated with predicates, which ensures maximum flexibility in the implementation of the model. Finally, the proposed model is tested and validated through numerical experiments based on instances inspired by real bulk port data. The results show that the model can be used to solve to optimality instances with up to 40 vessels within reasonable computational time.

Keywords: Berth Allocation Problem; Conveyor system; Bulk ports (search for similar items in EconPapers)
Date: 2020-08-30
Note: View the original document on HAL open archive server: https://hal.science/hal-02921374v1
References: Add references at CitEc
Citations:

Published in APMS 2020, Aug 2020, Novi Sad, Serbia. pp.250-258, ⟨10.1007/978-3-030-57993-7_29⟩

Downloads: (external link)
https://hal.science/hal-02921374v1/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-02921374

DOI: 10.1007/978-3-030-57993-7_29

Access Statistics for this paper

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