Improving the modulo simplex algorithm for large-scale periodic timetabling
DOI10.1016/J.COR.2012.08.018zbMATH Open1352.90039OpenAlexW2032583162MaRDI QIDQ502452FDOQ502452
Authors: Marc Goerigk, Anita Schöbel 
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
Recommendations
- Solving periodic timetable optimisation problems by modulo simplex calculations
- The Modulo Network Simplex with Integrated Passenger Routing
- A matching approach for periodic timetabling
- Strong formulations for the multi-module PESP and a quadratic algorithm for graphical Diophantine equation systems
- scientific article; zbMATH DE number 5343212
combinatorial optimizationlarge-scale optimizationperiodic timetablingperiodic event scheduling problem
Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Integer programming (90C10)
Cited In (21)
- Automatic scheduling of periodic event networks by SAT solving
- An improved algorithm for the periodic timetabling problem
- Solving periodic timetable optimisation problems by modulo simplex calculations
- Generalized light robustness and the trade-off between robustness and nominal quality
- A phase I simplex method for finding feasible periodic timetables
- Solving the periodic scheduling problem: an assignment approach in non-periodic networks
- Tree decomposition methods for the periodic event scheduling problem
- Experimental and Efficient Algorithms
- Benders decomposition for the periodic event scheduling problem
- 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
- On the benefit of preprocessing and heuristics for periodic timetabling
- Timetabling with passenger routing
- Approximate cutting plane approaches for exact solutions to robust optimization problems
- Strong formulations for the multi-module PESP and a quadratic algorithm for graphical Diophantine equation systems
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)
