Metadata only
Date
2016-11Type
- Working Paper
ETH Bibliography
yes
Altmetrics
Abstract
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
Publication status
publishedJournal / series
Arbeitsberichte Verkehrs- und RaumplanungVolume
Publisher
IVT, ETH ZürichSubject
Mapping; Map-Matching; Public Transit; Transit RoutesOrganisational unit
03521 - Axhausen, Kay W. (emeritus) / Axhausen, Kay W. (emeritus)
02226 - NSL - Netzwerk Stadt und Landschaft / NSL - Network City and Landscape
02655 - Netzwerk Stadt u. Landschaft ARCH u BAUG / Network City and Landscape ARCH and BAUG
Related publications and datasets
Is previous version of: https://doi.org/10.3929/ethz-b-000181073
More
Show all metadata
ETH Bibliography
yes
Altmetrics