A mathematical for periodic scheduling problems
SIAM Journal on Discrete Mathematics
Towards a (Max,+) Control Theory for Public TransportationNetworks
Discrete Event Dynamic Systems
A Variable Trip Time Model for Cyclic Railway Timetabling
Transportation Science
The First Optimized Railway Timetable in Practice
Transportation Science
To Wait or Not to Wait? The Bicriteria Delay Management Problem in Public Transportation
Transportation Science
The modeling power of the periodic event scheduling problem: railway timetables-and beyond
ATMOS'04 Proceedings of the 4th international Dagstuhl, ATMOS conference on Algorithmic approaches for transportation modeling, optimization, and systems
Cyclic railway timetabling: a stochastic optimization approach
ATMOS'04 Proceedings of the 4th international Dagstuhl, ATMOS conference on Algorithmic approaches for transportation modeling, optimization, and systems
Online delay management on a single train line
ATMOS'04 Proceedings of the 4th international Dagstuhl, ATMOS conference on Algorithmic approaches for transportation modeling, optimization, and systems
Parallelism for perturbation management and robust plans
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
The computational complexity of delay management
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Integral cycle bases for cyclic timetabling
Discrete Optimization
To Wait or Not to Wait---And Who Goes First? Delay Management with Priority Decisions
Transportation Science
Immunity-based systems revisited: toward systems science for robust and adaptive engineering
Proceedings of the International Conference on Management of Emergent Digital EcoSystems
Information Sciences: an International Journal
A Lagrangian Heuristic for Robustness, with an Application to Train Timetabling
Transportation Science
Railway Rolling Stock Planning: Robustness Against Large Disruptions
Transportation Science
Robustness for a single railway line: Analytical and simulation methods
Expert Systems with Applications: An International Journal
Hi-index | 0.01 |
In the past, much research has been dedicated to compute optimum railway timetables. A typical objective has been the minimization of passenger waiting times. But only the planned nominal waiting times have been addressed, whereas delays as they occur in daily operations have been neglected. Delays have been rather treated mainly in an online context and solved as a separate optimization problem, called delay management. We provide the first computational study which aims at computing delay resistant periodic timetables. In particular we assess the delay resistance of a timetable by evaluating it subject to several delay scenarios to which optimum delay management will be applied. We arrive at computing delay resistant timetables by selecting a new objective function which we design to be somehow in the middle of the traditional simple timetabling objective and the sophisticated delay management objective. This is a slight extension of the concept of ''light robustness'' (LR) as it has been proposed by Fischetti and Monaci [2006. Robust optimization through branch-and-price. In: Proceedings of AIRO]. Moreover, in our application we are able to provide accurate interpretations for the ingredients of LR. We apply this new technique to real-world data of a part of the German railway network of Deutsche Bahn AG. Our computational results suggest that a significant decrease of passenger delays can be obtained at a relatively small price of robustness, i.e. by increasing the nominal travel times of the passengers.