Reliability in public transit networks considering backup itineraries
DOI10.1016/J.EJOR.2021.08.029zbMATH Open1506.90077OpenAlexW3194557381MaRDI QIDQ2116902FDOQ2116902
Michael Redmond, Jan Fabian Ehmke, Ann Melissa Campbell
Publication date: 18 March 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.08.029
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
transportationcontingency planningpublic transitbackup itinerariesstochastic network searchtravel reliability
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Stochastic network models in operations research (90B15) Traffic problems in operations research (90B20)
Cites Work
- A note on two problems in connexion with graphs
- Optimal path problems with second-order stochastic dominance constraints
- Least expected time paths in stochastic, time-varying transportation networks
- Vehicle routing with soft time windows and Erlang travel times
- Title not available (Why is that?)
- Optimal routing for maximizing the travel time reliability
- An Appraisal of Some Shortest-Path Algorithms
- Equilibrium traffic assignment for large scale transit networks
- Dynamic journeying under uncertainty
- Intriguingly Simple and Fast Transit Routing
- Itinerary planning with time budget for risk-averse travelers
- Finding optimal hyperpaths in large transit networks with realistic headway distributions
Cited In (1)
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)
