Name
Abstract | ||
|---|---|---|
We study the journey planning problem in public transit networks. Developing efficient preprocessing-based speedup techniques for this problem has been challenging: current approaches either require massive preprocessing effort or provide limited speedups. Leveraging recent advances in Hub Labeling, the fastest algorithm for road networks, we revisit the well-known time-expanded model for public transit. Exploiting domain-specific properties, we provide simple and efficient algorithms for the earliest arrival, profile, and multicriteria problems, with queries that are orders of magnitude faster than the state of the art. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-20086-6_21 | SEA |
Field | DocType | Volume |
Fishery,Road networks,Computer science,Operations research,Public transport,Preprocessor,Computer engineering,Speedup | Journal | abs/1505.01446 |
ISSN | Citations | PageRank |
0302-9743 | 9 | 0.53 |
References | Authors | |
21 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel Delling | 1 | 2049 | 108.90 |
| Julian Dibbelt | 2 | 107 | 11.67 |
| Thomas Pajor | 3 | 397 | 22.39 |
| Renato F. Werneck | 4 | 1743 | 84.33 |