License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ATMOS.2013.15
URN: urn:nbn:de:0030-drops-42415
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2013/4241/
Go to the corresponding OASIcs Volume Portal

Firmani, Donatella ; Italiano, Giuseppe F. ; Laura, Luigi ; Santaroni, Federico

Is Timetabling Routing Always Reliable for Public Transport?

pdf-format:
3.pdf (0.7 MB)

Abstract

Current route planning algorithms for public transport networks are mostly based on timetable information only, i.e., they compute shortest routes under the assumption that all transit vehicles (e.g., buses, subway trains) will incur in no delays throughout their trips. Unfortunately, unavoidable and unexpected delays often prevent transit vehicles to respect their originally planned schedule. In this paper, we try to measure empirically the quality of the solutions offered by timetabling routing in a real public transport network, where unpredictable delays may happen with a certain frequency, such as the public transport network of the metropolitan area of Rome. To accomplish this task, we take the time estimates required for trips provided by a timetabling-based route planner (such as Google Transit) and compare them against the times taken by the trips according to the actual tracking of transit vehicles in the transport network, measured through the GPS data made available by the transit agency. In our experiments, the movement of transit vehicles was only mildly correlated to the timetable, giving strong evidence that in such a case timetabled routing may fail to deliver optimal or even high-quality solutions.

BibTeX - Entry

@InProceedings{firmani_et_al:OASIcs:2013:4241,
  author =	{Donatella  Firmani and Giuseppe F.  Italiano and Luigi Laura and Federico  Santaroni},
  title =	{{Is Timetabling Routing Always Reliable for Public Transportl}},
  booktitle =	{13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems},
  pages =	{15--26},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-58-3},
  ISSN =	{2190-6807},
  year =	{2013},
  volume =	{33},
  editor =	{Daniele Frigioni and Sebastian Stiller},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2013/4241},
  URN =		{urn:nbn:de:0030-drops-42415},
  doi =		{10.4230/OASIcs.ATMOS.2013.15},
  annote =	{Keywords: Shortest Path Problems, Route Planning, Timetable-based Routing, Public Transport Networks}
}

Keywords: Shortest Path Problems, Route Planning, Timetable-based Routing, Public Transport Networks
Collection: 13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems
Issue Date: 2013
Date of publication: 05.09.2013

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI