IDEAS home Printed from https://ideas.repec.org/a/igg/jamc00/v12y2021i3p212-231.html
   My bibliography  Save this article

A New Memetic Approach to Solve the Strategic Berth Template Problem

Author

Listed:
  • Issam El Hammouti

    (Department of Mathematics, Faculty of Science of Tetouan, Morocco)

  • Azza Lajjam

    (National School of Applied Sciences, Abdelmalek Essaadi University, Morocco)

  • Mohamed El Merouani

    (Department of Mathematics, Faculty of Science of Tetouan, Morocco)

Abstract

The berth allocation problem is one of the main concerns of port operators at a container terminal. In this paper, the authors study the berth allocation problem at the strategic level commonly known as the strategic berth template problem (SBTP). This problem aims to find the best berth template for a set of calling ships accepted to be served at the port. At strategic level, port operator can reject some ships to be served for avoid congestion. Since the computational complexity of the mathematical formulation proposed for SBTP, solution approaches presented so far for the problem are limited especially at level of large-scale instances. In order to find high quality solutions with a short computational time, this work proposes a population based memetic algorithm which combine a first-come-first-served (FCFS) technique, two genetics operators, and a simulating annealing algorithm. Different computational experiences and comparisons against the best known solutions so far have been presented to show the performance and effectiveness of the proposed method.

Suggested Citation

  • Issam El Hammouti & Azza Lajjam & Mohamed El Merouani, 2021. "A New Memetic Approach to Solve the Strategic Berth Template Problem," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 12(3), pages 212-231, July.
    • Handle: RePEc:igg:jamc00:v:12:y:2021:i:3:p:212-231
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAMC.2021070110
    Download Restriction: no
    ---><---

    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:igg:jamc00:v:12:y:2021:i:3:p:212-231. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    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.