SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Arrival time dependent routing policies in public transport
9 references·0 citing·26 second hop
Arrival time dependent routing policies in public transport (2018)Arrival time dependent routing policies i…Stochastic Route Planning in Public Transport (2017)Stochastic Route Planning in …Constraint reformulation and a Lagrangian relaxation-based solution algorithm for a least expected time path problem (2013)Constraint reformulation and …13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (2013)13th Workshop on Algorithmic …Speedup Techniques for the Stochastic on-time Arrival Problem (2012)Speedup Techniques for the St…A tractable class of algorithms for reliable routing in stochastic networks (2011)A tractable class of algorith…Optimal Routing for Maximizing the Travel Time Reliability (2006)Optimal Routing for Maximizin…Arriving-on-Time Problem: Discrete Algorithm That Ensures Convergence (2006)Arriving-on-Time Problem: Dis…Arriving on Time (2005)Arriving on TimeThe Fastest Path through a Network with Random Time-Dependent Travel Times (1986)The Fastest Path through a Ne…Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks (2000)Modeling stochastic perception error in the mean-excess traffic equilibrium model (2011)Real-time traveler information for optimal adaptive routing in stochastic time-dependent networks (2011)Optimizing on-time arrival probability and percentile travel time for elementary path finding in time-dependent transportation networks: Linear mixed integer programming reformulations (2016)Expected shortest paths in dynamic and stochastic traffic networks (1998)Finding the most reliable path with and without link travel time correlation: A Lagrangian substitution based approach (2011)Travel time reliability in transportation networks: A review of methodological developments (2022)Lectures on Stochastic Programming: Modeling and Theory (2009)Fault tree analysis combined with quantitative analysis for high-speed railway accidents (2015)Reliable a Priori Shortest Path Problem with Limited Spatial and Temporal Dependencies (2009)Precomputation techniques for the stochastic on-time arrival problem (2013)Tractable Pathfinding for the Stochastic On-Time Arrival Problem (2016)Robust routing, its price, and the tradeoff between routing robustness and travel time reliability in road networks (2018)Shortest path problem considering on-time arrival probability (2009)Cooperative game approaches to measuring network reliability considering paradoxes (2010)An outer approximation algorithm for the robust shortest path problem (2013)The α-reliable path problem in stochastic road networks with link correlations: A moment-matching-based path finding algorithm (2018)Application of Lagrangian relaxation approach to α-reliable path finding in stochastic networks with correlated link travel times (2015)Maximizing the Probability of Arriving on Time: A Practical Q-Learning Method (2017)An energy-efficient reliable path finding algorithm for stochastic road networks with electric vehicles (2019)Developing an urban public passenger transport route network with account for natural resource limitations (2018)A run-based optimal strategy search method in intelligent stochastic transit networks (2019)Structure of Public Passenger Transport Lines in the Region of Prešov in Slovakia to Support the Development of an Integrated Transport System (2024)Engineering graph-based models for dynamic timetable information systems (2017)Machine learning methods for short-term probability of default: A comparison of classification, regression and ranking methods (2021)Estimating the robustness of public transport schedules using machine learning (2022)
this work references cited by second hop

References

  • 1986The Fastest Path through a Network with Random Time-Dependent Travel Times404 cited
  • 2005Arriving on Time164 cited
  • 2013Constraint reformulation and a Lagrangian relaxation-based solution algorithm for a least expected time path problem128 cited
  • 2006Optimal Routing for Maximizing the Travel Time Reliability101 cited
  • 2011A tractable class of algorithms for reliable routing in stochastic networks75 cited
  • 2006Arriving-on-Time Problem: Discrete Algorithm That Ensures Convergence60 cited
  • 201313th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems59 cited
  • 2012Speedup Techniques for the Stochastic on-time Arrival Problem24 cited
  • 2017Stochastic Route Planning in Public Transport14 cited

Cited by

No citing works inside the corpus for this window.

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work