Last week I went to the “Mini-Workshop on Integrated Timetabling” in Göttingen, though I wonder if “mini” is the appropriate name for a three-day event? We enjoyed excellent talks on various combinations of timetabling with other problems in public transport. My own presentation was on “A New Robust Local Search Method and its Application to Uncertain Timetabling“, with the abstract below:
Railway timetabling problems are challenging to solve, even if all problem parameters are known exactly. If travel times are uncertain, as is the case in practice, finding good solutions is even harder.
I introduce a new local search technique to find robust solutions under implementation errors. In this setting, not the problem parameters are considered uncertain, but the actual implementation of a solution has an error margin. I first discuss an existing general approach to this problem by Bertsimas, Nohadani and Teo. I then introduce a new approach that is able to overcome local optima, and discuss its application to the train timetabling problem. While this is still work in progress, some first experimental results are presented.
I then went on to Osnabrück and gave a seminar talk on robust selection problems.
A lot has been written about solving robust problems when one knows exactly what the set of possible parameter realisations looks like. With the variable-sized robustness approach we have considered an alternative setting, in which the size of uncertainty is not really known. Still, we assume that the shape is given.
In a recent paper with the title “An Experimental Comparison of Uncertainty Sets for Robust Shortest Path Problems”, we go back another step and evaluate which uncertainty sets actually make sense for shortest path problems. We use actual real-world traffic data to generate uncertainty sets and compare the performance of the resulting solutions. It turns out that hardness of the robust problem is not really an indicator for the usefulness of the resulting paths. See for yourself!
Through the development of efficient algorithms, data structures and preprocessing techniques, real-world shortest path problems in street networks are now very fast to solve. But in reality, the exact travel times along each arc in the network may not be known. This lead to the development of robust shortest path problems, where all possible arc travel times are contained in a so-called uncertainty set of possible outcomes.
Research in robust shortest path problems typically assumes this set to be given, and provides complexity results as well as algorithms depending on its shape. However, what can actually be observed in real-world problems are only discrete raw data points. The shape of the uncertainty is already a modelling assumption. In this paper we test several of the most widely used assumptions on the uncertainty set using real-world traffic measurements provided by the City of Chicago. We calculate the resulting different robust solutions, and evaluate which uncertainty approach is actually reasonable for our data. This anchors theoretical research in a real-world application and allows us to point out which robust models should be the future focus of algorithmic development.
There is a delightful new video about our department on YouTube. Highly recommended!
Not to be missed is also a slightly outdated precursor about Management Science in Lancaster.