Heuristics for a berth allocation problem with additional constraints on the movement of the quay cranes

This thesis explores the berth allocation and crane assignment problem, with in particularly the heuristics and meta-heuristics construction heuristic, local refinements, squeaky wheel optimisation, tabu search and simulated annealing. The speed and cost are examined and it is found that the tabu search is the best performing meta-heuristic. Further, the movement of the quay cranes are restricted along a rail so that the different quay cranes cannot pass each other. A scenario where maintenance needs to be done on a quay crane is also explored.