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...
Uloženo v:
| Hlavní autoři: | , , , |
|---|---|
| Médium: | Článek |
| Jazyk: | English |
| Vydáno: |
College of Education, Al-Iraqia University
2024
|
| On-line přístup: | http://psasir.upm.edu.my/id/eprint/111976/1/2024%20Bilal%20Tackling%20the%20Berth%20Allocation%20Problem%20via%20Harmony%20Search%20Algorithm.pdf |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|