2009
DOI: 10.1007/978-3-642-05465-5_10
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Timetable Information in the Presence of Delays

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
23
0

Year Published

2009
2009
2019
2019

Publication Types

Select...
5
3
2

Relationship

1
9

Authors

Journals

citations
Cited by 37 publications
(23 citation statements)
references
References 9 publications
0
23
0
Order By: Relevance
“…However, as pointed out in [6,8], such techniques are generally not incomparable to the state-of-the-art methods that process queries on G instead of G ′ . On the other hand, techniques in the second category [11,13,15,18,30,31,33,36] considers query types that are more sophisticated than EAP, LDP, SDP, in that they take into account advanced query constraints, such as the cost of making a transfer, the fare of a ride, etc.…”
Section: Related Workmentioning
confidence: 99%
“…However, as pointed out in [6,8], such techniques are generally not incomparable to the state-of-the-art methods that process queries on G instead of G ′ . On the other hand, techniques in the second category [11,13,15,18,30,31,33,36] considers query types that are more sophisticated than EAP, LDP, SDP, in that they take into account advanced query constraints, such as the cost of making a transfer, the fare of a ride, etc.…”
Section: Related Workmentioning
confidence: 99%
“…Making journey planning algorithms more robust to heavy delays has been studied before [7,12,14,15,18,19], but none of these papers has considered GPS feeds. An important building block for our work is to predict the near future from the current traffic situation.…”
Section: Introductionmentioning
confidence: 99%
“…Another very important problem is how to handle updates in case of delays. It seems as if updating a time-expanded graph is rather expensive, though possible [3,16].…”
Section: Resultsmentioning
confidence: 99%