Timetabling with passenger routing
From MaRDI portal
Publication:2260893
Recommendations
- The complexity of integrating routing decisions in public transportation models
- The complexity of integrating passenger routing decisions in public transportation models
- The Modulo Network Simplex with Integrated Passenger Routing
- Introducing TimPassLib -- a library for integrated periodic timetabling and passenger routing
- Railway timetabling with integrated passenger distribution
Cites work
- scientific article; zbMATH DE number 5117501 (Why is no real title available?)
- scientific article; zbMATH DE number 3961334 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2042677 (Why is no real title available?)
- A Mathematical Model for Periodic Scheduling Problems
- A bicriteria approach for robust timetabling
- A threshold of ln n for approximating set cover
- An empirical analysis of robustness concepts for timetabling
- An experimental comparison of periodic timetabling models
- Efficient probabilistically checkable proofs and applications to approximations
- Improving the modulo simplex algorithm for large-scale periodic timetabling
- Integrating routing decisions in network problems
- Integrating routing decisions in public transportation problems
- Light robustness
- Line planning in public transportation: models and methods
- Line planning with minimal traveling time
- Models for line planning in public transport
- Optimization in public transportation. Stop location, delay management and tariff zone design in a public transportation network
- Performance of algorithms for periodic timetable optimization
- Periodic Timetable Optimization in Public Transport
- Railway track allocation: Models and methods
- Solving periodic timetable optimisation problems by modulo simplex calculations
- The complexity of integrating routing decisions in public transportation models
- The concept of recoverable robustness, linear programming recovery, and railway applications
Cited in
(13)- The complexity of integrating routing decisions in public transportation models
- Public transport for smart cities: recent innovations and future challenges
- Line planning with user-optimal route choice
- Railway timetabling with integrated passenger distribution
- An iterative heuristic for passenger-centric train timetabling with integrated adaption times
- Integrating Passengers' Routes in Periodic Timetabling: A SAT approach.
- “Make no little plans”: Impactful research to solve the next generation of transportation problems
- Integrated timetabling and vehicle scheduling with balanced departure times
- Introducing TimPassLib -- a library for integrated periodic timetabling and passenger routing
- Integrating routing decisions in network problems
- The blockwise coordinate descent method for integer programs
- The complexity of integrating passenger routing decisions in public transportation models
- A direct connection approach to integrated line planning and passenger routing
This page was built for publication: Timetabling with passenger routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2260893)