Trainspotting: Extraction and Analysis of Traffic and Topologies of Transportation Networks
Maciej Kurant, Patrick Thiran
Abstract
The knowledge of real-life traffic pattern is crucial for good understanding and analysis of transportation systems. This data is quite rare. In this paper we propose an algorithm for extracting both the real physical topology and the network of traffic flows from timetables of public mass transportation systems. We apply this algorithm to timetables of three large transportation networks. This enables us to make a systematic comparison between three different approaches to construct a graph representation of a transportation network; the resulting graphs are fundamentally different. We also find that the real-life traffic pattern is very heterogenous, both in space and traffic flow intensities.
Create a lesson
Related papers
Is higher-order physics different?
Pablo Villegas, Sandro Meloni
The dynamics of early transoceanic voyages: A resource-coupled model of crew health and survival
Nuno Crokidakis
When higher-order interactions matter: reducibility, parsimony, and microscopic organization
Alex Arenas, Federico Battiston, Andrea Gabrielli
Geography as the Organizing Grammar of Geospatial Models
Rajiv Ranjan, Shashank Tamaskar
Towards stratified sampling for redistricting plans
Zijian Wang, Gregory J. Herschlag, Joon-Hyeok Yim et al.
BanglaShop-CRS: A User-Centric Bangla Dataset for Conversational Recommendation
Tabia Tanzin Prama, Christopher M. Danforth, Peter Sheridan Dodds