Tackling the berth allocation problem via harmony search algorithm
Berth Allocation Problem (BAP) is a renowned difficult combinatorial optimization problem that plays a crucial role in maritime transportation systems. BAP is categorized as non-deterministic polynomial-time hard (NP-hard) problems, that is very tough to resolve for optimality within an acceptable...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
College of Education, Al-Iraqia University
2024
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/111976/ http://psasir.upm.edu.my/id/eprint/111976/1/2024%20Bilal%20Tackling%20the%20Berth%20Allocation%20Problem%20via%20Harmony%20Search%20Algorithm.pdf |
| _version_ | 1848865824643743744 |
|---|---|
| author | Ahmed, Bilal Hamdan, Hazlina Muhammed, Abdullah Husin, Nor Azura |
| author_facet | Ahmed, Bilal Hamdan, Hazlina Muhammed, Abdullah Husin, Nor Azura |
| author_sort | Ahmed, Bilal |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | Berth Allocation Problem (BAP) is a renowned difficult combinatorial optimization problem that
plays a crucial role in maritime transportation systems. BAP is categorized as non-deterministic polynomial-time
hard (NP-hard) problems, that is very tough to resolve for optimality within an acceptable timeframe. Many
metaheuristic algorithms have been suggested to tackle this problem, and yet, most of these algorithms have some
drawbacks such as they have a weak ability to explore the solution space (they struggle escaping from local
minima) and they face the difficulties to operate on different datasets. Consequently, the need to either enhance the
existing algorithms or utilize a new algorithm is still necessary. Harmony Search Algorithm (HSA) is one of the
recent population-based optimization methods which inspired by modern-nature. HSA has confirmed its ability to
tackle various difficult combinatorial optimization problems like vehicle routing, exam timetabling to name a few.
However, as far as we are concerned, it has never been applied to tackle the BAP problem. The primary objective
of this article is to examine the effectiveness of HSA in solving BAP by identifying suitable values for the
parameters of the HSA and then applying HSA to tackle BAP. Therefore, in this article, the basic HSA is proposed
to tackle the BAP. The suggested HSA is tested on BAP benchmark (I3 dataset) and compared the results with
other latest algorithms found in the literature. The trial outcomes evidenced that the HSA is promising,
competitive, and that it has surpassed some other algorithms that have solved the same dataset, and the results were
very near to the best. |
| first_indexed | 2025-11-15T14:10:51Z |
| format | Article |
| id | upm-111976 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T14:10:51Z |
| publishDate | 2024 |
| publisher | College of Education, Al-Iraqia University |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-1119762024-09-10T06:33:37Z http://psasir.upm.edu.my/id/eprint/111976/ Tackling the berth allocation problem via harmony search algorithm Ahmed, Bilal Hamdan, Hazlina Muhammed, Abdullah Husin, Nor Azura Berth Allocation Problem (BAP) is a renowned difficult combinatorial optimization problem that plays a crucial role in maritime transportation systems. BAP is categorized as non-deterministic polynomial-time hard (NP-hard) problems, that is very tough to resolve for optimality within an acceptable timeframe. Many metaheuristic algorithms have been suggested to tackle this problem, and yet, most of these algorithms have some drawbacks such as they have a weak ability to explore the solution space (they struggle escaping from local minima) and they face the difficulties to operate on different datasets. Consequently, the need to either enhance the existing algorithms or utilize a new algorithm is still necessary. Harmony Search Algorithm (HSA) is one of the recent population-based optimization methods which inspired by modern-nature. HSA has confirmed its ability to tackle various difficult combinatorial optimization problems like vehicle routing, exam timetabling to name a few. However, as far as we are concerned, it has never been applied to tackle the BAP problem. The primary objective of this article is to examine the effectiveness of HSA in solving BAP by identifying suitable values for the parameters of the HSA and then applying HSA to tackle BAP. Therefore, in this article, the basic HSA is proposed to tackle the BAP. The suggested HSA is tested on BAP benchmark (I3 dataset) and compared the results with other latest algorithms found in the literature. The trial outcomes evidenced that the HSA is promising, competitive, and that it has surpassed some other algorithms that have solved the same dataset, and the results were very near to the best. College of Education, Al-Iraqia University 2024-08 Article PeerReviewed text en cc_by_4 http://psasir.upm.edu.my/id/eprint/111976/1/2024%20Bilal%20Tackling%20the%20Berth%20Allocation%20Problem%20via%20Harmony%20Search%20Algorithm.pdf Ahmed, Bilal and Hamdan, Hazlina and Muhammed, Abdullah and Husin, Nor Azura (2024) Tackling the berth allocation problem via harmony search algorithm. Iraqi Journal for Computer Science and Mathematics, 5 (3). pp. 501-512. ISSN 2788-7421 https://journal.esj.edu.iq/index.php/IJCM/article/view/1395 10.52866/ijcsm.2024.05.03.031 |
| spellingShingle | Ahmed, Bilal Hamdan, Hazlina Muhammed, Abdullah Husin, Nor Azura Tackling the berth allocation problem via harmony search algorithm |
| title | Tackling the berth allocation problem via harmony search algorithm |
| title_full | Tackling the berth allocation problem via harmony search algorithm |
| title_fullStr | Tackling the berth allocation problem via harmony search algorithm |
| title_full_unstemmed | Tackling the berth allocation problem via harmony search algorithm |
| title_short | Tackling the berth allocation problem via harmony search algorithm |
| title_sort | tackling the berth allocation problem via harmony search algorithm |
| url | http://psasir.upm.edu.my/id/eprint/111976/ http://psasir.upm.edu.my/id/eprint/111976/ http://psasir.upm.edu.my/id/eprint/111976/ http://psasir.upm.edu.my/id/eprint/111976/1/2024%20Bilal%20Tackling%20the%20Berth%20Allocation%20Problem%20via%20Harmony%20Search%20Algorithm.pdf |