Minimizing the Total Service Time of Discrete Dynamic Berth Allocation Problem by an Iterated Greedy Heuristic

Abstract EN

Berth allocation is the forefront operation performed when ships arrive at a port and is a critical task in container port optimization.

Minimizing the time ships spend at berths constitutes an important objective of berth allocation problems.

This study focuses on the discrete dynamic berth allocation problem (discrete DBAP), which aims to minimize total service time, and proposes an iterated greedy (IG) algorithm to solve it.

The proposed IG algorithm is tested on three benchmark problem sets.

Experimental results show that the proposed IG algorithm can obtain optimal solutions for all test instances of the first and second problem sets and outperforms the best-known solutions for 35 out of 90 test instances of the third problem set.