Document Open Access Logo

Routing in Stochastic Public Transit Networks

Authors Barbara Geissmann, Lukas Gianinazzi

PDF
Thumbnail PDF

File

OASIcs.ATMOS.2019.4.pdf
  • Filesize: 0.51 MB
  • 18 pages

Document Identifiers

Author Details

Barbara Geissmann
  • Department of Computer Science, ETH Zurich, Switzerland
Lukas Gianinazzi
  • Department of Computer Science, ETH Zurich, Switzerland

Cite AsGet BibTex

Barbara Geissmann and Lukas Gianinazzi. Routing in Stochastic Public Transit Networks. In 19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2019). Open Access Series in Informatics (OASIcs), Volume 75, pp. 4:1-4:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
https://doi.org/10.4230/OASIcs.ATMOS.2019.4

Abstract

We present robust, adaptive routing policies for time-varying networks (temporal graphs) in the presence of random edge-failures. Such a policy answers the following question: How can a traveler navigate a time-varying network where edges fail randomly in order to maximize the traveler’s preference with respect to the arrival time? Our routing policy is computable in near-linear time in the number of edges in the network (for the case when the edges fail independently of each other). Using our robust routing policy, we show how to travel in a public transit network where the vehicles experience delays. To validate our approach, we present experiments using real-world delay data from the public transit network of the city of Zurich. Our experiments show that we obtain significantly improved outcomes compared to a purely schedule-based policy: The traveler is on time 5-11 percentage points more often for most destinations and 20-40 percentage points more often for certain remote destinations. Our implementation shows that the approach is fast enough for real-time usage. It computes a policy for 1-hour long journeys in around 0.1 seconds.

Subject Classification

ACM Subject Classification
  • Theory of computation → Graph algorithms analysis
Keywords
  • Route Planning
  • Public Transit Network
  • Temporal Graphs

Metrics

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

References

  1. Eleni C. Akrida, Jurek Czyzowicz, Leszek Gasieniec, Lukasz Kuszner, and Paul G. Spirakis. Temporal Flows in Temporal Networks. In Algorithms and Complexity - 10th International Conference, CIAC 2017, Athens, Greece, May 24-26, 2017, Proceedings, pages 43-54, 2017. URL: https://doi.org/10.1007/978-3-319-57586-5_5.
  2. Dimitri P. Bertsekas. Dynamic programming and optimal control, 3rd Edition. Athena Scientific, 2005. URL: http://www.worldcat.org/oclc/314894080.
  3. Justin A. Boyan and Michael Mitzenmacher. IMproved results for route planning in stochastic transportation. In Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA., pages 895-902, 2001. URL: http://dl.acm.org/citation.cfm?id=365411.365803.
  4. Mayur Datar and Abhiram G. Ranade. Commuting with delay prone buses. In Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, January 9-11, 2000, San Francisco, CA, USA., pages 22-29, 2000. URL: http://dl.acm.org/citation.cfm?id=338219.338228.
  5. Yann Disser, Matthias Müller-Hannemann, and Mathias Schnee. Multi-criteria Shortest Paths in Time-Dependent Train Networks. In Experimental Algorithms, 7th International Workshop, WEA 2008, Provincetown, MA, USA, May 30-June 1, 2008, Proceedings, pages 347-361, 2008. URL: https://doi.org/10.1007/978-3-540-68552-4_26.
  6. Yueyue Fan and Yu Nie. Optimal Routing for Maximizing the Travel Time Reliability. Networks and Spatial Economics, 6(3):333-344, September 2006. URL: https://doi.org/10.1007/s11067-006-9287-6.
  7. H. Frank. Shortest Paths in Probabilistic Graphs. Operations Research, 17(4):583-599, 1969. URL: https://doi.org/10.1287/opre.17.4.583.
  8. Viswanath Gunturi, Shashi Shekhar, and Arnab Bhattacharya. Minimum Spanning Tree on Spatio-Temporal Networks. In Database and Expert Systems Applications, 21th International Conference, DEXA 2010, Bilbao, Spain, August 30 - September 3, 2010, Proceedings, Part II, pages 149-158, 2010. URL: https://doi.org/10.1007/978-3-642-15251-1_11.
  9. Dirk Heidemann. Queue length and delay distributions at traffic signals. Transportation Research Part B: Methodological, 28(5):377-389, 1994. URL: https://doi.org/10.1016/0191-2615(94)90036-1.
  10. Petter Holme and Jari Saramäki. Temporal Networks. CoRR, abs/1108.1780, 2011. URL: http://arxiv.org/abs/1108.1780.
  11. Darrell Hoy and Evdokia Nikolova. Approximately Optimal Risk-averse Routing Policies via Adaptive Discretization. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, AAAI'15, pages 3533-3539. AAAI Press, 2015. URL: http://dl.acm.org/citation.cfm?id=2888116.2888207.
  12. David Kempe, Jon M. Kleinberg, and Amit Kumar. Connectivity and inference problems for temporal networks. In Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, May 21-23, 2000, Portland, OR, USA, pages 504-513, 2000. URL: https://doi.org/10.1145/335305.335364.
  13. Mohammad H Keyhani, Mathias Schnee, Karsten Weihe, and Hans-Peter Zorn. Reliability and delay distributions of train connections. In OASIcs-OpenAccess Series in Informatics, volume 25. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2012. Google Scholar
  14. Mohammad Hossein Keyhani. Computing Highly Reliable Train Journeys. PhD thesis, Technische Universität, Darmstadt, 2017. Google Scholar
  15. Ronald Prescott Loui. Optimal Paths in Graphs with Stochastic or Multidimensional Weights. Commun. ACM, 26(9):670-676, September 1983. URL: https://doi.org/10.1145/358172.358406.
  16. Matthias Müller-Hannemann and Mathias Schnee. Finding All Attractive Train Connections by Multi-criteria Pareto Search. In Algorithmic Methods for Railway Optimization, International Dagstuhl Workshop, Dagstuhl Castle, Germany, June 20-25, 2004, 4th International Workshop, ATMOS 2004, Bergen, Norway, September 16-17, 2004, Revised Selected Papers, pages 246-263, 2004. URL: https://doi.org/10.1007/978-3-540-74247-0_13.
  17. Mehrdad Niknami and Samitha Samaranayake. Tractable Pathfinding for the Stochastic On-Time Arrival Problem. In Experimental Algorithms - 15th International Symposium, SEA 2016, St. Petersburg, Russia, June 5-8, 2016, Proceedings, pages 231-245, 2016. URL: https://doi.org/10.1007/978-3-319-38851-9_16.
  18. Evangelia Pyrga, Frank Schulz, Dorothea Wagner, and Christos D. Zaroliagis. Experimental Comparison of Shortest Path Approaches for Timetable Information. In Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, New Orleans, LA, USA, January 10, 2004, pages 88-99, 2004. Google Scholar
  19. S. Samaranayake, S. Blandin, and A. Bayen. A tractable class of algorithms for reliable routing in stochastic networks. Transportation Research Part C: Emerging Technologies, 20(1):199-217, 2012. Special issue on Optimization in Public Transport+ISTT2011. URL: https://doi.org/10.1016/j.trc.2011.05.009.
  20. B Bui Xuan, Afonso Ferreira, and Aubin Jarry. Computing shortest, fastest, and foremost journeys in dynamic networks. International Journal of Foundations of Computer Science, 14(02):267-285, 2003. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact