Reliability in public transit networks considering backup itineraries

DOI10.1016/j.ejor.2021.08.029zbMath1506.90077OpenAlexW3194557381MaRDI QIDQ2116902

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

zbMATH Keywords

transportationcontingency planningpublic transitbackup itinerariesstochastic network searchtravel reliability

Mathematics Subject Classification ID

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

• Unnamed Item
• A note on two problems in connexion with graphs
• Optimal path problems with second-order stochastic dominance constraints
• Optimal routing for maximizing the travel time reliability
• Equilibrium traffic assignment for large scale transit networks
• Itinerary planning with time budget for risk-averse travelers
• Dynamic journeying under uncertainty
• Finding optimal hyperpaths in large transit networks with realistic headway distributions
• Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks
• Intriguingly Simple and Fast Transit Routing
• Vehicle routing with soft time windows and Erlang travel times
• An Appraisal of Some Shortest-Path Algorithms

This page was built for publication: Reliability in public transit networks considering backup itineraries