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

Multiobjective container barge transport problem

Author

Listed:
  • Amina El Yaagoubi

    (Normandie Univ, UNIHAVRE, Le Havre 76600, France)

  • Ahmed El Hilali Alaoui
  • Jaouad Boukachour

Abstract

The need for optimization using different methods of operations research in container terminal operations has become even more important in recent years. The mean of this paper is to study the Traveling Salesman Problem (TSP) combined with the Container Stowage Problem (CSP) that is we consider one barge where the containers are stowed in stacks with a predefined order according to their fragility, weight and stability, such that a number of containers must be removed in order to reach containers below them. In other words, only the upper-most container of each stack of the barge can be directly accessed, thus, shifting containers within the barge becomes necessary if the target container is located below other ones. Our aim is to seek an optimal rotation that takes account of unloading and reloading of the containers placed in the barge. We propose a mathematical model as a binary linear program, and then we adapt the ant colony metaheuristic to solve it.

Suggested Citation

  • Amina El Yaagoubi & Ahmed El Hilali Alaoui & Jaouad Boukachour, 2016. "Multiobjective container barge transport problem," Post-Print hal-04556752, HAL.
    • Handle: RePEc:hal:journl:hal-04556752
    DOI: 10.1109/GOL.2016.7731664
    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.

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