2013
DOI: 10.1007/978-3-642-38527-8_6
|View full text |Cite
|
Sign up to set email alerts
|

Intriguingly Simple and Fast Transit Routing

Abstract: This paper studies the problem of computing optimal journeys in dynamic public transit networks. We introduce a novel algorithmic framework, called Connection Scan Algorithm (CSA), to compute journeys. It organizes data as a single array of connections, which it scans once per query. Despite its simplicity, our algorithm is very versatile. We use it to solve earliest arrival and multi-criteria profile queries. Moreover, we extend it to handle the minimum expected arrival time (MEAT) problem, which incorporates… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
86
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
5
2
2

Relationship

1
8

Authors

Journals

citations
Cited by 75 publications
(86 citation statements)
references
References 13 publications
0
86
0
Order By: Relevance
“…In the past several routing algorithms have been developed to solve this problem. 10,11,12 Instead of developing a new algorithm, we decided to choose one that fits our needs. As the routing algorithm will be used heavily during simulation, the speed of a single route search requests is quite important.…”
Section: Public Transport In Mobitoppmentioning
confidence: 99%
See 1 more Smart Citation
“…In the past several routing algorithms have been developed to solve this problem. 10,11,12 Instead of developing a new algorithm, we decided to choose one that fits our needs. As the routing algorithm will be used heavily during simulation, the speed of a single route search requests is quite important.…”
Section: Public Transport In Mobitoppmentioning
confidence: 99%
“…Transfer times are only relevant, if the vehicle (trip) of the connection has not already been used. If the arrival time is updated, all footpaths of this stop are used to update the arrival time at the other stop of each footpath 12,14 . The algorithm is described in pseudocode in Listing 1.…”
Section: Connection Scan Algorithmmentioning
confidence: 99%
“…The Ј parameter is usually calculated using General Transit Feed Specification (GTFS) data -if available for the city, and computed using the Connection Scan Algorithm (Dibbelt et al, 2013) or the RAPTOR algorithm (Delling et al, 2012). The limitation of these methods is the huge computational time required.…”
Section: Modal Splitmentioning
confidence: 99%
“…We have chosen this approach to get a broad view on how the newly-introduced connections can massively affect a large network. We have used the connection scan algorithm (CSA) [48] as an EAT implementation, since it matches with our notion of connection. In short, CSA works by receiving a stream of connections ordered by departure time and chooses the fastest way to reach one stop from another.…”
Section: Calculating Routes Using Discovered Connectionsmentioning
confidence: 99%