An experimental comparison of periodic timetabling models
From MaRDI portal
Recommendations
Cites work
- A Mathematical Model for Periodic Scheduling Problems
- A bicriteria approach for robust timetabling
- Finding short integral cycle bases for cyclic timetabling
- Improving the modulo simplex algorithm for large-scale periodic timetabling
- Integral cycle bases for cyclic timetabling
- Integrating routing decisions in network problems
- Modeling and Solving the Train Timetabling Problem
- Models for railway track allocation
- Nominal and robust train timetabling problems
- Non-cyclic train timetabling and comparability graphs
- Periodic network optimization with different arc frequencies
- Solving periodic timetable optimisation problems by modulo simplex calculations
- Strong formulations for the multi-module PESP and a quadratic algorithm for graphical Diophantine equation systems
- The complexity of integrating routing decisions in public transportation models
Cited in
(19)- Timetabling with passenger routing
- Fewer trains for better timetables: the price of fixed line frequencies in the passenger-oriented timetabling problem
- Periodic timetabling with cyclic order constraints
- Delay resistant line planning with a view towards passenger transfers
- Timetable rearrangement to cope with railway maintenance activities
- Periodic metro scheduling
- A column-generation-based matheuristic for periodic and symmetric train timetabling with integrated passenger routing
- Constructing periodic timetables using MIP -- a case study from DSB S-train
- When periodic timetables are suboptimal
- Simulation Exercise on Time Perception Parameters in Discrete‐time Dynamic Assignment Models
- Introducing TimPassLib -- a library for integrated periodic timetabling and passenger routing
- Railway timetabling with integrated passenger distribution
- Performance of algorithms for periodic timetable optimization
- Periodic railway timetabling with event flexibility
- Parcel Distribution Timetabling Problem with Incomplete Hub Network
- An iterative heuristic for passenger-centric train timetabling with integrated adaption times
- On the benefit of preprocessing and heuristics for periodic timetabling
- Line planning with user-optimal route choice
- Solving the periodic scheduling problem: an assignment approach in non-periodic networks
This page was built for publication: An experimental comparison of periodic timetabling models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336491)