An improved algorithm for the periodic timetabling problem

DOI10.4230/OASICS.ATMOS.2017.12MaRDI QIDQ6571020zbMATH OpenFDO

Authors Marc Goerigk, Christian Liebchen

Publication date 11 July 2024

Full work available at URL https://doi.org/10.4230/OASICS.ATMOS.2017.12

zbMATH Keywords

modulo network simplexperiodic event scheduling problemperiodic timetablingrailway optimisation

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Improving the modulo simplex algorithm for large-scale periodic timetabling
• Performance of algorithms for periodic timetable optimization
• On the benefit of preprocessing and heuristics for periodic timetabling
• Solving periodic timetable optimisation problems by modulo simplex calculations
• The Modulo Network Simplex with Integrated Passenger Routing

Cited in

(2)

• On the split closure of the periodic timetabling polytope
• The tropical and zonotopal geometry of periodic timetables

This page was built for publication: An improved algorithm for the periodic timetabling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6571020)