Integrated Laycan and Berth Allocation and time-invariant Quay Crane Assignment Problem in tidal ports with multiple quays

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, EMINES School of Industrial Management [UM6P] - UM6P - Université Mohammed VI Polytechnique = Mohammed VI Polytechnic University [Ben Guerir]
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, EMINES School of Industrial Management [UM6P] - UM6P - Université Mohammed VI Polytechnique = Mohammed VI Polytechnic University [Ben Guerir]
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: Efficient management of port resources plays a crucial role in reducing vessel stay times and avoiding the payment of demurrage charges. In this paper, we focus on the integrated Laycan and Berth Allocation and Quay Crane Assignment Problem (LBACAP), which considers three problems in an integrated way: the Laycan Allocation Problem, the dynamic continuous Berth Allocation Problem and the time-invariant Quay Crane Assignment Problem. Since these problems have different decision levels, a change of decision time scale is made inside the planning horizon. To ensure that this integrated problem is as close as possible to reality, we consider non-working periods and tidal ports with multiple quays that have different water depths. The integer programming model proposed for the LBACAP aims to find an efficient schedule for berthing chartered vessels with an efficient quay crane assignment, and to propose laycans (laydays and canceling) to new vessels to charter. In a second part, we focus on the integrated Laycan and Berth Allocation and Specific Quay Crane Assignment Problem (LBACASP), which extends the LBACAP model to include the assignment of a set of specific quay cranes to each vessel, considering the productivity of quay cranes (homogeneous or heterogeneous) and their maximum outreach. Moreover, we use predicates in the formulation of both models, which ensure maximum flexibility in their implementation, thereby improving significantly their computational performance. Finally, the computational study on several classes of generated test instances shows that problems with up to 100 vessels can be solved to optimality.

Keywords: Integer programming; Berth and quay crane assignment; Predicates; Laycan allocation; Scheduling (search for similar items in EconPapers)
Date: 2021-01-04
New Economics Papers: this item is included in nep-cmp
Note: View the original document on HAL open archive server: https://hal.science/hal-02480102v2
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (8)

Published in European Journal of Operational Research, 2021, ⟨10.1016/j.ejor.2020.12.056⟩

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

DOI: 10.1016/j.ejor.2020.12.056

Access Statistics for this paper

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