pith. sign in

arxiv: 2505.11230 · v1 · pith:MP2HET37new · submitted 2025-05-16 · 💻 cs.LG

Learning traffic flows: Graph Neural Networks for Metamodelling Traffic Assignment

classification 💻 cs.LG
keywords trafficassignmentequilibriumlarge-scalenetworksapproachconventionaldata
0
0 comments X
read the original abstract

The Traffic Assignment Problem is a fundamental, yet computationally expensive, task in transportation modeling, especially for large-scale networks. Traditional methods require iterative simulations to reach equilibrium, making real-time or large-scale scenario analysis challenging. In this paper, we propose a learning-based approach using Message-Passing Neural Networks as a metamodel to approximate the equilibrium flow of the Stochastic User Equilibrium assignment. Our model is designed to mimic the algorithmic structure used in conventional traffic simulators allowing it to better capture the underlying process rather than just the data. We benchmark it against other conventional deep learning techniques and evaluate the model's robustness by testing its ability to predict traffic flows on input data outside the domain on which it was trained. This approach offers a promising solution for accelerating out-of-distribution scenario assessments, reducing computational costs in large-scale transportation planning, and enabling real-time decision-making.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Generalising Travel Time Prediction To Varying Route Choices In Urban Networks

    cs.MA 2026-05 unverdicted novelty 5.0

    GenTTP is a generalized predictor that learns to forecast network-wide travel times and flows for arbitrary route choice distributions rather than only typical daily patterns.