Maritime transport is the backbone of global supply chain. Around 80 % of global trade by volume is carried by sea and is handled by ports worldwide. The fierce competition among different ports forces the container port operators to improve the terminal operation efficiency and competitiveness. This research addresses the dynamic and discrete berth allocation problem (BAP) which is critical to the terminal operations. The objective is to minimize the total service times for vessels. To solve the NP-hard BAP problem, we develop a simulated annealing (SA) algorithm to obtain the near optimal solutions. Benchmark instances from the literature are tested for the effectiveness of the proposed SA and compared with other leading heuristics in the literature. Computational results show that our SA is competitive and find the optimal solutions in all instances.
Simulated Annealing Algorithm for Berth Allocation Problems
Proceedings of the Institute of Industrial Engineers Asian Conference 2013 ; Kapitel : 54 ; 449-456
12.07.2013
8 pages
Aufsatz/Kapitel (Buch)
Elektronische Ressource
Englisch
Berth scheduling by simulated annealing
Online Contents | 2003
|Berth scheduling by simulated annealing
Elsevier | 2002
|Enhanced Berth Allocation Using the Cuckoo Search Algorithm
Springer Verlag | 2022
|Berth allocation with service priority
Online Contents | 2003
|Berth allocation with service priority
Elsevier | 2002
|