Reliability in public transit networks considering backup itineraries
From MaRDI portal
(Redirected from Publication:2116902)
Recommendations
- Robust routing in urban public transportation: how to find reliable journeys based on past observations
- Is timetabling routing always reliable for public transport?
- Arrival time dependent routing policies in public transport
- Dynamic journeying under uncertainty
- Finding reliable shortest paths in road networks under uncertainty
Cites work
- scientific article; zbMATH DE number 1488064 (Why is no real title available?)
- A note on two problems in connexion with graphs
- An Appraisal of Some Shortest-Path Algorithms
- Dynamic journeying under uncertainty
- Equilibrium traffic assignment for large scale transit networks
- Finding optimal hyperpaths in large transit networks with realistic headway distributions
- Intriguingly simple and fast transit routing
- Itinerary planning with time budget for risk-averse travelers
- Least expected time paths in stochastic, time-varying transportation networks
- Optimal path problems with second-order stochastic dominance constraints
- Optimal routing for maximizing the travel time reliability
- Vehicle routing with soft time windows and Erlang travel times
This page was built for publication: Reliability in public transit networks considering backup itineraries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2116902)