%0 kein reference type
%A Peter Vekas
%A Maarten H. van der Vlerk
%A Willem K. Klein Haneveld
%T Optimizing existing railway timetables by means of stochastic programming
%S Stochastic Programming E-Print Series
%! SPEPS
%D 2012-10-31
%8 published on edoc: 2012-11-05T13:15:00Z
%8 access: 2016-12-08T07:52:12Z
%I Institut für Mathematik
%E
Julie L. Higle
%E
Werner Römisch
%E
Surrajeet SenWernerRömischSurrajeetSen%X (Abstract) We present some models to find the best allocation of a limited amount of so-called running time supplements (extra minutes added to a timetable to reduce delays) on a railway line. By the best allocation, we mean the solution under which the sum of expected delays is minimal. Instead of trying to invent a completely new timetable, our aim is to finely adjust an already existing and well-functioning one. We model this inherently stochastic optimization problem by using two-stage recourse models from stochastic programming, following Vromans [9]. We present an improved formulation, allowing for an efficient solution using a standard algorithm for recourse models. We include a case study that we managed to solve about 180 times faster than it was solved in [9]. By comparing our solution with other, seemingly intuitive solutions, we show that finding the best allocation is not obvious, and implementing it in practice promises a significant improvement in the punctuality of trains. A technique to estimate the model parameters from empirical data and an approximating deterministic problem are also presented, along with some practical ideas that are meant to enhance the applicability of our models.
%Z unpublished
%K (DDC) Mathematik
%U http://edoc.hu-berlin.de/docviews/abstract.php?id=39698
%U urn:nbn:de:kobv:11-100205493
%J 82012