Online lock scheduling and disruption management

Master thesis (2021)

Authors

R. Hageman Electrical Engineering, Mathematics and Computer Science

Contributors

N. Yorke-Smith Algorithmics - EEMCS (supervisor 1)
Tim Tutenel Macomi B.V. (coach)
J.T. van Essen Discrete Mathematics and Optimization - EEMCS (supervisor 2)
Frits Spieksma Eindhoven University of Technology (supervisor 2)
Faculty
Electrical Engineering, Mathematics and Computer Science
Copyright: © 2021 Rico Hageman
More Info
expand_more

Published Date

11-10-2021

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Abstract

The Port of Antwerp is the second-largest container port in Europe. The rising demand for container transport requires significant investments in infrastructure projects. Macomi helps the Port of Antwerp to determine the effect of different projects on the throughput of the port using simulation. In this thesis, the aim is to create algorithms for the introduced online variant of the lock scheduling problem which are applicable for a real-time simulation. In addition, an algorithmic approach to recover the existing schedule when a vessel is delayed is required. To achieve these goals, three online lock scheduling algorithms are introduced and tested on realistic problem instances. Their run-time is negligible compared to exact methods and the resulting lock schedules are competitive. Assuming a constant lockage duration during scheduling allows the number of interactions to be reduced significantly with a small decrease in lock schedule quality. The online lock scheduling algorithms could also be applied to the problem of disruption management. The results are comparable to the high-performing adaptive large neighbourhood search meta-heuristic.