Bösch, Patrick M.
Axhausen, Kay W.
- Working Paper
This paper reports an implementation of a public transit route mapping algorithm for large-scale networks. The algorithm, originally proposed by Li (2012), identifies the network path of a public transit route based on the route’s stop sequence. This mapping of the routes onto networks is required to simulate mixed traffic in transport simulations and thus to observe and study, for example, the interaction effects between public transit vehicles and car traffic. It also enables a realistic visualization of public transit in the simulations. The algorithm uses an abstract graph to calculate the least-cost path from a route’s first to its last stop, with the constraint that the path must contain a so-called link candidate for every stop of the route’s stop sequence. The algorithm has been implemented for MATSim and mapping accuracy has been tested with a Zurich, Switzerland data set Show more
External linksSearch via SFX
Journal / seriesArbeitsberichte Verkehrs- und Raumplanung
PublisherIVT, ETH Zürich
SubjectMapping; Map-Matching; Public Transit; Transit Routes
Organisational unit03521 - Axhausen, Kay W. / Axhausen, Kay W.
02226 - NSL - Netzwerk Stadt und Landschaft / NSL - Network City and Landscape
02655 - Netzwerk Stadt und Landschaft D-ARCH
Related publications and datasets
Is previous version of: https://doi.org/10.3929/ethz-b-000181073
MoreShow all metadata