Document Open Access Logo

Robust Routing in Urban Public Transportation: Evaluating Strategies that Learn From the Past

Authors Katerina Böhmová, Matúš Mihalák, Peggy Neubert, Tobias Pröger, Peter Widmayer

PDF
Thumbnail PDF

File

OASIcs.ATMOS.2015.68.pdf
  • Filesize: 0.96 MB
  • 14 pages

Document Identifiers

Author Details

Katerina Böhmová
Matúš Mihalák
Peggy Neubert
Tobias Pröger
Peter Widmayer

Cite AsGet BibTex

Katerina Böhmová, Matúš Mihalák, Peggy Neubert, Tobias Pröger, and Peter Widmayer. Robust Routing in Urban Public Transportation: Evaluating Strategies that Learn From the Past. In 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015). Open Access Series in Informatics (OASIcs), Volume 48, pp. 68-81, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
https://doi.org/10.4230/OASIcs.ATMOS.2015.68

Abstract

Given an urban public transportation network and historic delay information, we consider the problem of computing reliable journeys. We propose new algorithms based on our recently presented solution concept (Böhmová et al., ATMOS 2013), and perform an experimental evaluation using real-world delay data from Zürich, Switzerland. We compare these methods to natural approaches as well as to our recently proposed method which can also be used to measure typicality of past observations. Moreover, we demonstrate how this measure relates to the predictive quality of the individual methods. In particular, if the past observations are typical, then the learning- based methods are able to produce solutions that perform well on typical days, even in the presence of large delays.
Keywords
  • public transportation
  • route planning
  • robustness
  • optimization
  • experiments

Metrics

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

References

  1. 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, 2014. Google Scholar
  2. Hannah Bast, Jonas Sternisko, Sabine Storandt, et al. Delay-robustness of transfer patterns in public transportation route planning. In ATMOS, pages 42-54, 2013. Google Scholar
  3. Kateřina Böhmová, Matúš Mihalák, Tobias Pröger, Rastislav Šrámek, and Peter Widmayer. Robust routing in urban public transportation: How to find reliable journeys based on past observations. In ATMOS, pages 27-41, 2013. Google Scholar
  4. Justin Boyan and Michael Mitzenmacher. Improved results for route planning in stochastic transportation. In SODA, pages 895-902, 2001. Google Scholar
  5. Joachim M. Buhmann, Matúš Mihalák, Rastislav Šrámek, and Peter Widmayer. Robust optimization in the presence of uncertainty. In ITCS, pages 505-514, 2013. Google Scholar
  6. Julian Dibbelt, Thomas Pajor, Ben Strasser, and Dorothea Wagner. Intriguingly simple and fast transit routing. In SEA, pages 43-54, 2013. Google Scholar
  7. Julian Dibbelt, Ben Strasser, and Dorothea Wagner. Delay-robust journeys in timetable networks with minimum expected arrival time. In ATMOS, pages 1-14, 2014. Google Scholar
  8. Yann Disser, Matthias Müller-Hannemann, and Mathias Schnee. Multi-criteria shortest paths in time-dependent train networks. In WEA, pages 347-361, 2008. Google Scholar
  9. Donatella Firmani, Giuseppe F. Italiano, Luigi Laura, and Federico Santaroni. Is timetabling routing always reliable for public transport? In ATMOS, pages 15-26, 2013. Google Scholar
  10. H Frank. Shortest paths in probabilistic graphs. Operations Research, 17(4):583-599, 1969. Google Scholar
  11. Marc Goerigk, Sacha Heße, Matthias Müller-Hannemann, Marie Schmidt, and Anita Schöbel. Recoverable robust timetable information. In ATMOS, pages 1-14, 2013. Google Scholar
  12. Marc Goerigk, Martin Knoth, Matthias Müller-Hannemann, Marie Schmidt, and Anita Schöbel. The price of robustness in timetable information. In ATMOS, pages 76-87, 2011. Google Scholar
  13. Sejoon Lim, Christian Sommer, Evdokia Nikolova, and Daniela Rus. Practical route planning under delay uncertainty: Stochastic shortest path queries. In Robotics: Science and Systems VIII, 2012. Google Scholar
  14. Matthias Müller-Hannemann and Mathias Schnee. Efficient timetable information in the presence of delays. In Robust and Online Large-Scale Optimization, pages 249-272. Springer, 2009. Google Scholar
  15. Evdokia Nikolova, Jonathan A Kelner, Matthew Brand, and Michael Mitzenmacher. Stochastic shortest paths via quasi-convex maximization. In ESA, pages 552-563, 2006. 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