Abstract
We present a new and more efficient technique for computing the route that maximizes the probability of on-time arrival in stochastic networks, also known as the path-based stochastic on-time arrival (SOTA) problem. Our primary contribution is a pathfinding algorithm that uses the solution to the policy-based SOTA problem—which is of pseudo-polynomial-time complexity in the time budget of the journey—as a search heuristic for the optimal path. In particular, we show that this heuristic can be exceptionally efficient in practice, effectively making it possible to solve the path-based SOTA problem as quickly as the policy-based SOTA problem. Our secondary contribution is the extension of policy-based preprocessing to path-based preprocessing for the SOTA problem. In the process, we also introduce Arc-Potentials, a more efficient generalization of Stochastic Arc-Flags that can be used for both policy- and path-based SOTA. After developing the pathfinding and preprocessing algorithms, we evaluate their performance on two different real-world networks. To the best of our knowledge, these techniques provide the most efficient computation strategy for the path-based SOTA problem for general probability distributions, both with and without preprocessing.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The target objective can in fact be generalized to utility functions other than the probability of on-time arrival [2] with little effect on our algorithms, but for our purposes, we limit our discussion to this scenario.
- 2.
In this article, we only consider time-invariant travel-time distributions. The problem can be extended to incorporate time-varying distributions as discussed in [3].
- 3.
Parmentier and Meunier [13] have concurrently also developed a similar approach concerning stochastic shortest paths with risk measures.
- 4.
It should be noted that the largest network we consider only has approximately 71,000 edges and is still much smaller than networks used to benchmark deterministic shortest path queries, which can have millions of edges [14].
- 5.
As explained later, there is a potential pitfall that must be avoided when the preprocessed policy is to be used as a heuristic for the path.
- 6.
We assume that at most one edge exists between any pair of nodes in each direction.
- 7.
The bounds of this integral can be slightly tightened through inclusion of the minimum travel times, but this has been omitted for simplicity.
- 8.
Recall that we must have \(\varDelta t \le \min _{(i,j)\in E} \delta _{ij}\), which is \(\approx 1\,\mathrm {s}\) for our networks.
References
Fan, Y., Robert Kalaba, J.E., Moore, I.I.: Arriving on time. J. Optim. Theor. Appl. 127(3), 497–513 (2005)
Flajolet, A., Blandin, S., Jaillet, P.: Robust adaptive routing under uncertainty (2014). arXiv:1408.3374
Samaranayake, S., Blandin, S., Bayen, A.: A tractable class of algorithms for reliable routing in stochastic networks. Transp. Res. Part C 20(1), 199–217 (2012)
Nie, Y.M., Wu, X.: Shortest path problem considering on-time arrival probability. Trans. Res. Part B Methodol. 43(6), 597–613 (2009)
Fan, Y., Nie, Y.: Optimal routing for maximizing travel time reliability. Netw. Spat. Econ. 6(3–4), 333–344 (2006)
Dean, B.C.: Speeding up stochastic dynamic programming with zero-delay convolution. Algorithmic Oper. Res. 5(2), 96 (2010)
Samaranayake, S., Blandin, S., Bayen, A.: Speedup techniques for the stochastic on-time arrival problem. In: ATMOS, pp. 83–96 (2012)
Sabran, G., Samaranayake, S., Bayen, A.: Precomputation techniques for the stochastic on-time arrival problem. In: SIAM, ALENEX, pp. 138–146 (2014)
Gutman, R.: Reach-based routing: a new approach to shortest path algorithms optimized for road networks. In: ALENEX/ANALC, pp. 100–111 (2004)
Hilger, M., Köhler, E., Möhring, R., Schilling, H.: Fast point-to-point shortest path computations with Arc-Flags. Ninth DIMACS Implementation Challenge 74, 41–72 (2009)
Nikolova, E., Kelner, J.A., Brand, M., Mitzenmacher, M.: Stochastic shortest paths via quasi-convex maximization. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 552–563. Springer, Heidelberg (2006)
Lim, S., Sommer, C., Nikolova, E., Rus, D.: Practicalroute planning under delay uncertainty: stochastic shortest path queries. Robot. Sci. Syst. 8(32), 249–256 (2013)
Parmentier, A., Meunier, F.: Stochastic shortest paths and risk measures (2014). arXiv:1408.0272
Delling, D., Sanders, P., Schultes, D., Wagner, D.: Engineering route planning algorithms. In: Lerner, J., Wagner, D., Zweig, K.A. (eds.) Algorithmics of Large and Complex Networks. LNCS, vol. 5515, pp. 117–139. Springer, Heidelberg (2009)
Gardner, W.G.: Efficient convolution without input/output delay. In: Audio engineering society convention 97. Audio Engineering Society (1994)
Dechter, R., Pearl, J.: Generalized best-first search strategies and the optimality of \(A^*\). J. ACM (JACM) 32(3), 505–536 (1985)
Russell, S.J., Norvig, P.: Artificial Intelligence: A Modern Approach. Prentice-Hall Inc., London (1995). ISBN 0-13-103805-2
Abraham, I., Fiat, A., Goldberg, A., Werneck, R.: Highway dimension, shortest paths, and provably efficient algorithms. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 782–793. Society for Industrial and Applied Mathematics (2010)
Goldberg, A., Kaplan, H., Werneck, R.: Reach for \(A^*\): efficient point-to-point shortest path algorithms. In: ALENEX, vol. 6, pp. 129–143. SIAM (2006)
Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction hierarchies: faster and simpler hierarchical routing in road networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 319–333. Springer, Heidelberg (2008)
Bast, H., Funke, S., Matijevic, D.: Transit: ultrafast shortest-path queries with linear-time preprocessing. In: 9th DIMACS Implementation Challenge [1] (2006)
D’Angelo, G., Frigioni, D., Vitale, C.: Dynamic arc-flags in road networks. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 88–99. Springer, Heidelberg (2011)
Hunter, T., Abbeel, P., Bayen, A.M.: The path inference filter: model-based low-latency map matching of probe vehicle data. In: Frazzoli, E., Lozano-Perez, T., Roy, N., Rus, D. (eds.) Algorithmic Foundations of Robotics X. STAR, vol. 86, pp. 591–607. Springer, Heidelberg (2013)
Lim, S., Balakrishnan, H., Gifford, D., Madden, S., Rus, D.: Stochastic motion planning and applications to traffic. Int. J. Robot. Res. 3–13 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Niknami, M., Samaranayake, S. (2016). Tractable Pathfinding for the Stochastic On-Time Arrival Problem. In: Goldberg, A., Kulikov, A. (eds) Experimental Algorithms. SEA 2016. Lecture Notes in Computer Science(), vol 9685. Springer, Cham. https://doi.org/10.1007/978-3-319-38851-9_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-38851-9_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-38850-2
Online ISBN: 978-3-319-38851-9
eBook Packages: Computer ScienceComputer Science (R0)