Improving the modulo simplex algorithm for large-scale periodic timetabling

DOI10.1016/J.COR.2012.08.018zbMATH Open1352.90039OpenAlexW2032583162MaRDI QIDQ502452FDOQ502452

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

combinatorial optimizationlarge-scale optimizationperiodic timetablingperiodic event scheduling problem

Mathematics Subject Classification ID

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

Cited In (12)

• Generalized light robustness and the trade-off between robustness and nominal quality
• On the Benefit of Preprocessing and Heuristics for Periodic Timetabling
• A Matching Approach for Periodic Timetabling
• Integrating Passengers' Routes in Periodic Timetabling: A SAT approach.
• A robust bus evacuation model with delayed scenario information
• Introducing TimPassLib -- a library for integrated periodic timetabling and passenger routing
• An experimental comparison of periodic timetabling models
• Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling
• A large scale timetabling problem
• Delay resistant line planning with a view towards passenger transfers
• Timetabling with passenger routing
• 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

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