Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Speedup Techniques for the Stochastic on-time Arrival Problem

4 references·9 citing·32 second hop

FromToDepth

this work references cited by second hop

References

2005Arriving on Time164 cited
2011A tractable class of algorithms for reliable routing in stochastic networks75 cited
2009Reliable a Priori Shortest Path Problem with Limited Spatial and Temporal Dependencies65 cited
2006Arriving-on-Time Problem: Discrete Algorithm That Ensures Convergence60 cited

Cited by

2013Precomputation techniques for the stochastic on-time arrival problem23 cited
2016Tractable Pathfinding for the Stochastic On-Time Arrival Problem20 cited
2018Robust routing, its price, and the tradeoff between routing robustness and travel time reliability in road networks17 cited
2017Churn prediction analysis using various clustering algorithms in KNIME analytics platform14 cited
2015Stability of Transportation Networks Under Adaptive Routing Policies8 cited
2019Approximation of the road segments travel time using Levy distributions in the reliable shortest path problem8 cited
2021GP4: Gaussian Process Proactive Path Planning for the Stochastic on Time Arrival Problem7 cited
2018Arrival time dependent routing policies in public transport6 cited
2018Traffic-Aware Routing in Road Networks6 cited

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