Welcome to the InfoSci Platform
A New Memetic Approach to Solve the Strategic Berth Template Problem

A New Memetic Approach to Solve the Strategic Berth Template Problem

Issam El Hammouti, Azza Lajjam, Mohamed El Merouani
Copyright: © 2021 |Volume: 12 |Issue: 3 |Pages: 20
ISSN: 1947-8283|EISSN: 1947-8291|EISBN13: 9781799861140|DOI: 10.4018/IJAMC.2021070110
Cite Article Cite Article

MLA

El Hammouti, Issam, et al. "A New Memetic Approach to Solve the Strategic Berth Template Problem." IJAMC vol.12, no.3 2021: pp.212-231. http://doi.org/10.4018/IJAMC.2021070110

APA

El Hammouti, I., Lajjam, A., & El Merouani, M. (2021). A New Memetic Approach to Solve the Strategic Berth Template Problem. International Journal of Applied Metaheuristic Computing (IJAMC), 12(3), 212-231. http://doi.org/10.4018/IJAMC.2021070110

Chicago

El Hammouti, Issam, Azza Lajjam, and Mohamed El Merouani. "A New Memetic Approach to Solve the Strategic Berth Template Problem," International Journal of Applied Metaheuristic Computing (IJAMC) 12, no.3: 212-231. http://doi.org/10.4018/IJAMC.2021070110

Export Reference

Mendeley
Favorite Full-Issue Download

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.