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

A Heuristic Approach For Solving Container-on-Barge Stowage Planning Problem Based On Bin-Packing First-Fit Algorithm

Author

Listed:
  • Amina El Yaagoubi

    (LMCS - Laboratoire de Méthodes de Conception de Systèmes - ESI - École Nationale Supérieure d'Informatique [Alger], USMBA - Université Sidi Mohamed Ben Abdellah)

  • Ahmed El Hilali Alaoui
  • Jaouad Boukachour

Abstract

In this work, we tackle the 3D container stowage planning problem in the case of inland navigation vessels called barges. This problem aims at determining the most suitable arrangement possible of the containers in the barge in order to facilitate its recovery in the chronology of destination ports, while satisfying the context-dependent structural and operational constraints linked to both the containers and the barge. The main objective is to minimize the total number of unproductive loading and unloading movements, called "shiftings" while ensuring the longitudinal, transversal and vertical stability of the barge. This problem is considered based on its relation with the bin-packing problem. Within this context, we propose a novel heuristic approach for solving container-on-barge stowage planning problem based on the First-Fit algorithm which is considered as one of the most basic bin-packing resolution methods.

Suggested Citation

  • Amina El Yaagoubi & Ahmed El Hilali Alaoui & Jaouad Boukachour, 2020. "A Heuristic Approach For Solving Container-on-Barge Stowage Planning Problem Based On Bin-Packing First-Fit Algorithm," Post-Print hal-04556735, HAL.
    • Handle: RePEc:hal:journl:hal-04556735
    DOI: 10.1109/GOL49479.2020.9314748
    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.

    More about this item

    Statistics

    Access and download statistics

    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-04556735. 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.