Logo of Humboldt-Universität zu BerlinLogo of Humboldt-Universität zu Berlin
edoc-Server
Open-Access-Publikationsserver der Humboldt-Universität
de|en
Header image: facade of Humboldt-Universität zu Berlin
View Item 
  • edoc-Server Home
  • Elektronische Zeitschriften
  • Stochastic Programming E-print Series (SPEPS)
  • Volume 2012
  • View Item
  • edoc-Server Home
  • Elektronische Zeitschriften
  • Stochastic Programming E-print Series (SPEPS)
  • Volume 2012
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
All of edoc-ServerCommunity & CollectionTitleAuthorSubjectThis CollectionTitleAuthorSubject
PublishLoginRegisterHelp
StatisticsView Usage Statistics
All of edoc-ServerCommunity & CollectionTitleAuthorSubjectThis CollectionTitleAuthorSubject
PublishLoginRegisterHelp
StatisticsView Usage Statistics
View Item 
  • edoc-Server Home
  • Elektronische Zeitschriften
  • Stochastic Programming E-print Series (SPEPS)
  • Volume 2012
  • View Item
  • edoc-Server Home
  • Elektronische Zeitschriften
  • Stochastic Programming E-print Series (SPEPS)
  • Volume 2012
  • View Item
2012-10-31Buch DOI: 10.18452/8428
Optimizing existing railway timetables by means of stochastic programming
Vekas, Peter
Vlerk, Maarten H. van der
Haneveld, Willem K. Klein
We present some models to find the best allocation of a limited amount of so-called runningtime supplements (extra minutes added to a timetable to reduce delays) on a railway line. Bythe 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 alreadyexisting and well-functioning one. We model this inherently stochastic optimization problemby using two-stage recourse models from stochastic programming, following Vromans [9]. Wepresent an improved formulation, allowing for an efficient solution using a standard algorithmfor recourse models. We include a case study that we managed to solve about 180 times fasterthan 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 practicepromises a significant improvement in the punctuality of trains. A technique to estimate themodel parameters from empirical data and an approximating deterministic problem are alsopresented, along with some practical ideas that are meant to enhance the applicability of ourmodels.
Files in this item
Thumbnail
8.pdf — Adobe PDF — 376.3 Kb
MD5: 1b7435fda35b211a41bda5790adbac6b
Cite
BibTeX
EndNote
RIS
InCopyright
Details
DINI-Zertifikat 2019OpenAIRE validatedORCID Consortium
Imprint Policy Contact Data Privacy Statement
A service of University Library and Computer and Media Service
© Humboldt-Universität zu Berlin
 
DOI
10.18452/8428
Permanent URL
https://doi.org/10.18452/8428
HTML
<a href="https://doi.org/10.18452/8428">https://doi.org/10.18452/8428</a>