Transportation Scenario Planning with Graph Neural Networks
Not on the map. Why?
Abstract (arXiv)
Providing efficient human mobility services and infrastructure is one of the major concerns of most mid-sized to large cities around the world. A proper understanding of the dynamics of commuting flows is, therefore, a requisite to better plan urban areas. In this context, an important task is to study hypothetical scenarios in which possible future changes are evaluated. For instance, how the increase in residential units or transportation modes in a neighborhood will change the commuting flows to or from that region? In this paper, we propose to leverage GMEL, a recently introduced graph neural network model, to evaluate changes in commuting flows taking into account different land use and infrastructure scenarios. We validate the usefulness of our methodology through real-world case studies set in two large cities in Brazil.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 10 of its 33 references that are in the map. First posted on arXiv 25 Oct 2021.
Builds on
10 of 33 references.
References · 10
- 2017Graph Attention Networkscited by 8,923
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2018How Powerful are Graph Neural Networks?cited by 4,393
- 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,138
- 2013Spectral Networks and Locally Connected Networks on Graphscited by 1,102
- 2016Molecular Graph Convolutions: Moving Beyond Fingerprintscited by 238
- 2020Learning Geo-Contextual Embeddings for Commuting Flow Predictioncited by 28
- 2020Reimagining City Configuration: Automated Urban Planning via Adversarial Learningcited by 18
- 2017A Machine Learning Approach to Modeling Human Migrationcited by 15
- 2019Shadow Accrual Maps: Efficient Accumulation of City-Scale Shadows Over Timecited by 6
Built on by
Not cited yet.