Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

Multi-Armed Bandit On-Time Arrival Algorithms for Sequential Reliable Route Selection under Uncertainty

16 references·3 citing·34 second hop

FromToDepth

this work references cited by second hop

References

2002Finite-time Analysis of the Multiarmed Bandit Problem5,980 cited
1982THE SCHEDULING OF CONSUMER ACTIVITIES: WORK TRIPS1,083 cited
2011Analysis of Thompson Sampling for the multi-armed bandit problem904 cited
1990Economics of a bottleneck655 cited
1986The Fastest Path through a Network with Random Time-Dependent Travel Times404 cited
2009Shortest path problem considering on-time arrival probability308 cited
1981Schedule Delay and Departure Time Decisions in a Deterministic Model300 cited
2004Adaptive routing with end-to-end feedback190 cited
2011Analytic Relationships between Travel Time Reliability Measures180 cited
2005Arriving on Time164 cited
2007The on-line shortest path problem under partial monitoring151 cited
2001An adaptive routing algorithm for in-vehicle route guidance systems with real-time information149 cited
2012Finding Reliable Shortest Paths in Road Networks Under Uncertainty149 cited
2011Regret theory-based route choices and traffic equilibria146 cited
2005Path finding under uncertainty137 cited
2005

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

Shortest paths in stochastic networks with correlated link costs

132 cited

Cited by

2020Contextual Bandit-Based Sequential Transit Route Design under Demand Uncertainty14 cited
2024A sequential transit network design algorithm with optimal learning under correlated beliefs7 cited
2024City metro network expansion based on multi-objective reinforcement learning4 cited