IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v53y2025i2p201-227.html
   My bibliography  Save this article

Genetic and hybrid algorithms to solve the container stacking problem at Tripoli-Lebanon seaport

Author

Listed:
  • Nobar Kassabian
  • Zakaria Hammoudan
  • Olivier Grunder
  • Lhassane Idoumghar

Abstract

Several factors determined the survival of the seaport: logistics, storage and distribution. A storage strategy dependent on container stacking rules is an important factor in the competence of the container terminal. This article focuses on solving the problem of stacking incoming containers in the storage yard, taking into account several criteria regarding the port of Tripoli-Lebanon. A mathematical model with a mixed integer linear program for the container stacking problem is considered in this paper. As this problem is NP-hard, large instances cannot be solved by optimisation solvers as Gurobi. We develop four algorithms to tackle this problem: a genetic algorithm (GA), a randomised greedy algorithm (RGA), an iterated local search (ILS) and a hybridisation approach between RGA and ILS. Finally, numerical simulations prove the efficiency of the GA which produces results close to the optimal solution on real instances taken from the containers terminal for small and medium sizes.

Suggested Citation

  • Nobar Kassabian & Zakaria Hammoudan & Olivier Grunder & Lhassane Idoumghar, 2025. "Genetic and hybrid algorithms to solve the container stacking problem at Tripoli-Lebanon seaport," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 53(2), pages 201-227.
    • Handle: RePEc:ids:ijores:v:53:y:2025:i:2:p:201-227
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=146897
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:ids:ijores:v:53:y:2025:i:2:p:201-227. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    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.