Abstract
Current journey planners for public transport are mostly based on timetabling, i.e., they hinge on the assumption that all transit vehicles run on schedule. Unfortunately, this might not always be realistic, as unpredictable delays may occur quite often in practice. In this case, it seems quite natural to ask whether the availability of real-time updates on the geo-location of transit vehicles may help improving the quality of the solutions offered by routing algorithms. To address this question, we consider the public transport network of the metropolitan area of Rome, where delays are not rare events, and report the results of our experiments with two journey planners that are widely used for this city: one based on timetabling information only (Google Transit) and one which makes explicit use of GPS data on the geo-location of transit vehicles (Muovi Roma).
Work partially supported by the Italian Ministry of Education, University and Research, under Project AMANDA (Algorithmics for MAssive and Networked DAta).
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
Preview
Unable to display preview. Download preview PDF.
References
Agenzia Roma servizi per la Mobilità. Muoversi a Roma (2014), http://www.agenziamobilita.roma.it/servizi/open-data/ (Online; accessed January 2014)
Abraham, I., Delling, D., Fiat, A., Goldberg, A.V., Werneck, R.F.F.: VC-dimension and shortest path algorithms. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol. 6755, pp. 690–699. Springer, Heidelberg (2011)
Abraham, I., Fiat, A., Goldberg, A.V., Werneck, R.F.F.: Highway dimension, shortest paths, and provably efficient algorithms. In: SODA 2010, pp. 782–793. SIAM, Philadelphia (2010)
Bast, H., Delling, D., Goldberg, A.V., Müller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., Werneck, R.: Route planning in transportation networks. Tech. Rep. MSR-TR-2014-4, Microsoft Research (2014)
Bast, H., Funke, S., Matijevic, D., Sanders, P., Schultes, D.: In transit to constant time shortest-path queries in road networks. In: ALENEX 2007. SIAM, Philadelphia (2007)
Bast, H.: Car or public transport - Two worlds. In: Albers, S., Alt, H., Näher, S. (eds.) Efficient Algorithms. LNCS, vol. 5760, pp. 355–367. Springer, Heidelberg (2009)
Bast, H., Carlsson, E., Eigenwillig, A., Geisberger, R., Harrelson, C., Raychev, V., Viger, F.: Fast routing in very large public transportation networks using Transfer Patterns. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part I. LNCS, vol. 6346, pp. 290–301. Springer, Heidelberg (2010)
Bast, H., Sternisko, J., Storandt, S.: Delay-robustness of Transfer Patterns in public transportation route planning. In: ATMOS 2013. OASICS, vol. 33, pp. 42–54. Schloss Dagstuhl (2013)
Delling, D., Pajor, T., Werneck, R.F.F.: Round-based public transit routing. In: ALENEX 2012, pp. 130–140. SIAM, Philadelphia (2012)
Dibbelt, J., Pajor, T., Strasser, B., Wagner, D.: Intriguingly simple and fast transit routing. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds.) SEA 2013. LNCS, vol. 7933, pp. 43–54. Springer, Heidelberg (2013)
Firmani, D., Italiano, G.F., Laura, L., Santaroni, F.: Is timetabling routing always reliable for public transport? In: ATMOS 2013. OASICS, vol. 33, Schloss Dagstuhl (2013)
Geisberger, R.: Contraction of timetable networks with realistic transfers. In: Festa, P. (ed.) SEA 2010. LNCS, vol. 6049, pp. 71–82. Springer, Heidelberg (2010)
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)
Goldberg, A.V., Kaplan, H., Werneck, R.F.: Reach for A*: Efficient point-to-point shortest path algorithms. In: ALENEX 2006, pp. 129–143. SIAM, Philadelphia (2006)
Gutman, R.J.: Reach-based routing: A new approach to shortest path algorithms optimized for road networks. In: ALENEX/ANALC 2004, pp. 100–111. SIAM, Philadelphia (2004)
Sanders, P., Schultes, D.: Highway hierarchies hasten exact shortest path queries. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 568–579. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Allulli, L., Italiano, G.F., Santaroni, F. (2014). Exploiting GPS Data in Public Transport Journey Planners. In: Gudmundsson, J., Katajainen, J. (eds) Experimental Algorithms. SEA 2014. Lecture Notes in Computer Science, vol 8504. Springer, Cham. https://doi.org/10.1007/978-3-319-07959-2_25
Download citation
DOI: https://doi.org/10.1007/978-3-319-07959-2_25
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07958-5
Online ISBN: 978-3-319-07959-2
eBook Packages: Computer ScienceComputer Science (R0)