IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-04112627.html
   My bibliography  Save this paper

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

Author

Listed:
  • Hamza Bouzekri

    (G-SCOP_DOME2S - Design, Engineering and Operation Management of Systems and Services - 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_DOME2S - Design, Engineering and Operation Management of Systems and Services - 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)

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, non-working periods, and ship stability considerations during loading operations. The proposed integer programming model aims to define an efficient schedule for berthing chartered vessels and 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 set of relevant case studies inspired by the operations of OCP Group at the bulk port of Jorf Lasfar in Morocco in very reasonable computational time using commercial Software.

Suggested Citation

  • Hamza Bouzekri & Gülgün Alpan & Vincent Giard, 2023. "Integrated Laycan and Berth Allocation Problem with ship stability and conveyor routing constraints in bulk ports," Post-Print hal-04112627, HAL.
    • Handle: RePEc:hal:journl:hal-04112627
    DOI: 10.1016/j.cie.2023.109341
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Gao, Zhendi & Ji, Mingjun & Kong, Lingrui & Hou, Xinhao, 2024. "Scheduling of automated ore terminal operations based on fixed inflow rhythm," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 182(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hal:journl:hal-04112627. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.