Disjoint congruence classes and a timetabling application
Discrete Applied Mathematics
Computing delay resistant railway timetables
Computers and Operations Research
Engineering the modulo network simplex heuristic for the periodic timetabling problem
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Delay Management with Rerouting of Passengers
Transportation Science
Survey: Cycle bases in graphs characterization, algorithms, complexity, and applications
Computer Science Review
Integral cycle bases for cyclic timetabling
Discrete Optimization
Engineering Applications of Artificial Intelligence
A demand-responsive decision support system for coal transportation
Decision Support Systems
Improving the modulo simplex algorithm for large-scale periodic timetabling
Computers and Operations Research
Computers and Industrial Engineering
| Hi-index | 0.00 |
A short time ago, decision support by operations research methods in railway companies was limited to operations planning (e.g., vehicle scheduling, duty scheduling, crew rostering). In effect since December 12, 2004, the 2005 timetable of the Berlin subway is based on the results of mathematical programming techniques. It is the first such service concept that has been put into daily operation. Profiting from these techniques, compared with the previous timetable, the Berlin subway today operates with a timetable that offers shorter passenger waiting times---both at stops and at transfers---and even saves one train. The work is based on a well-established graph model, the periodic event-scheduling problem (Pesp). This model was introduced as early as 1989. Besides describing in detail its first success story in practice, in this paper we also deepen a result on the asymptotic complexity of the Pesp: we provide MAXSNP-hardness proofs of two natural optimization variants.