Document Open Access Logo

Shortest Path with Alternatives for Uniform Arrival Times: Algorithms and Experiments

Authors Tim Nonner, Marco Laumanns

Thumbnail PDF


  • Filesize: 0.53 MB
  • 10 pages

Document Identifiers

Author Details

Tim Nonner
Marco Laumanns

Cite AsGet BibTex

Tim Nonner and Marco Laumanns. Shortest Path with Alternatives for Uniform Arrival Times: Algorithms and Experiments. In 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. Open Access Series in Informatics (OASIcs), Volume 42, pp. 15-24, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)


The Shortest Path with Alternatives (SPA) policy differs from classical shortest path routing in the following way: instead of providing an exact list of means of transportation to follow, this policy gives such a list for each stop, and the traveler is supposed to pick the first option from this list when waiting at some stop. First, we show that an optimal policy of this type can be computed in polynomial time for uniform arrival times under reasonable assumptions. A similar result was so far only known for Poisson arrival times, which are less realistic for frequency-based public transportation systems. Second, we experimentally evaluate such policies. In this context, our main finding is that SPA policies are surprisingly competitive compared to traditional shortest paths, and moreover yield a significant reduction of waiting times, and therefore improvement of user experience, compared to similar greedy approaches. Specifically, for roughly 25% of considered cases, we could decrease the expected waiting time by at least 20%. To run our experiments, we also describe a tool-chain to derive the necessary information from the popular GTFS-format, therefore allowing the application of SPA policies to a wide range of public transportation systems.
  • Shortest Path
  • Stochastic Optimization
  • Public Transportation


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Utku Günay Acer, Paolo Giaccone, David Hay, Giovanni Neglia, and Saed Tarapiah. Timely data delivery in a realistic bus network. IEEE Transactions on Vehicular Technology, 61(3):1251-1265, 2012. Google Scholar
  2. Hannah Bast, Daniel Delling, Andrew Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, and Renato Werneck. Route planning in transportation networks. Technical Report MSR-TR-2014-4, Microsoft Research, January 2014. Google Scholar
  3. Hannah Bast and Sabine Storandt. Flow-based guidebook routing. In Proceedings of the 16th Workshop on Algorithm Engineering and Experiments (ALENEX'14), pages 155-165, 2014. Google Scholar
  4. Dimitri P. Bertsekas and John N. Tsitsiklis. An analysis of stochastic shortest path problems. Math. Oper. Res., 16:580-595, August 1991. Google Scholar
  5. Justin Boyan and Michael Mitzenmacher. Improved results for route planning in stochastic transportation. In Proceedings of the 12th annual ACM-SIAM Symposium on Discrete Algorithms (SODA'01), pages 895-902, 2001. Google Scholar
  6. Mayur Datar and Abhiram G. Ranade. Commuting with delay prone buses. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'00), pages 22-29, 2000. Google Scholar
  7. Julian Dibbelt, Thomas Pajor, Ben Strasser, and Dorothea Wagner. Intriguingly simple and fast transit routing. In Proceedings of the 12th International Symposium on Experimental Algorithms (SEA'13), pages 43-54, 2013. Google Scholar
  8. Evdokia Nikolova, Jonathan A Kelner, Matthew Brand, and Michael Mitzenmacher. Stochastic shortest paths via quasi-convex maximization. In Proceedings of the 14th Annual European Symposium on Algorithms (ESA'06), pages 552-563. Springer, 2006. Google Scholar
  9. Tim Nonner. Polynomial-time approximation schemes for shortest path with alternatives. In Proceedings of the 20th Annual European Symposium on Algorithms (ESA'12), pages 755-765, 2012. Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail