Speedup techniques for the stochastic on-time arrival problem

DOI10.4230/OASICS.ATMOS.2012.83MaRDI QIDQ2918965zbMATH OpenOpenAlexFDO

Authors Samitha Samaranayake, Sebastien Blandin, Alex Bayen

Publication date 2 October 2012

Full work available at URL https://doi.org/10.4230/OASIcs.ATMOS.2012.83

zbMATH Keywords

dynamic programmingstochastic routingtraffic information systems

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Stochastic network models in operations research (90B15) Traffic problems in operations research (90B20) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Precomputation techniques for the stochastic on-time arrival problem
• Arriving on time
• Maximizing the probability of arriving on time
• Time-dependent route planning
• Time-Dependent SHARC-Routing

Cited in

(8)

• Arrival time dependent routing policies in public transport
• Robust routing, its price, and the tradeoff between routing robustness and travel time reliability in road networks
• Meeting a deadline: shortest paths on stochastic directed acyclic graphs with information gathering
• Algorithms for non-linear and stochastic resource constrained shortest path
• Arriving on time
• Maximizing the probability of arriving on time
• Robust adaptive routing under uncertainty
• Precomputation techniques for the stochastic on-time arrival problem

This page was built for publication: Speedup techniques for the stochastic on-time arrival problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2918965)