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...
Saved in:
| Main Authors: | Ahmed, Bilal, Hamdan, Hazlina, Muhammed, Abdullah, Husin, Nor Azura |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
College of Education, Al-Iraqia University
2024
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/111976/1/2024%20Bilal%20Tackling%20the%20Berth%20Allocation%20Problem%20via%20Harmony%20Search%20Algorithm.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Review on the parameter settings in harmony search algorithm applied to combinatorial optimization problems
by: Ahmed, Bilal, et al.
Published: (2022) -
Recent Advances in Harmony Search Algorithm
by: Geem, Zong Woo., et al.
Published: (2010) -
Harmony search algorithm for location-routing problem in supply chain network design
by: Misni, F., et al.
Published: (2019) -
Harmony search for multi-depot vehicle routing problem
by: Misni, F., et al.
Published: (2019) -
Ballast water from ships berthed at major ports of Malaysia
by: Rohaida Mat Husain, et al.
Published: (2021)
