A dynamic hybrid Berth Allocation Problem with routing constraints in bulk ports
Bouzekri, Hamza; Alpan, Gülgün; Giard, Vincent (2020), A dynamic hybrid Berth Allocation Problem with routing constraints in bulk ports, in Lalic, Bojan; Majstorovic, Vidosav; Marjanovic, Ugljesa, Advances in Production Management Systems. The Path to Digital Transformation and Innovation of Production Management Systems, Proceedings, Part I, Springer. 10.1007/978-3-030-57993-7_29
Type
Communication / ConférenceDate
2020Conference title
International Conference, APMS 2020Conference date
2020-08Conference city
Novi SadConference country
SerbiaBook title
Advances in Production Management Systems. The Path to Digital Transformation and Innovation of Production Management Systems, Proceedings, Part IBook author
Lalic, Bojan; Majstorovic, Vidosav; Marjanovic, UgljesaPublisher
Springer
ISBN
978-3-030-57992-0
Publication identifier
Metadata
Show full item recordAuthor(s)
Bouzekri, HamzaAlpan, Gülgün
Giard, Vincent
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Abstract (EN)
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.Subjects / Keywords
Berth Allocation Problem; Conveyor system; Bulk portsRelated items
Showing items related by title and author.
-
Bouzekri, Hamza; Alpan, Gülgün; Giard, Vincent (2021-11) Document de travail / Working paper
-
Bouzekri, Hamza; Alpan, Gülgün; Giard, Vincent (2023) Article accepté pour publication ou publié
-
Bouzekri, Hamza; Alpan, Gülgün; Giard, Vincent (2020) Document de travail / Working paper
-
Bouzekri, Hamza; Bara, Najat; Alpan, Gülgün; Giard, Vincent (2021) Article accepté pour publication ou publié
-
Bouzekri, Hamza; Alpan, Gülgün; Giard, Vincent Communication / Conférence