Determining operations affected by delay in predictive train timetables
From MaRDI portal
Recommendations
Cites work
- A branch and bound algorithm for scheduling trains in a railway network
- A disjunctive graph model and framework for constructing new train schedules
- A sequencing approach for creating new train timetables
- Algorithms for transitive closure
- Computing delay resistant railway timetables
- Determining operations affected by delay in predictive train timetables
- Dynamic shortest paths and transitive closure: algorithmic techniques and data structures
- Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
- Nominal and robust train timetabling problems
- Scheduling trains as a blocking parallel-machine job shop scheduling problem
- Scheduling trains on parallel lines with crossover points
- Simultaneous disruption recovery of a train timetable and crew roster in real time
- Techniques for restricting multiple overtaking conflicts and performing compound moves when constructing new train schedules
- The train driver recovery problem-a set partitioning based model and solution method
Cited in
(8)- Managing and preventing delays in railway traffic by simulation and optimization
- Mining railway delay dependencies in large-scale real-world delay data
- An iterative approach for reducing the impact of infrastructure maintenance on the performance of railway systems
- A new constraint programming approach for optimising a coal rail system
- Determining operations affected by delay in predictive train timetables
- Optimal allocation of buffer times to increase train schedule robustness
- Testing schedule performance and reliability for train stations
- Probabilistic simulation of a railway timetable
This page was built for publication: Determining operations affected by delay in predictive train timetables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336779)