Improving the modulo simplex algorithm for large-scale periodic timetabling

DOI10.1016/j.cor.2012.08.018zbMath1352.90039OpenAlexW2032583162MaRDI QIDQ502452

Anita Schöbel, Marc Goerigk

Publication date: 5 January 2017

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.08.018

zbMATH Keywords

large-scale optimizationcombinatorial optimizationperiodic timetablingperiodic event scheduling problem

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (11)

An experimental comparison of periodic timetabling models ⋮ Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling ⋮ Delay resistant line planning with a view towards passenger transfers ⋮ Introducing TimPassLib -- a library for integrated periodic timetabling and passenger routing ⋮ Integrating Passengers' Routes in Periodic Timetabling: A SAT approach. ⋮ A Matching Approach for Periodic Timetabling ⋮ Generalized light robustness and the trade-off between robustness and nominal quality ⋮ A robust bus evacuation model with delayed scenario information ⋮ Timetabling with passenger routing ⋮ On the Benefit of Preprocessing and Heuristics for Periodic Timetabling ⋮ Approximate cutting plane approaches for exact solutions to robust optimization problems

This page was built for publication: Improving the modulo simplex algorithm for large-scale periodic timetabling