Dynamic Public Transit Labeling

We study the journey planning problem in transit networks which, given the timetable of a schedule-based transit system, asks to answer to queries such as, e.g., “seek a journey that arrives at a given destination as early as possible”. The state-of-the-art solution to such problem, in terms of query time, is Public Transit Labeling (ptl), proposed in [Delling et al., SEA 2015], that consists of three main ingredients: (i) a graph data structure for storing transit networks; (ii) a compact labeling-based representation of the transitive closure of such graph, computed via a time-consuming preprocessing routine; (iii) an efficient query algorithm exploiting both graph and precomputed data to answer quickly to queries of interest at runtime.

[1]  Lina Yao,et al.  Efficient computation of distance labeling for decremental updates in large dynamic graphs , 2016, World Wide Web.

[2]  Andrew V. Goldberg,et al.  Customizable Route Planning in Road Networks , 2017, Transp. Sci..

[3]  James Cheng,et al.  TF-Label: a topological-folding labeling scheme for reachability querying in a large graph , 2013, SIGMOD '13.

[4]  Daniele Frigioni,et al.  Fully Dynamic 2-Hop Cover Labeling , 2019, ACM J. Exp. Algorithmics.

[5]  Daniel Delling,et al.  Round-Based Public Transit Routing , 2015 .

[6]  Mattia D'Emidio,et al.  Fully dynamic update of arc‐flags , 2014, Networks.

[7]  Mattia D'Emidio,et al.  Engineering graph-based models for dynamic timetable information systems , 2017, J. Discrete Algorithms.

[8]  Yi Yang,et al.  Efficient Route Planning on Public Transportation Networks: A Labelling Approach , 2015, SIGMOD Conference.

[9]  Andrew V. Goldberg,et al.  Route Planning in Transportation Networks , 2015, Algorithm Engineering.

[10]  Edith Cohen,et al.  Reachability and distance queries via 2-hop labels , 2002, SODA '02.

[11]  Daniel Delling,et al.  Public Transit Labeling , 2015, SEA.

[12]  Mattia D'Emidio,et al.  On Mining Distances in Large-Scale Dynamic Graphs , 2018, ICTCS.

[13]  Takuya Akiba,et al.  Fast and scalable reachability queries on graphs by pruned labeling with landmarks and paths , 2013, CIKM.

[14]  Sibo Wang,et al.  Reachability queries on large dynamic graphs: a total order approach , 2014, SIGMOD Conference.

[15]  Mattia D'Emidio,et al.  Distance Queries in Large-Scale Fully Dynamic Complex Networks , 2016, IWOCA.

[16]  Christos D. Zaroliagis,et al.  Efficient models for timetable information in public transportation systems , 2008, JEAL.

[17]  Takuya Akiba,et al.  Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling , 2014, WWW.

[18]  Ben Strasser,et al.  Connection Scan Algorithm , 2017, ACM J. Exp. Algorithmics.