Beyond Static Parameters: Adaptive Simulated Annealing in Practice
A case study on environmentally-aware lockage scheduling for the North Sea Locks
J. Heijne (TU Delft - Electrical Engineering, Mathematics and Computer Science)
Neil Yorke-Smith – Mentor (TU Delft - Electrical Engineering, Mathematics and Computer Science)
Paweł Kołodziejczyk – Mentor (Macomi B.V.)
Vasso Reppa – Graduation committee member (TU Delft - Mechanical Engineering)
More Info
expand_more
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.
Abstract
The North Sea Locks connect the saline Western Scheldt to the Terneuzen-Gent canal, requiring efficient scheduling of vessels. While current scheduling models minimise vessel delays, lockages also cause freshwater loss and salt intrusion into the canal, negatively affecting drinking water, agriculture, and the surrounding ecosystem. This thesis extends an existing simulated annealing scheduling model with water loss and salt intrusion objectives, and evaluates adaptive hyperparameter mechanisms to reduce the burden of empirical tuning. The results confirm a direct tradeoff between the environmental impact and vessel delays; incorporating environmental objectives yields significant reductions in freshwater loss and salt intrusion at the cost of increased vessel delays. Among the adaptive approaches, those guided by domain-specific information, such as tidal conditions and salinity levels, show performance improvements. General approaches from the literature, specifically the Modified Lam Annealing schedule and memory-based neighbourhood selection, do not transfer effectively to the North Sea Lock scheduling problem. These findings suggest that for domain-specific optimisation problems, problem-specific adaptive mechanisms outperform general-purpose ones, and that meaningful environmental gains in lock scheduling are achievable through optimisation alone.